./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/implicit_constructor_hierarchy.sol_5_no_adts_000.smt2 .


--------------------------------------------------------------------------------


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:29:16,937 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:29:16,975 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb71c1a4-e74f-4c75-af77-ca3174be8f35/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:29:16,978 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:29:16,978 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:29:16,992 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:29:16,992 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:29:16,992 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:29:16,992 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:29:16,992 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:29:16,993 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:29:16,993 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:29:16,993 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:29:16,993 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:29:16,993 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:29:16,993 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:29:16,993 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:29:16,993 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:29:16,993 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:29:16,993 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:29:16,993 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:29:16,993 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:29:16,993 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:29:16,993 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:29:16,994 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:29:16,994 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:29:16,994 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:29:17,176 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:29:17,184 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:29:17,186 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:29:17,188 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:29:17,188 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:29:17,189 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb71c1a4-e74f-4c75-af77-ca3174be8f35/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/implicit_constructor_hierarchy.sol_5_no_adts_000.smt2
[2025-05-07 17:29:17,190 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:29:17,193 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:29:17,533 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb71c1a4-e74f-4c75-af77-ca3174be8f35/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/implicit_constructor_hierarchy.sol_5_no_adts_000.smt2
[2025-05-07 17:29:17,536 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:29:17,537 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:29:17,538 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:29:17,538 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:29:17,539 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:29:17,541 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,584 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17 Unit
[2025-05-07 17:29:17,584 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:29:17,585 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:29:17,585 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:29:17,585 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:29:17,600 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,601 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,630 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,630 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,637 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,638 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,640 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,643 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,644 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,658 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:29:17,659 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:29:17,659 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:29:17,659 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:29:17,659 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,661 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:29:17,673 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:17,683 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-05-07 17:29:17,686 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:29:17,695 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:29:17,696 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:29:17,696 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:29:17,696 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_9_0 given in one single declaration
[2025-05-07 17:29:17,696 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_9_0
[2025-05-07 17:29:17,696 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_9_0
[2025-05-07 17:29:17,696 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_6_B_35_0 given in one single declaration
[2025-05-07 17:29:17,696 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_6_B_35_0
[2025-05-07 17:29:17,697 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_6_B_35_0
[2025-05-07 17:29:17,697 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_38_B_35_0 given in one single declaration
[2025-05-07 17:29:17,697 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_38_B_35_0
[2025-05-07 17:29:17,697 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_38_B_35_0
[2025-05-07 17:29:17,697 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_28_B_35_0 given in one single declaration
[2025-05-07 17:29:17,697 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_28_B_35_0
[2025-05-07 17:29:17,697 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_28_B_35_0
[2025-05-07 17:29:17,697 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_8_constructor_34_35_0 given in one single declaration
[2025-05-07 17:29:17,698 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_8_constructor_34_35_0
[2025-05-07 17:29:17,698 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_8_constructor_34_35_0
[2025-05-07 17:29:17,698 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_27_constructor_34_35_0 given in one single declaration
[2025-05-07 17:29:17,698 INFO  L130     BoogieDeclarations]: Found specification of procedure block_27_constructor_34_35_0
[2025-05-07 17:29:17,698 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_27_constructor_34_35_0
[2025-05-07 17:29:17,698 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_25__33_35_0 given in one single declaration
[2025-05-07 17:29:17,698 INFO  L130     BoogieDeclarations]: Found specification of procedure block_25__33_35_0
[2025-05-07 17:29:17,698 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_25__33_35_0
[2025-05-07 17:29:17,698 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_24_constructor_34_35_0 given in one single declaration
[2025-05-07 17:29:17,699 INFO  L130     BoogieDeclarations]: Found specification of procedure block_24_constructor_34_35_0
[2025-05-07 17:29:17,699 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_24_constructor_34_35_0
[2025-05-07 17:29:17,699 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_26_return_constructor_34_35_0 given in one single declaration
[2025-05-07 17:29:17,699 INFO  L130     BoogieDeclarations]: Found specification of procedure block_26_return_constructor_34_35_0
[2025-05-07 17:29:17,699 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_26_return_constructor_34_35_0
[2025-05-07 17:29:17,699 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_30_B_35_0 given in one single declaration
[2025-05-07 17:29:17,699 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_30_B_35_0
[2025-05-07 17:29:17,699 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_30_B_35_0
[2025-05-07 17:29:17,699 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_29_B_35_0 given in one single declaration
[2025-05-07 17:29:17,700 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_29_B_35_0
[2025-05-07 17:29:17,700 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_29_B_35_0
[2025-05-07 17:29:17,700 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_35_A_19_0 given in one single declaration
[2025-05-07 17:29:17,700 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_35_A_19_0
[2025-05-07 17:29:17,700 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_35_A_19_0
[2025-05-07 17:29:17,700 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_7_constructor_18_35_0 given in one single declaration
[2025-05-07 17:29:17,700 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_7_constructor_18_35_0
[2025-05-07 17:29:17,700 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_7_constructor_18_35_0
[2025-05-07 17:29:17,700 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_33_return_constructor_18_35_0 given in one single declaration
[2025-05-07 17:29:17,700 INFO  L130     BoogieDeclarations]: Found specification of procedure block_33_return_constructor_18_35_0
[2025-05-07 17:29:17,700 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_33_return_constructor_18_35_0
[2025-05-07 17:29:17,701 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_32__17_35_0 given in one single declaration
[2025-05-07 17:29:17,701 INFO  L130     BoogieDeclarations]: Found specification of procedure block_32__17_35_0
[2025-05-07 17:29:17,701 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_32__17_35_0
[2025-05-07 17:29:17,701 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_31_constructor_18_35_0 given in one single declaration
[2025-05-07 17:29:17,701 INFO  L130     BoogieDeclarations]: Found specification of procedure block_31_constructor_18_35_0
[2025-05-07 17:29:17,701 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_31_constructor_18_35_0
[2025-05-07 17:29:17,701 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_34_constructor_18_35_0 given in one single declaration
[2025-05-07 17:29:17,701 INFO  L130     BoogieDeclarations]: Found specification of procedure block_34_constructor_18_35_0
[2025-05-07 17:29:17,701 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_34_constructor_18_35_0
[2025-05-07 17:29:17,701 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_37_A_19_0 given in one single declaration
[2025-05-07 17:29:17,701 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_37_A_19_0
[2025-05-07 17:29:17,701 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_37_A_19_0
[2025-05-07 17:29:17,701 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_36_A_19_0 given in one single declaration
[2025-05-07 17:29:17,702 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_36_A_19_0
[2025-05-07 17:29:17,702 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_36_A_19_0
[2025-05-07 17:29:17,702 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_11_C_48_0 given in one single declaration
[2025-05-07 17:29:17,702 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_11_C_48_0
[2025-05-07 17:29:17,702 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_11_C_48_0
[2025-05-07 17:29:17,702 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_61_C_48_0 given in one single declaration
[2025-05-07 17:29:17,702 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_61_C_48_0
[2025-05-07 17:29:17,702 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_61_C_48_0
[2025-05-07 17:29:17,702 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_44_C_48_0 given in one single declaration
[2025-05-07 17:29:17,702 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_44_C_48_0
[2025-05-07 17:29:17,702 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_44_C_48_0
[2025-05-07 17:29:17,702 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_46_C_48_0 given in one single declaration
[2025-05-07 17:29:17,702 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_46_C_48_0
[2025-05-07 17:29:17,702 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_46_C_48_0
[2025-05-07 17:29:17,702 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_45_C_48_0 given in one single declaration
[2025-05-07 17:29:17,702 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_45_C_48_0
[2025-05-07 17:29:17,702 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_45_C_48_0
[2025-05-07 17:29:17,703 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_58_A_19_0 given in one single declaration
[2025-05-07 17:29:17,703 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_58_A_19_0
[2025-05-07 17:29:17,703 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_58_A_19_0
[2025-05-07 17:29:17,703 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_60_A_19_0 given in one single declaration
[2025-05-07 17:29:17,703 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_60_A_19_0
[2025-05-07 17:29:17,703 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_60_A_19_0
[2025-05-07 17:29:17,703 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_59_A_19_0 given in one single declaration
[2025-05-07 17:29:17,703 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_59_A_19_0
[2025-05-07 17:29:17,703 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_59_A_19_0
[2025-05-07 17:29:17,703 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_12_constructor_18_48_0 given in one single declaration
[2025-05-07 17:29:17,703 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_12_constructor_18_48_0
[2025-05-07 17:29:17,703 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_12_constructor_18_48_0
[2025-05-07 17:29:17,703 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_57_constructor_18_48_0 given in one single declaration
[2025-05-07 17:29:17,703 INFO  L130     BoogieDeclarations]: Found specification of procedure block_57_constructor_18_48_0
[2025-05-07 17:29:17,703 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_57_constructor_18_48_0
[2025-05-07 17:29:17,703 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_55__17_48_0 given in one single declaration
[2025-05-07 17:29:17,703 INFO  L130     BoogieDeclarations]: Found specification of procedure block_55__17_48_0
[2025-05-07 17:29:17,703 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_55__17_48_0
[2025-05-07 17:29:17,703 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_54_constructor_18_48_0 given in one single declaration
[2025-05-07 17:29:17,703 INFO  L130     BoogieDeclarations]: Found specification of procedure block_54_constructor_18_48_0
[2025-05-07 17:29:17,703 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_54_constructor_18_48_0
[2025-05-07 17:29:17,703 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_56_return_constructor_18_48_0 given in one single declaration
[2025-05-07 17:29:17,703 INFO  L130     BoogieDeclarations]: Found specification of procedure block_56_return_constructor_18_48_0
[2025-05-07 17:29:17,704 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_56_return_constructor_18_48_0
[2025-05-07 17:29:17,704 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_51_B_35_0 given in one single declaration
[2025-05-07 17:29:17,704 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_51_B_35_0
[2025-05-07 17:29:17,704 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_51_B_35_0
[2025-05-07 17:29:17,704 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_13_constructor_34_48_0 given in one single declaration
[2025-05-07 17:29:17,704 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_13_constructor_34_48_0
[2025-05-07 17:29:17,704 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_13_constructor_34_48_0
[2025-05-07 17:29:17,704 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_50_constructor_34_48_0 given in one single declaration
[2025-05-07 17:29:17,704 INFO  L130     BoogieDeclarations]: Found specification of procedure block_50_constructor_34_48_0
[2025-05-07 17:29:17,704 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_50_constructor_34_48_0
[2025-05-07 17:29:17,704 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_48__33_48_0 given in one single declaration
[2025-05-07 17:29:17,704 INFO  L130     BoogieDeclarations]: Found specification of procedure block_48__33_48_0
[2025-05-07 17:29:17,704 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_48__33_48_0
[2025-05-07 17:29:17,704 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_47_constructor_34_48_0 given in one single declaration
[2025-05-07 17:29:17,704 INFO  L130     BoogieDeclarations]: Found specification of procedure block_47_constructor_34_48_0
[2025-05-07 17:29:17,704 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_47_constructor_34_48_0
[2025-05-07 17:29:17,704 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_49_return_constructor_34_48_0 given in one single declaration
[2025-05-07 17:29:17,704 INFO  L130     BoogieDeclarations]: Found specification of procedure block_49_return_constructor_34_48_0
[2025-05-07 17:29:17,704 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_49_return_constructor_34_48_0
[2025-05-07 17:29:17,704 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_53_B_35_0 given in one single declaration
[2025-05-07 17:29:17,704 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_53_B_35_0
[2025-05-07 17:29:17,705 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_53_B_35_0
[2025-05-07 17:29:17,705 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_52_B_35_0 given in one single declaration
[2025-05-07 17:29:17,705 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_52_B_35_0
[2025-05-07 17:29:17,705 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_52_B_35_0
[2025-05-07 17:29:17,705 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:29:17,705 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:29:17,705 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:29:17,901 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:29:17,904 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:29:18,201 INFO  L?                        ?]: Removed 367 outVars from TransFormulas that were not future-live.
[2025-05-07 17:29:18,201 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:29:18,215 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:29:18,216 INFO  L312             CfgBuilder]: Removed 19 assume(true) statements.
[2025-05-07 17:29:18,216 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:29:18 BoogieIcfgContainer
[2025-05-07 17:29:18,216 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:29:18,219 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:29:18,219 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:29:18,223 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:29:18,223 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:29:17" (1/3) ...
[2025-05-07 17:29:18,224 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0f5afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:29:18, skipping insertion in model container
[2025-05-07 17:29:18,224 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (2/3) ...
[2025-05-07 17:29:18,224 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0f5afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:29:18, skipping insertion in model container
[2025-05-07 17:29:18,224 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:29:18" (3/3) ...
[2025-05-07 17:29:18,225 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:29:18,241 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:29:18,244 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 42 procedures, 175 locations, 281 edges, 42 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:29:18,290 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:29:18,302 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b19da8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:29:18,303 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:29:18,306 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 175 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 80 states have internal predecessors, (80), 63 states have call successors, (67), 41 states have call predecessors, (67), 41 states have return successors, (67), 53 states have call predecessors, (67), 63 states have call successors, (67)
[2025-05-07 17:29:18,317 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:29:18,317 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:18,318 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:18,318 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:18,321 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:18,322 INFO  L85        PathProgramCache]: Analyzing trace with hash 1093746234, now seen corresponding path program 1 times
[2025-05-07 17:29:18,327 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:18,328 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215106059]
[2025-05-07 17:29:18,328 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:18,328 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:18,380 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:29:18,430 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:29:18,430 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:18,430 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:18,784 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:18,785 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:18,785 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215106059]
[2025-05-07 17:29:18,785 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215106059] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:18,786 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:18,788 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-05-07 17:29:18,789 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096702288]
[2025-05-07 17:29:18,790 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:18,792 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-05-07 17:29:18,792 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:18,819 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-05-07 17:29:18,820 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132
[2025-05-07 17:29:18,822 INFO  L87              Difference]: Start difference. First operand  has 175 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 80 states have internal predecessors, (80), 63 states have call successors, (67), 41 states have call predecessors, (67), 41 states have return successors, (67), 53 states have call predecessors, (67), 63 states have call successors, (67) Second operand  has 12 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11)
[2025-05-07 17:29:19,095 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:19,095 INFO  L93              Difference]: Finished difference Result 178 states and 220 transitions.
[2025-05-07 17:29:19,096 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-05-07 17:29:19,097 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11) Word has length 41
[2025-05-07 17:29:19,098 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:19,104 INFO  L225             Difference]: With dead ends: 178
[2025-05-07 17:29:19,104 INFO  L226             Difference]: Without dead ends: 177
[2025-05-07 17:29:19,105 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:29:19,107 INFO  L437           NwaCegarLoop]: 202 mSDtfsCounter, 2 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2185 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:19,107 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2185 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:29:19,117 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 177 states.
[2025-05-07 17:29:19,136 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177.
[2025-05-07 17:29:19,137 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 177 states, 70 states have (on average 1.1428571428571428) internal successors, (80), 80 states have internal predecessors, (80), 63 states have call successors, (67), 41 states have call predecessors, (67), 43 states have return successors, (71), 55 states have call predecessors, (71), 63 states have call successors, (71)
[2025-05-07 17:29:19,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 218 transitions.
[2025-05-07 17:29:19,141 INFO  L79                 Accepts]: Start accepts. Automaton has 177 states and 218 transitions. Word has length 41
[2025-05-07 17:29:19,142 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:19,142 INFO  L485      AbstractCegarLoop]: Abstraction has 177 states and 218 transitions.
[2025-05-07 17:29:19,142 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11)
[2025-05-07 17:29:19,142 INFO  L278                IsEmpty]: Start isEmpty. Operand 177 states and 218 transitions.
[2025-05-07 17:29:19,144 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:29:19,144 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:19,144 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:19,144 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:29:19,144 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:19,145 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:19,145 INFO  L85        PathProgramCache]: Analyzing trace with hash 741423634, now seen corresponding path program 1 times
[2025-05-07 17:29:19,145 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:19,145 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227970251]
[2025-05-07 17:29:19,145 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:19,145 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:19,159 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:29:19,171 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:29:19,171 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:19,171 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:19,255 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:19,255 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:19,255 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227970251]
[2025-05-07 17:29:19,255 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227970251] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:19,255 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:19,255 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:29:19,255 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412809430]
[2025-05-07 17:29:19,255 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:19,256 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:29:19,256 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:19,257 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:29:19,257 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:19,257 INFO  L87              Difference]: Start difference. First operand 177 states and 218 transitions. Second operand  has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11)
[2025-05-07 17:29:19,335 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:19,335 INFO  L93              Difference]: Finished difference Result 179 states and 220 transitions.
[2025-05-07 17:29:19,336 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:29:19,336 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 41
[2025-05-07 17:29:19,336 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:19,339 INFO  L225             Difference]: With dead ends: 179
[2025-05-07 17:29:19,339 INFO  L226             Difference]: Without dead ends: 179
[2025-05-07 17:29:19,340 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:29:19,341 INFO  L437           NwaCegarLoop]: 209 mSDtfsCounter, 2 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:19,341 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1233 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:29:19,342 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 179 states.
[2025-05-07 17:29:19,355 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177.
[2025-05-07 17:29:19,356 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 177 states, 70 states have (on average 1.1428571428571428) internal successors, (80), 80 states have internal predecessors, (80), 63 states have call successors, (67), 41 states have call predecessors, (67), 43 states have return successors, (70), 55 states have call predecessors, (70), 63 states have call successors, (70)
[2025-05-07 17:29:19,357 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 217 transitions.
[2025-05-07 17:29:19,357 INFO  L79                 Accepts]: Start accepts. Automaton has 177 states and 217 transitions. Word has length 41
[2025-05-07 17:29:19,357 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:19,357 INFO  L485      AbstractCegarLoop]: Abstraction has 177 states and 217 transitions.
[2025-05-07 17:29:19,357 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11)
[2025-05-07 17:29:19,357 INFO  L278                IsEmpty]: Start isEmpty. Operand 177 states and 217 transitions.
[2025-05-07 17:29:19,359 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:29:19,359 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:19,359 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:19,359 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:29:19,359 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:19,360 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:19,360 INFO  L85        PathProgramCache]: Analyzing trace with hash 1817158550, now seen corresponding path program 1 times
[2025-05-07 17:29:19,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:19,360 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5153368]
[2025-05-07 17:29:19,360 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:19,360 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:19,379 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:29:19,383 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:29:19,384 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:19,384 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:19,425 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:19,425 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:19,425 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5153368]
[2025-05-07 17:29:19,425 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5153368] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:19,426 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:19,426 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:19,426 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239229953]
[2025-05-07 17:29:19,426 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:19,426 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:19,426 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:19,427 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:19,427 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:19,427 INFO  L87              Difference]: Start difference. First operand 177 states and 217 transitions. Second operand  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:29:19,461 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:19,461 INFO  L93              Difference]: Finished difference Result 180 states and 219 transitions.
[2025-05-07 17:29:19,461 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:19,462 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 41
[2025-05-07 17:29:19,462 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:19,464 INFO  L225             Difference]: With dead ends: 180
[2025-05-07 17:29:19,464 INFO  L226             Difference]: Without dead ends: 179
[2025-05-07 17:29:19,464 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:19,465 INFO  L437           NwaCegarLoop]: 209 mSDtfsCounter, 1 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:19,465 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 612 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:19,466 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 179 states.
[2025-05-07 17:29:19,480 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 173.
[2025-05-07 17:29:19,480 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 173 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 78 states have internal predecessors, (78), 61 states have call successors, (65), 41 states have call predecessors, (65), 42 states have return successors, (66), 53 states have call predecessors, (66), 61 states have call successors, (66)
[2025-05-07 17:29:19,483 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 209 transitions.
[2025-05-07 17:29:19,483 INFO  L79                 Accepts]: Start accepts. Automaton has 173 states and 209 transitions. Word has length 41
[2025-05-07 17:29:19,483 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:19,483 INFO  L485      AbstractCegarLoop]: Abstraction has 173 states and 209 transitions.
[2025-05-07 17:29:19,483 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:29:19,483 INFO  L278                IsEmpty]: Start isEmpty. Operand 173 states and 209 transitions.
[2025-05-07 17:29:19,486 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:29:19,486 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:19,486 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:19,486 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:29:19,486 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:19,487 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:19,487 INFO  L85        PathProgramCache]: Analyzing trace with hash 846843531, now seen corresponding path program 1 times
[2025-05-07 17:29:19,487 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:19,487 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953065965]
[2025-05-07 17:29:19,487 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:19,487 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:19,506 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:29:19,510 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:29:19,511 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:19,511 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:19,565 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:19,566 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:19,566 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953065965]
[2025-05-07 17:29:19,566 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953065965] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:19,566 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:19,566 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:19,566 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305078293]
[2025-05-07 17:29:19,566 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:19,566 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:19,566 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:19,567 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:19,567 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:19,567 INFO  L87              Difference]: Start difference. First operand 173 states and 209 transitions. Second operand  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:29:19,611 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:19,611 INFO  L93              Difference]: Finished difference Result 177 states and 215 transitions.
[2025-05-07 17:29:19,611 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:19,612 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 41
[2025-05-07 17:29:19,612 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:19,614 INFO  L225             Difference]: With dead ends: 177
[2025-05-07 17:29:19,614 INFO  L226             Difference]: Without dead ends: 177
[2025-05-07 17:29:19,614 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:19,615 INFO  L437           NwaCegarLoop]: 203 mSDtfsCounter, 1 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:19,615 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 589 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:19,616 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 177 states.
[2025-05-07 17:29:19,621 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175.
[2025-05-07 17:29:19,622 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 175 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 79 states have internal predecessors, (79), 61 states have call successors, (65), 41 states have call predecessors, (65), 43 states have return successors, (69), 54 states have call predecessors, (69), 61 states have call successors, (69)
[2025-05-07 17:29:19,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 213 transitions.
[2025-05-07 17:29:19,623 INFO  L79                 Accepts]: Start accepts. Automaton has 175 states and 213 transitions. Word has length 41
[2025-05-07 17:29:19,623 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:19,623 INFO  L485      AbstractCegarLoop]: Abstraction has 175 states and 213 transitions.
[2025-05-07 17:29:19,624 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:29:19,624 INFO  L278                IsEmpty]: Start isEmpty. Operand 175 states and 213 transitions.
[2025-05-07 17:29:19,624 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:29:19,624 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:19,624 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:19,625 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:29:19,625 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:19,625 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:19,625 INFO  L85        PathProgramCache]: Analyzing trace with hash 448672775, now seen corresponding path program 1 times
[2025-05-07 17:29:19,625 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:19,625 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286778323]
[2025-05-07 17:29:19,625 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:19,625 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:19,645 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:29:19,664 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:29:19,664 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:19,664 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:19,845 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:19,845 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:19,845 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286778323]
[2025-05-07 17:29:19,845 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286778323] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:19,846 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:19,846 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-05-07 17:29:19,846 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364122270]
[2025-05-07 17:29:19,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:19,846 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-05-07 17:29:19,846 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:19,847 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-05-07 17:29:19,847 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132
[2025-05-07 17:29:19,847 INFO  L87              Difference]: Start difference. First operand 175 states and 213 transitions. Second operand  has 12 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11)
[2025-05-07 17:29:20,037 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:20,037 INFO  L93              Difference]: Finished difference Result 184 states and 230 transitions.
[2025-05-07 17:29:20,038 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-05-07 17:29:20,038 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11) Word has length 41
[2025-05-07 17:29:20,038 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:20,039 INFO  L225             Difference]: With dead ends: 184
[2025-05-07 17:29:20,040 INFO  L226             Difference]: Without dead ends: 183
[2025-05-07 17:29:20,040 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:29:20,040 INFO  L437           NwaCegarLoop]: 195 mSDtfsCounter, 2 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2114 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:20,040 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2114 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:29:20,041 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 183 states.
[2025-05-07 17:29:20,048 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178.
[2025-05-07 17:29:20,048 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 178 states, 71 states have (on average 1.1267605633802817) internal successors, (80), 80 states have internal predecessors, (80), 62 states have call successors, (66), 41 states have call predecessors, (66), 44 states have return successors, (72), 56 states have call predecessors, (72), 62 states have call successors, (72)
[2025-05-07 17:29:20,050 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 218 transitions.
[2025-05-07 17:29:20,050 INFO  L79                 Accepts]: Start accepts. Automaton has 178 states and 218 transitions. Word has length 41
[2025-05-07 17:29:20,050 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:20,050 INFO  L485      AbstractCegarLoop]: Abstraction has 178 states and 218 transitions.
[2025-05-07 17:29:20,050 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11)
[2025-05-07 17:29:20,050 INFO  L278                IsEmpty]: Start isEmpty. Operand 178 states and 218 transitions.
[2025-05-07 17:29:20,052 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:29:20,052 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:20,052 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:20,052 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:29:20,052 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:20,052 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:20,053 INFO  L85        PathProgramCache]: Analyzing trace with hash -334936115, now seen corresponding path program 1 times
[2025-05-07 17:29:20,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:20,053 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696466401]
[2025-05-07 17:29:20,053 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:20,053 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:20,065 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:29:20,076 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:29:20,076 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:20,076 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:20,136 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:20,136 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:20,137 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696466401]
[2025-05-07 17:29:20,137 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696466401] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:20,137 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:20,137 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:29:20,137 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271249122]
[2025-05-07 17:29:20,137 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:20,137 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:29:20,137 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:20,137 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:29:20,137 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:20,138 INFO  L87              Difference]: Start difference. First operand 178 states and 218 transitions. Second operand  has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11)
[2025-05-07 17:29:20,212 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:20,212 INFO  L93              Difference]: Finished difference Result 176 states and 212 transitions.
[2025-05-07 17:29:20,212 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:29:20,212 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 41
[2025-05-07 17:29:20,212 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:20,214 INFO  L225             Difference]: With dead ends: 176
[2025-05-07 17:29:20,214 INFO  L226             Difference]: Without dead ends: 175
[2025-05-07 17:29:20,214 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:29:20,215 INFO  L437           NwaCegarLoop]: 201 mSDtfsCounter, 2 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:20,215 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1184 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:29:20,215 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 175 states.
[2025-05-07 17:29:20,228 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173.
[2025-05-07 17:29:20,229 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 173 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 78 states have internal predecessors, (78), 59 states have call successors, (63), 41 states have call predecessors, (63), 43 states have return successors, (65), 53 states have call predecessors, (65), 59 states have call successors, (65)
[2025-05-07 17:29:20,230 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 206 transitions.
[2025-05-07 17:29:20,230 INFO  L79                 Accepts]: Start accepts. Automaton has 173 states and 206 transitions. Word has length 41
[2025-05-07 17:29:20,230 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:20,230 INFO  L485      AbstractCegarLoop]: Abstraction has 173 states and 206 transitions.
[2025-05-07 17:29:20,230 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11)
[2025-05-07 17:29:20,231 INFO  L278                IsEmpty]: Start isEmpty. Operand 173 states and 206 transitions.
[2025-05-07 17:29:20,232 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:29:20,232 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:20,232 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:20,232 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:29:20,232 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:20,233 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:20,233 INFO  L85        PathProgramCache]: Analyzing trace with hash -1036966727, now seen corresponding path program 1 times
[2025-05-07 17:29:20,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:20,233 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22387659]
[2025-05-07 17:29:20,233 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:20,233 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:20,258 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:29:20,263 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:29:20,263 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:20,263 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:20,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:20,324 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:20,324 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22387659]
[2025-05-07 17:29:20,324 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22387659] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:20,324 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:20,324 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:20,324 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854914501]
[2025-05-07 17:29:20,324 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:20,325 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:20,325 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:20,325 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:20,325 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:20,325 INFO  L87              Difference]: Start difference. First operand 173 states and 206 transitions. Second operand  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:29:20,350 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:20,350 INFO  L93              Difference]: Finished difference Result 175 states and 209 transitions.
[2025-05-07 17:29:20,351 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:20,351 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 66
[2025-05-07 17:29:20,351 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:20,352 INFO  L225             Difference]: With dead ends: 175
[2025-05-07 17:29:20,352 INFO  L226             Difference]: Without dead ends: 175
[2025-05-07 17:29:20,352 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:20,353 INFO  L437           NwaCegarLoop]: 202 mSDtfsCounter, 1 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:20,353 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 584 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:20,354 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 175 states.
[2025-05-07 17:29:20,360 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175.
[2025-05-07 17:29:20,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 175 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 79 states have internal predecessors, (79), 59 states have call successors, (63), 41 states have call predecessors, (63), 44 states have return successors, (67), 54 states have call predecessors, (67), 59 states have call successors, (67)
[2025-05-07 17:29:20,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 209 transitions.
[2025-05-07 17:29:20,362 INFO  L79                 Accepts]: Start accepts. Automaton has 175 states and 209 transitions. Word has length 66
[2025-05-07 17:29:20,362 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:20,362 INFO  L485      AbstractCegarLoop]: Abstraction has 175 states and 209 transitions.
[2025-05-07 17:29:20,362 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:29:20,362 INFO  L278                IsEmpty]: Start isEmpty. Operand 175 states and 209 transitions.
[2025-05-07 17:29:20,363 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:29:20,363 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:20,363 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:20,364 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:29:20,364 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:20,364 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:20,364 INFO  L85        PathProgramCache]: Analyzing trace with hash -219830603, now seen corresponding path program 1 times
[2025-05-07 17:29:20,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:20,364 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895341033]
[2025-05-07 17:29:20,364 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:20,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:20,388 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:29:20,398 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:29:20,398 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:20,398 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:20,665 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:20,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:20,666 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895341033]
[2025-05-07 17:29:20,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895341033] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:20,666 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:20,666 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-05-07 17:29:20,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39656122]
[2025-05-07 17:29:20,666 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:20,666 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-05-07 17:29:20,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:20,667 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-05-07 17:29:20,667 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132
[2025-05-07 17:29:20,667 INFO  L87              Difference]: Start difference. First operand 175 states and 209 transitions. Second operand  has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (18), 1 states have call predecessors, (18), 9 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18)
[2025-05-07 17:29:20,837 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:20,838 INFO  L93              Difference]: Finished difference Result 179 states and 216 transitions.
[2025-05-07 17:29:20,838 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-05-07 17:29:20,838 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (18), 1 states have call predecessors, (18), 9 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) Word has length 66
[2025-05-07 17:29:20,838 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:20,839 INFO  L225             Difference]: With dead ends: 179
[2025-05-07 17:29:20,839 INFO  L226             Difference]: Without dead ends: 178
[2025-05-07 17:29:20,840 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:29:20,840 INFO  L437           NwaCegarLoop]: 191 mSDtfsCounter, 2 mSDsluCounter, 1883 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:20,840 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2074 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:29:20,841 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 178 states.
[2025-05-07 17:29:20,846 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176.
[2025-05-07 17:29:20,847 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 176 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 79 states have internal predecessors, (79), 60 states have call successors, (64), 41 states have call predecessors, (64), 44 states have return successors, (68), 55 states have call predecessors, (68), 60 states have call successors, (68)
[2025-05-07 17:29:20,848 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 211 transitions.
[2025-05-07 17:29:20,848 INFO  L79                 Accepts]: Start accepts. Automaton has 176 states and 211 transitions. Word has length 66
[2025-05-07 17:29:20,848 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:20,848 INFO  L485      AbstractCegarLoop]: Abstraction has 176 states and 211 transitions.
[2025-05-07 17:29:20,848 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (18), 1 states have call predecessors, (18), 9 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18)
[2025-05-07 17:29:20,848 INFO  L278                IsEmpty]: Start isEmpty. Operand 176 states and 211 transitions.
[2025-05-07 17:29:20,850 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:29:20,850 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:20,850 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:20,850 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:29:20,850 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:20,850 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:20,850 INFO  L85        PathProgramCache]: Analyzing trace with hash 1799719305, now seen corresponding path program 1 times
[2025-05-07 17:29:20,850 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:20,851 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361498840]
[2025-05-07 17:29:20,851 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:20,851 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:20,875 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:29:20,889 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:29:20,889 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:20,889 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:20,956 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:20,956 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:20,956 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361498840]
[2025-05-07 17:29:20,956 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361498840] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:20,956 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:20,956 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:29:20,956 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217600110]
[2025-05-07 17:29:20,956 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:20,956 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:29:20,957 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:20,957 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:29:20,957 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:20,957 INFO  L87              Difference]: Start difference. First operand 176 states and 211 transitions. Second operand  has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 3 states have call successors, (18)
[2025-05-07 17:29:21,013 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:21,013 INFO  L93              Difference]: Finished difference Result 182 states and 219 transitions.
[2025-05-07 17:29:21,013 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:29:21,014 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 3 states have call successors, (18) Word has length 66
[2025-05-07 17:29:21,014 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:21,015 INFO  L225             Difference]: With dead ends: 182
[2025-05-07 17:29:21,015 INFO  L226             Difference]: Without dead ends: 180
[2025-05-07 17:29:21,015 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:21,015 INFO  L437           NwaCegarLoop]: 196 mSDtfsCounter, 1 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:21,016 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1159 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:21,016 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 180 states.
[2025-05-07 17:29:21,019 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180.
[2025-05-07 17:29:21,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 180 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 81 states have internal predecessors, (81), 60 states have call successors, (64), 41 states have call predecessors, (64), 46 states have return successors, (72), 57 states have call predecessors, (72), 60 states have call successors, (72)
[2025-05-07 17:29:21,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 217 transitions.
[2025-05-07 17:29:21,021 INFO  L79                 Accepts]: Start accepts. Automaton has 180 states and 217 transitions. Word has length 66
[2025-05-07 17:29:21,021 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:21,021 INFO  L485      AbstractCegarLoop]: Abstraction has 180 states and 217 transitions.
[2025-05-07 17:29:21,021 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 3 states have call successors, (18)
[2025-05-07 17:29:21,021 INFO  L278                IsEmpty]: Start isEmpty. Operand 180 states and 217 transitions.
[2025-05-07 17:29:21,022 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:29:21,022 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:21,022 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:21,022 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:29:21,022 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:21,022 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:21,022 INFO  L85        PathProgramCache]: Analyzing trace with hash 725368239, now seen corresponding path program 1 times
[2025-05-07 17:29:21,022 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:21,022 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26762158]
[2025-05-07 17:29:21,022 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:21,022 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:21,041 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:29:21,058 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:29:21,058 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:21,058 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:21,142 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:21,142 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:21,143 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26762158]
[2025-05-07 17:29:21,143 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26762158] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:21,143 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:21,143 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:29:21,143 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011760052]
[2025-05-07 17:29:21,143 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:21,143 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:29:21,143 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:21,144 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:29:21,144 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:21,144 INFO  L87              Difference]: Start difference. First operand 180 states and 217 transitions. Second operand  has 7 states, 5 states have (on average 6.0) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:29:21,205 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:21,205 INFO  L93              Difference]: Finished difference Result 182 states and 219 transitions.
[2025-05-07 17:29:21,205 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:29:21,205 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 6.0) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 4 states have call successors, (18) Word has length 66
[2025-05-07 17:29:21,206 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:21,207 INFO  L225             Difference]: With dead ends: 182
[2025-05-07 17:29:21,207 INFO  L226             Difference]: Without dead ends: 182
[2025-05-07 17:29:21,207 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:29:21,207 INFO  L437           NwaCegarLoop]: 201 mSDtfsCounter, 2 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:21,208 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1184 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:21,208 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 182 states.
[2025-05-07 17:29:21,214 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180.
[2025-05-07 17:29:21,214 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 180 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 81 states have internal predecessors, (81), 60 states have call successors, (64), 41 states have call predecessors, (64), 46 states have return successors, (71), 57 states have call predecessors, (71), 60 states have call successors, (71)
[2025-05-07 17:29:21,215 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions.
[2025-05-07 17:29:21,215 INFO  L79                 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 66
[2025-05-07 17:29:21,216 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:21,216 INFO  L485      AbstractCegarLoop]: Abstraction has 180 states and 216 transitions.
[2025-05-07 17:29:21,216 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 6.0) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:29:21,216 INFO  L278                IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions.
[2025-05-07 17:29:21,216 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:29:21,217 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:21,217 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:21,217 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:29:21,217 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:21,217 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:21,217 INFO  L85        PathProgramCache]: Analyzing trace with hash 1803842091, now seen corresponding path program 1 times
[2025-05-07 17:29:21,217 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:21,217 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987716703]
[2025-05-07 17:29:21,217 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:21,217 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:21,237 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:29:21,245 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:29:21,245 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:21,245 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:21,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:21,291 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:21,291 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987716703]
[2025-05-07 17:29:21,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987716703] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:21,291 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:21,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:21,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969625919]
[2025-05-07 17:29:21,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:21,291 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:21,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:21,292 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:21,292 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:21,292 INFO  L87              Difference]: Start difference. First operand 180 states and 216 transitions. Second operand  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18)
[2025-05-07 17:29:21,320 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:21,320 INFO  L93              Difference]: Finished difference Result 184 states and 220 transitions.
[2025-05-07 17:29:21,320 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:21,320 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 66
[2025-05-07 17:29:21,320 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:21,322 INFO  L225             Difference]: With dead ends: 184
[2025-05-07 17:29:21,322 INFO  L226             Difference]: Without dead ends: 181
[2025-05-07 17:29:21,322 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:21,322 INFO  L437           NwaCegarLoop]: 201 mSDtfsCounter, 1 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:21,322 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 585 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:21,323 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 181 states.
[2025-05-07 17:29:21,327 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 172.
[2025-05-07 17:29:21,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 172 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 78 states have internal predecessors, (78), 56 states have call successors, (60), 41 states have call predecessors, (60), 44 states have return successors, (63), 52 states have call predecessors, (63), 56 states have call successors, (63)
[2025-05-07 17:29:21,328 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 201 transitions.
[2025-05-07 17:29:21,328 INFO  L79                 Accepts]: Start accepts. Automaton has 172 states and 201 transitions. Word has length 66
[2025-05-07 17:29:21,328 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:21,328 INFO  L485      AbstractCegarLoop]: Abstraction has 172 states and 201 transitions.
[2025-05-07 17:29:21,328 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18)
[2025-05-07 17:29:21,328 INFO  L278                IsEmpty]: Start isEmpty. Operand 172 states and 201 transitions.
[2025-05-07 17:29:21,329 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:29:21,329 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:21,329 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:21,329 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:29:21,329 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:21,330 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:21,330 INFO  L85        PathProgramCache]: Analyzing trace with hash 1748865327, now seen corresponding path program 1 times
[2025-05-07 17:29:21,330 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:21,330 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115746334]
[2025-05-07 17:29:21,330 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:21,330 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:21,360 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:29:21,362 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:29:21,362 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:21,362 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:21,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:21,402 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:21,402 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115746334]
[2025-05-07 17:29:21,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115746334] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:21,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:21,402 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:21,402 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658593396]
[2025-05-07 17:29:21,402 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:21,402 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:21,402 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:21,403 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:21,403 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:21,403 INFO  L87              Difference]: Start difference. First operand 172 states and 201 transitions. Second operand  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18)
[2025-05-07 17:29:21,411 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:21,411 INFO  L93              Difference]: Finished difference Result 174 states and 202 transitions.
[2025-05-07 17:29:21,411 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:21,411 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 66
[2025-05-07 17:29:21,411 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:21,413 INFO  L225             Difference]: With dead ends: 174
[2025-05-07 17:29:21,413 INFO  L226             Difference]: Without dead ends: 169
[2025-05-07 17:29:21,413 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:21,413 INFO  L437           NwaCegarLoop]: 196 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:21,413 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 576 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:21,414 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 169 states.
[2025-05-07 17:29:21,416 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169.
[2025-05-07 17:29:21,417 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 169 states, 71 states have (on average 1.0845070422535212) internal successors, (77), 77 states have internal predecessors, (77), 53 states have call successors, (57), 41 states have call predecessors, (57), 44 states have return successors, (60), 50 states have call predecessors, (60), 53 states have call successors, (60)
[2025-05-07 17:29:21,417 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 194 transitions.
[2025-05-07 17:29:21,417 INFO  L79                 Accepts]: Start accepts. Automaton has 169 states and 194 transitions. Word has length 66
[2025-05-07 17:29:21,417 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:21,418 INFO  L485      AbstractCegarLoop]: Abstraction has 169 states and 194 transitions.
[2025-05-07 17:29:21,418 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18)
[2025-05-07 17:29:21,418 INFO  L278                IsEmpty]: Start isEmpty. Operand 169 states and 194 transitions.
[2025-05-07 17:29:21,418 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:29:21,418 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:21,418 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:21,419 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-05-07 17:29:21,419 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:21,419 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:21,419 INFO  L85        PathProgramCache]: Analyzing trace with hash 1638290574, now seen corresponding path program 1 times
[2025-05-07 17:29:21,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:21,419 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295341454]
[2025-05-07 17:29:21,419 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:21,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:21,439 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:29:21,440 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:29:21,441 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:21,441 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:21,470 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:21,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:21,470 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295341454]
[2025-05-07 17:29:21,470 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295341454] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:21,471 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:21,471 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:21,471 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724479074]
[2025-05-07 17:29:21,471 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:21,471 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:21,471 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:21,472 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:21,472 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:21,472 INFO  L87              Difference]: Start difference. First operand 169 states and 194 transitions. Second operand  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:29:21,478 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:21,478 INFO  L93              Difference]: Finished difference Result 171 states and 195 transitions.
[2025-05-07 17:29:21,478 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:21,478 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 66
[2025-05-07 17:29:21,478 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:21,479 INFO  L225             Difference]: With dead ends: 171
[2025-05-07 17:29:21,479 INFO  L226             Difference]: Without dead ends: 167
[2025-05-07 17:29:21,479 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:21,479 INFO  L437           NwaCegarLoop]: 189 mSDtfsCounter, 1 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:21,479 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 556 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:21,480 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 167 states.
[2025-05-07 17:29:21,485 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165.
[2025-05-07 17:29:21,485 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 165 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 75 states have internal predecessors, (75), 51 states have call successors, (55), 41 states have call predecessors, (55), 43 states have return successors, (57), 48 states have call predecessors, (57), 51 states have call successors, (57)
[2025-05-07 17:29:21,486 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions.
[2025-05-07 17:29:21,486 INFO  L79                 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 66
[2025-05-07 17:29:21,487 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:21,487 INFO  L485      AbstractCegarLoop]: Abstraction has 165 states and 187 transitions.
[2025-05-07 17:29:21,487 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:29:21,487 INFO  L278                IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions.
[2025-05-07 17:29:21,488 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:29:21,488 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:21,488 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:21,488 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-05-07 17:29:21,488 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:21,488 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:21,488 INFO  L85        PathProgramCache]: Analyzing trace with hash 915230990, now seen corresponding path program 1 times
[2025-05-07 17:29:21,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:21,488 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489049804]
[2025-05-07 17:29:21,488 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:21,488 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:21,510 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:29:21,520 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:29:21,520 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:21,520 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:21,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:21,704 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:21,704 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489049804]
[2025-05-07 17:29:21,704 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489049804] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:21,704 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:21,704 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-05-07 17:29:21,705 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993957059]
[2025-05-07 17:29:21,705 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:21,705 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-05-07 17:29:21,705 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:21,705 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-05-07 17:29:21,706 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132
[2025-05-07 17:29:21,706 INFO  L87              Difference]: Start difference. First operand 165 states and 187 transitions. Second operand  has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (18), 1 states have call predecessors, (18), 9 states have return successors, (18), 9 states have call predecessors, (18), 5 states have call successors, (18)
[2025-05-07 17:29:21,816 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:21,816 INFO  L93              Difference]: Finished difference Result 171 states and 194 transitions.
[2025-05-07 17:29:21,817 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-05-07 17:29:21,817 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (18), 1 states have call predecessors, (18), 9 states have return successors, (18), 9 states have call predecessors, (18), 5 states have call successors, (18) Word has length 66
[2025-05-07 17:29:21,817 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:21,818 INFO  L225             Difference]: With dead ends: 171
[2025-05-07 17:29:21,818 INFO  L226             Difference]: Without dead ends: 161
[2025-05-07 17:29:21,818 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:29:21,819 INFO  L437           NwaCegarLoop]: 179 mSDtfsCounter, 2 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:21,819 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1942 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:29:21,820 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 161 states.
[2025-05-07 17:29:21,824 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161.
[2025-05-07 17:29:21,825 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 161 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 73 states have internal predecessors, (73), 50 states have call successors, (53), 40 states have call predecessors, (53), 42 states have return successors, (55), 47 states have call predecessors, (55), 50 states have call successors, (55)
[2025-05-07 17:29:21,826 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions.
[2025-05-07 17:29:21,826 INFO  L79                 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 66
[2025-05-07 17:29:21,826 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:21,826 INFO  L485      AbstractCegarLoop]: Abstraction has 161 states and 181 transitions.
[2025-05-07 17:29:21,826 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (18), 1 states have call predecessors, (18), 9 states have return successors, (18), 9 states have call predecessors, (18), 5 states have call successors, (18)
[2025-05-07 17:29:21,826 INFO  L278                IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions.
[2025-05-07 17:29:21,827 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:29:21,827 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:21,827 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:21,828 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-05-07 17:29:21,828 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:21,828 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:21,828 INFO  L85        PathProgramCache]: Analyzing trace with hash 1176515536, now seen corresponding path program 1 times
[2025-05-07 17:29:21,828 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:21,828 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095683790]
[2025-05-07 17:29:21,828 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:21,828 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:21,852 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:29:21,860 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:29:21,860 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:21,860 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:21,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:21,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:21,897 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095683790]
[2025-05-07 17:29:21,897 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095683790] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:21,897 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:21,897 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:21,897 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068722741]
[2025-05-07 17:29:21,897 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:21,898 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:21,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:21,898 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:21,898 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:21,898 INFO  L87              Difference]: Start difference. First operand 161 states and 181 transitions. Second operand  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:29:21,910 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:21,911 INFO  L93              Difference]: Finished difference Result 163 states and 182 transitions.
[2025-05-07 17:29:21,911 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:21,911 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 66
[2025-05-07 17:29:21,911 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:21,912 INFO  L225             Difference]: With dead ends: 163
[2025-05-07 17:29:21,912 INFO  L226             Difference]: Without dead ends: 159
[2025-05-07 17:29:21,912 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:21,913 INFO  L437           NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:21,913 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 519 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:21,914 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 159 states.
[2025-05-07 17:29:21,918 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159.
[2025-05-07 17:29:21,919 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 159 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 72 states have internal predecessors, (72), 48 states have call successors, (51), 40 states have call predecessors, (51), 42 states have return successors, (53), 46 states have call predecessors, (53), 48 states have call successors, (53)
[2025-05-07 17:29:21,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 176 transitions.
[2025-05-07 17:29:21,919 INFO  L79                 Accepts]: Start accepts. Automaton has 159 states and 176 transitions. Word has length 66
[2025-05-07 17:29:21,919 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:21,919 INFO  L485      AbstractCegarLoop]: Abstraction has 159 states and 176 transitions.
[2025-05-07 17:29:21,920 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:29:21,920 INFO  L278                IsEmpty]: Start isEmpty. Operand 159 states and 176 transitions.
[2025-05-07 17:29:21,920 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:29:21,920 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:21,920 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:21,920 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-05-07 17:29:21,921 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:21,921 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:21,921 INFO  L85        PathProgramCache]: Analyzing trace with hash -62138314, now seen corresponding path program 1 times
[2025-05-07 17:29:21,921 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:21,921 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579040965]
[2025-05-07 17:29:21,921 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:21,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:21,942 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:29:21,952 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:29:21,952 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:21,952 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:22,022 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:22,022 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:22,023 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579040965]
[2025-05-07 17:29:22,023 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579040965] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:22,023 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:22,023 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:29:22,023 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288622683]
[2025-05-07 17:29:22,023 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:22,023 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:29:22,023 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:22,024 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:29:22,024 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:22,024 INFO  L87              Difference]: Start difference. First operand 159 states and 176 transitions. Second operand  has 7 states, 5 states have (on average 6.0) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18)
[2025-05-07 17:29:22,076 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:22,076 INFO  L93              Difference]: Finished difference Result 161 states and 177 transitions.
[2025-05-07 17:29:22,077 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:29:22,077 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 6.0) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) Word has length 66
[2025-05-07 17:29:22,077 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:22,077 INFO  L225             Difference]: With dead ends: 161
[2025-05-07 17:29:22,078 INFO  L226             Difference]: Without dead ends: 155
[2025-05-07 17:29:22,078 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:29:22,078 INFO  L437           NwaCegarLoop]: 168 mSDtfsCounter, 2 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:22,078 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 991 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:22,078 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 155 states.
[2025-05-07 17:29:22,081 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155.
[2025-05-07 17:29:22,081 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 155 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 70 states have internal predecessors, (70), 47 states have call successors, (49), 39 states have call predecessors, (49), 41 states have return successors, (51), 45 states have call predecessors, (51), 47 states have call successors, (51)
[2025-05-07 17:29:22,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 170 transitions.
[2025-05-07 17:29:22,082 INFO  L79                 Accepts]: Start accepts. Automaton has 155 states and 170 transitions. Word has length 66
[2025-05-07 17:29:22,082 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:22,082 INFO  L485      AbstractCegarLoop]: Abstraction has 155 states and 170 transitions.
[2025-05-07 17:29:22,082 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 6.0) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18)
[2025-05-07 17:29:22,082 INFO  L278                IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions.
[2025-05-07 17:29:22,083 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:29:22,083 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:22,083 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:22,083 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-05-07 17:29:22,083 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:22,083 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:22,083 INFO  L85        PathProgramCache]: Analyzing trace with hash -2042716844, now seen corresponding path program 1 times
[2025-05-07 17:29:22,083 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:22,083 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766087633]
[2025-05-07 17:29:22,083 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:22,083 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:22,104 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:29:22,113 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:29:22,113 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:22,113 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:22,587 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:22,588 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:22,588 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766087633]
[2025-05-07 17:29:22,588 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766087633] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:22,588 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:22,588 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2025-05-07 17:29:22,588 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144528932]
[2025-05-07 17:29:22,588 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:22,588 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-05-07 17:29:22,588 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:22,589 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-05-07 17:29:22,589 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380
[2025-05-07 17:29:22,590 INFO  L87              Difference]: Start difference. First operand 155 states and 170 transitions. Second operand  has 20 states, 14 states have (on average 2.142857142857143) internal successors, (30), 17 states have internal predecessors, (30), 10 states have call successors, (18), 1 states have call predecessors, (18), 14 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18)
[2025-05-07 17:29:22,769 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:22,769 INFO  L93              Difference]: Finished difference Result 149 states and 163 transitions.
[2025-05-07 17:29:22,769 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-05-07 17:29:22,769 INFO  L79                 Accepts]: Start accepts. Automaton has  has 20 states, 14 states have (on average 2.142857142857143) internal successors, (30), 17 states have internal predecessors, (30), 10 states have call successors, (18), 1 states have call predecessors, (18), 14 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) Word has length 66
[2025-05-07 17:29:22,769 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:22,770 INFO  L225             Difference]: With dead ends: 149
[2025-05-07 17:29:22,770 INFO  L226             Difference]: Without dead ends: 97
[2025-05-07 17:29:22,770 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552
[2025-05-07 17:29:22,771 INFO  L437           NwaCegarLoop]: 148 mSDtfsCounter, 3 mSDsluCounter, 2477 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:22,771 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2625 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:29:22,771 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2025-05-07 17:29:22,774 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97.
[2025-05-07 17:29:22,774 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97 states, 40 states have (on average 1.075) internal successors, (43), 43 states have internal predecessors, (43), 31 states have call successors, (33), 23 states have call predecessors, (33), 25 states have return successors, (35), 30 states have call predecessors, (35), 31 states have call successors, (35)
[2025-05-07 17:29:22,775 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions.
[2025-05-07 17:29:22,775 INFO  L79                 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 66
[2025-05-07 17:29:22,775 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:22,775 INFO  L485      AbstractCegarLoop]: Abstraction has 97 states and 111 transitions.
[2025-05-07 17:29:22,776 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 14 states have (on average 2.142857142857143) internal successors, (30), 17 states have internal predecessors, (30), 10 states have call successors, (18), 1 states have call predecessors, (18), 14 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18)
[2025-05-07 17:29:22,776 INFO  L278                IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions.
[2025-05-07 17:29:22,776 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-05-07 17:29:22,776 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:22,777 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:22,777 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-05-07 17:29:22,777 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:22,777 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:22,777 INFO  L85        PathProgramCache]: Analyzing trace with hash 1791862981, now seen corresponding path program 1 times
[2025-05-07 17:29:22,777 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:22,777 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719643659]
[2025-05-07 17:29:22,777 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:22,777 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:22,802 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-05-07 17:29:22,804 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-05-07 17:29:22,804 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:22,804 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:22,840 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:22,840 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:22,840 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719643659]
[2025-05-07 17:29:22,840 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719643659] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:22,840 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:22,840 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:22,840 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611231400]
[2025-05-07 17:29:22,840 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:22,840 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:22,840 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:22,841 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:22,841 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:22,841 INFO  L87              Difference]: Start difference. First operand 97 states and 111 transitions. Second operand  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21)
[2025-05-07 17:29:22,845 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:22,845 INFO  L93              Difference]: Finished difference Result 99 states and 112 transitions.
[2025-05-07 17:29:22,846 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:22,846 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 76
[2025-05-07 17:29:22,846 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:22,846 INFO  L225             Difference]: With dead ends: 99
[2025-05-07 17:29:22,846 INFO  L226             Difference]: Without dead ends: 93
[2025-05-07 17:29:22,847 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:22,847 INFO  L437           NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:22,847 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 313 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:22,847 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2025-05-07 17:29:22,849 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93.
[2025-05-07 17:29:22,849 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 93 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 27 states have call successors, (29), 23 states have call predecessors, (29), 25 states have return successors, (31), 27 states have call predecessors, (31), 27 states have call successors, (31)
[2025-05-07 17:29:22,849 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions.
[2025-05-07 17:29:22,849 INFO  L79                 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 76
[2025-05-07 17:29:22,849 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:22,850 INFO  L485      AbstractCegarLoop]: Abstraction has 93 states and 102 transitions.
[2025-05-07 17:29:22,850 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21)
[2025-05-07 17:29:22,850 INFO  L278                IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions.
[2025-05-07 17:29:22,850 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-05-07 17:29:22,850 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:22,850 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:22,850 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-05-07 17:29:22,850 INFO  L403      AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:22,851 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:22,851 INFO  L85        PathProgramCache]: Analyzing trace with hash 927609013, now seen corresponding path program 1 times
[2025-05-07 17:29:22,851 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:22,851 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191098758]
[2025-05-07 17:29:22,851 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:22,851 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:22,869 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-05-07 17:29:22,873 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-05-07 17:29:22,873 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:22,874 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:22,908 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:22,908 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:22,908 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191098758]
[2025-05-07 17:29:22,908 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191098758] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:22,908 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:22,908 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:22,908 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784381353]
[2025-05-07 17:29:22,908 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:22,908 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:22,909 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:22,909 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:22,909 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:22,909 INFO  L87              Difference]: Start difference. First operand 93 states and 102 transitions. Second operand  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:29:22,915 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:22,915 INFO  L93              Difference]: Finished difference Result 95 states and 103 transitions.
[2025-05-07 17:29:22,915 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:22,915 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 76
[2025-05-07 17:29:22,916 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:22,916 INFO  L225             Difference]: With dead ends: 95
[2025-05-07 17:29:22,916 INFO  L226             Difference]: Without dead ends: 91
[2025-05-07 17:29:22,916 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:22,917 INFO  L437           NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:22,917 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 283 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:22,917 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2025-05-07 17:29:22,920 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89.
[2025-05-07 17:29:22,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 89 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 40 states have internal predecessors, (40), 25 states have call successors, (27), 23 states have call predecessors, (27), 24 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28)
[2025-05-07 17:29:22,920 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions.
[2025-05-07 17:29:22,921 INFO  L79                 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 76
[2025-05-07 17:29:22,921 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:22,921 INFO  L485      AbstractCegarLoop]: Abstraction has 89 states and 95 transitions.
[2025-05-07 17:29:22,921 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:29:22,921 INFO  L278                IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions.
[2025-05-07 17:29:22,922 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-05-07 17:29:22,922 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:22,922 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:22,922 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-05-07 17:29:22,922 INFO  L403      AbstractCegarLoop]: === Iteration 20 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:22,922 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:22,922 INFO  L85        PathProgramCache]: Analyzing trace with hash 2058974777, now seen corresponding path program 1 times
[2025-05-07 17:29:22,923 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:22,923 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271855119]
[2025-05-07 17:29:22,923 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:22,923 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:22,950 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-05-07 17:29:22,962 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-05-07 17:29:22,962 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:22,963 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:23,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:23,025 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:23,025 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271855119]
[2025-05-07 17:29:23,025 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271855119] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:23,025 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:23,025 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:29:23,025 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355204555]
[2025-05-07 17:29:23,025 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:23,026 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:29:23,026 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:23,026 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:29:23,026 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:29:23,026 INFO  L87              Difference]: Start difference. First operand 89 states and 95 transitions. Second operand  has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:29:23,046 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:23,046 INFO  L93              Difference]: Finished difference Result 91 states and 96 transitions.
[2025-05-07 17:29:23,046 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:29:23,046 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 76
[2025-05-07 17:29:23,047 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:23,047 INFO  L225             Difference]: With dead ends: 91
[2025-05-07 17:29:23,047 INFO  L226             Difference]: Without dead ends: 85
[2025-05-07 17:29:23,047 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:29:23,048 INFO  L437           NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:23,048 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 357 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:23,048 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2025-05-07 17:29:23,049 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85.
[2025-05-07 17:29:23,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 85 states, 37 states have (on average 1.027027027027027) internal successors, (38), 38 states have internal predecessors, (38), 24 states have call successors, (25), 22 states have call predecessors, (25), 23 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26)
[2025-05-07 17:29:23,050 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions.
[2025-05-07 17:29:23,050 INFO  L79                 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 76
[2025-05-07 17:29:23,050 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:23,050 INFO  L485      AbstractCegarLoop]: Abstraction has 85 states and 89 transitions.
[2025-05-07 17:29:23,050 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:29:23,050 INFO  L278                IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions.
[2025-05-07 17:29:23,051 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-05-07 17:29:23,051 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:23,051 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:23,051 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-05-07 17:29:23,051 INFO  L403      AbstractCegarLoop]: === Iteration 21 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:23,051 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:23,051 INFO  L85        PathProgramCache]: Analyzing trace with hash -215186079, now seen corresponding path program 1 times
[2025-05-07 17:29:23,051 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:23,051 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176048375]
[2025-05-07 17:29:23,051 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:23,052 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:23,075 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-05-07 17:29:23,076 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-05-07 17:29:23,077 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:23,077 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:23,111 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:23,111 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:23,111 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176048375]
[2025-05-07 17:29:23,111 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176048375] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:23,111 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:23,111 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:23,111 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605725222]
[2025-05-07 17:29:23,111 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:23,111 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:23,111 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:23,112 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:23,112 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:23,112 INFO  L87              Difference]: Start difference. First operand 85 states and 89 transitions. Second operand  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:29:23,117 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:23,117 INFO  L93              Difference]: Finished difference Result 87 states and 90 transitions.
[2025-05-07 17:29:23,117 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:23,118 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 76
[2025-05-07 17:29:23,118 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:23,118 INFO  L225             Difference]: With dead ends: 87
[2025-05-07 17:29:23,118 INFO  L226             Difference]: Without dead ends: 83
[2025-05-07 17:29:23,118 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:23,119 INFO  L437           NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:23,119 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 252 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:23,119 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2025-05-07 17:29:23,120 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81.
[2025-05-07 17:29:23,120 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 81 states, 36 states have (on average 1.0) internal successors, (36), 36 states have internal predecessors, (36), 22 states have call successors, (23), 22 states have call predecessors, (23), 22 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23)
[2025-05-07 17:29:23,121 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions.
[2025-05-07 17:29:23,121 INFO  L79                 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 76
[2025-05-07 17:29:23,121 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:23,121 INFO  L485      AbstractCegarLoop]: Abstraction has 81 states and 82 transitions.
[2025-05-07 17:29:23,121 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:29:23,121 INFO  L278                IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions.
[2025-05-07 17:29:23,121 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-05-07 17:29:23,121 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:23,122 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:23,122 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-05-07 17:29:23,122 INFO  L403      AbstractCegarLoop]: === Iteration 22 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:23,122 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:23,122 INFO  L85        PathProgramCache]: Analyzing trace with hash -1185776283, now seen corresponding path program 1 times
[2025-05-07 17:29:23,122 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:23,122 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513569300]
[2025-05-07 17:29:23,122 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:23,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:23,146 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-05-07 17:29:23,154 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-05-07 17:29:23,154 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:23,154 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:23,204 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:23,204 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:23,204 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513569300]
[2025-05-07 17:29:23,204 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513569300] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:23,204 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:23,204 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:29:23,204 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204219285]
[2025-05-07 17:29:23,204 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:23,205 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:29:23,205 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:23,205 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:29:23,205 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:29:23,205 INFO  L87              Difference]: Start difference. First operand 81 states and 82 transitions. Second operand  has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 4 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:29:23,223 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:23,223 INFO  L93              Difference]: Finished difference Result 83 states and 83 transitions.
[2025-05-07 17:29:23,224 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:29:23,224 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 4 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) Word has length 76
[2025-05-07 17:29:23,224 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:23,224 INFO  L225             Difference]: With dead ends: 83
[2025-05-07 17:29:23,224 INFO  L226             Difference]: Without dead ends: 77
[2025-05-07 17:29:23,224 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:29:23,225 INFO  L437           NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:23,225 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 310 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:23,226 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 77 states.
[2025-05-07 17:29:23,227 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77.
[2025-05-07 17:29:23,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 77 states, 34 states have (on average 1.0) internal successors, (34), 34 states have internal predecessors, (34), 21 states have call successors, (21), 21 states have call predecessors, (21), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2025-05-07 17:29:23,227 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 76 transitions.
[2025-05-07 17:29:23,227 INFO  L79                 Accepts]: Start accepts. Automaton has 77 states and 76 transitions. Word has length 76
[2025-05-07 17:29:23,227 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:23,227 INFO  L485      AbstractCegarLoop]: Abstraction has 77 states and 76 transitions.
[2025-05-07 17:29:23,227 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 4 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:29:23,228 INFO  L278                IsEmpty]: Start isEmpty. Operand 77 states and 76 transitions.
[2025-05-07 17:29:23,228 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-05-07 17:29:23,228 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:23,228 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:23,228 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-05-07 17:29:23,228 INFO  L403      AbstractCegarLoop]: === Iteration 23 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:23,228 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:23,228 INFO  L85        PathProgramCache]: Analyzing trace with hash -1939142017, now seen corresponding path program 1 times
[2025-05-07 17:29:23,228 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:23,228 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855487798]
[2025-05-07 17:29:23,228 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:23,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:23,252 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-05-07 17:29:23,260 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-05-07 17:29:23,260 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:23,260 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:23,317 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:23,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:23,318 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855487798]
[2025-05-07 17:29:23,318 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855487798] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:23,318 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:23,318 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:29:23,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713245638]
[2025-05-07 17:29:23,318 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:23,318 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:23,318 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:23,318 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:23,318 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:23,319 INFO  L87              Difference]: Start difference. First operand 77 states and 76 transitions. Second operand  has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 3 states have call successors, (21)
[2025-05-07 17:29:23,347 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:23,347 INFO  L93              Difference]: Finished difference Result 65 states and 64 transitions.
[2025-05-07 17:29:23,348 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:23,348 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 3 states have call successors, (21) Word has length 76
[2025-05-07 17:29:23,348 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:23,348 INFO  L225             Difference]: With dead ends: 65
[2025-05-07 17:29:23,348 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:29:23,349 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:23,349 INFO  L437           NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:23,349 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:23,350 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:29:23,350 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:29:23,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-05-07 17:29:23,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:29:23,350 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76
[2025-05-07 17:29:23,350 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:23,350 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:29:23,351 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 3 states have call successors, (21)
[2025-05-07 17:29:23,351 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:29:23,351 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:29:23,353 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:29:23,354 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-05-07 17:29:23,357 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:23,360 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:29:23,363 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:29:23 BoogieIcfgContainer
[2025-05-07 17:29:23,363 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:29:23,364 INFO  L158              Benchmark]: Toolchain (without parser) took 5826.64ms. Allocated memory was 234.9MB in the beginning and 352.3MB in the end (delta: 117.4MB). Free memory was 139.9MB in the beginning and 302.8MB in the end (delta: -162.9MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:23,364 INFO  L158              Benchmark]: SmtParser took 0.25ms. Allocated memory is still 234.9MB. Free memory is still 173.4MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:23,365 INFO  L158              Benchmark]: ChcToBoogie took 46.30ms. Allocated memory is still 234.9MB. Free memory was 139.9MB in the beginning and 136.2MB in the end (delta: 3.6MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-05-07 17:29:23,365 INFO  L158              Benchmark]: Boogie Preprocessor took 73.13ms. Allocated memory is still 234.9MB. Free memory was 136.2MB in the beginning and 132.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:23,365 INFO  L158              Benchmark]: RCFGBuilder took 557.74ms. Allocated memory was 234.9MB in the beginning and 302.0MB in the end (delta: 67.1MB). Free memory was 132.2MB in the beginning and 213.9MB in the end (delta: -81.7MB). Peak memory consumption was 27.2MB. Max. memory is 33.6GB.
[2025-05-07 17:29:23,366 INFO  L158              Benchmark]: TraceAbstraction took 5144.38ms. Allocated memory was 302.0MB in the beginning and 352.3MB in the end (delta: 50.3MB). Free memory was 213.5MB in the beginning and 302.8MB in the end (delta: -89.3MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:23,367 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.25ms. Allocated memory is still 234.9MB. Free memory is still 173.4MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 46.30ms. Allocated memory is still 234.9MB. Free memory was 139.9MB in the beginning and 136.2MB in the end (delta: 3.6MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * Boogie Preprocessor took 73.13ms. Allocated memory is still 234.9MB. Free memory was 136.2MB in the beginning and 132.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 557.74ms. Allocated memory was 234.9MB in the beginning and 302.0MB in the end (delta: 67.1MB). Free memory was 132.2MB in the beginning and 213.9MB in the end (delta: -81.7MB). Peak memory consumption was 27.2MB. Max. memory is 33.6GB.
 * TraceAbstraction took 5144.38ms. Allocated memory was 302.0MB in the beginning and 352.3MB in the end (delta: 50.3MB). Free memory was 213.5MB in the beginning and 302.8MB in the end (delta: -89.3MB). There was no memory consumed. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Unknown line] : the set of constraint Horn clauses is satisfiable
    For all program executions holds that the set of constraint Horn clauses is satisfiable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 42 procedures, 175 locations, 281 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 22526 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18731 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1169 IncrementalHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 3795 mSDtfsCounter, 1169 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=9, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 36 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1428 NumberOfCodeBlocks, 1428 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1405 ConstructedInterpolants, 0 QuantifiedInterpolants, 1921 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-05-07 17:29:23,383 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
sat
