./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/constructor_state_variable_init_asserts.sol_2_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:27:00,769 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:27:00,819 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1f48ead-926f-47b2-baa2-25ec59aff99c/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:27:00,822 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:27:00,823 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:27:00,839 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:27:00,840 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:27:00,840 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:27:00,840 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:27:00,840 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:27:00,840 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:27:00,841 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:27:00,841 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:27:00,841 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:27:00,841 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:27:00,841 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:27:00,841 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:27:00,841 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:27:00,841 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:27:00,841 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:27:00,842 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:27:00,842 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:27:00,842 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:27:00,842 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:27:00,842 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:27:00,842 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:27:00,843 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:27:01,044 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:27:01,050 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:27:01,052 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:27:01,053 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:27:01,053 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:27:01,054 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1f48ead-926f-47b2-baa2-25ec59aff99c/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/constructor_state_variable_init_asserts.sol_2_no_adts_000.smt2
[2025-05-07 17:27:01,055 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:27:01,057 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:27:01,366 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1f48ead-926f-47b2-baa2-25ec59aff99c/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/constructor_state_variable_init_asserts.sol_2_no_adts_000.smt2
[2025-05-07 17:27:01,368 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:27:01,369 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:27:01,369 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:27:01,369 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:27:01,369 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:27:01,371 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:27:01" (1/1) ...
[2025-05-07 17:27:01,410 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:01 Unit
[2025-05-07 17:27:01,410 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:27:01,411 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:27:01,411 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:27:01,411 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:27:01,422 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:01" (1/1) ...
[2025-05-07 17:27:01,422 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:01" (1/1) ...
[2025-05-07 17:27:01,450 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:01" (1/1) ...
[2025-05-07 17:27:01,450 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:01" (1/1) ...
[2025-05-07 17:27:01,458 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:01" (1/1) ...
[2025-05-07 17:27:01,459 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:01" (1/1) ...
[2025-05-07 17:27:01,461 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:01" (1/1) ...
[2025-05-07 17:27:01,464 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:01" (1/1) ...
[2025-05-07 17:27:01,466 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:01" (1/1) ...
[2025-05-07 17:27:01,481 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:27:01,481 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:27:01,481 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:27:01,481 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:27:01,482 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:01" (1/1) ...
[2025-05-07 17:27:01,484 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:27:01,494 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:27:01,504 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:27:01,520 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:27:01,530 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:27:01,530 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:27:01,531 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:27:01,531 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_12_0 given in one single declaration
[2025-05-07 17:27:01,531 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_12_0
[2025-05-07 17:27:01,531 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_12_0
[2025-05-07 17:27:01,531 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_11_C_118_0 given in one single declaration
[2025-05-07 17:27:01,531 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_11_C_118_0
[2025-05-07 17:27:01,531 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_11_C_118_0
[2025-05-07 17:27:01,531 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_72_C_118_0 given in one single declaration
[2025-05-07 17:27:01,531 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_72_C_118_0
[2025-05-07 17:27:01,531 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_72_C_118_0
[2025-05-07 17:27:01,531 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_69_A_13_0 given in one single declaration
[2025-05-07 17:27:01,531 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_69_A_13_0
[2025-05-07 17:27:01,531 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_69_A_13_0
[2025-05-07 17:27:01,531 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_71_A_13_0 given in one single declaration
[2025-05-07 17:27:01,531 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_71_A_13_0
[2025-05-07 17:27:01,531 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_71_A_13_0
[2025-05-07 17:27:01,531 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_70_A_13_0 given in one single declaration
[2025-05-07 17:27:01,532 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_70_A_13_0
[2025-05-07 17:27:01,532 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_70_A_13_0
[2025-05-07 17:27:01,532 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_12_constructor_12_118_0 given in one single declaration
[2025-05-07 17:27:01,532 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_12_constructor_12_118_0
[2025-05-07 17:27:01,532 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_12_constructor_12_118_0
[2025-05-07 17:27:01,532 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_68_return_constructor_12_118_0 given in one single declaration
[2025-05-07 17:27:01,532 INFO  L130     BoogieDeclarations]: Found specification of procedure block_68_return_constructor_12_118_0
[2025-05-07 17:27:01,532 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_68_return_constructor_12_118_0
[2025-05-07 17:27:01,532 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_67__11_118_0 given in one single declaration
[2025-05-07 17:27:01,532 INFO  L130     BoogieDeclarations]: Found specification of procedure block_67__11_118_0
[2025-05-07 17:27:01,532 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_67__11_118_0
[2025-05-07 17:27:01,532 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_66_constructor_12_118_0 given in one single declaration
[2025-05-07 17:27:01,532 INFO  L130     BoogieDeclarations]: Found specification of procedure block_66_constructor_12_118_0
[2025-05-07 17:27:01,532 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_66_constructor_12_118_0
[2025-05-07 17:27:01,532 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_53_C_118_0 given in one single declaration
[2025-05-07 17:27:01,532 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_53_C_118_0
[2025-05-07 17:27:01,532 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_53_C_118_0
[2025-05-07 17:27:01,533 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_14_constructor_117_118_0 given in one single declaration
[2025-05-07 17:27:01,533 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_14_constructor_117_118_0
[2025-05-07 17:27:01,533 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_14_constructor_117_118_0
[2025-05-07 17:27:01,533 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_52_constructor_117_118_0 given in one single declaration
[2025-05-07 17:27:01,533 INFO  L130     BoogieDeclarations]: Found specification of procedure block_52_constructor_117_118_0
[2025-05-07 17:27:01,533 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_52_constructor_117_118_0
[2025-05-07 17:27:01,533 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_46_if_false__114_118_0 given in one single declaration
[2025-05-07 17:27:01,533 INFO  L130     BoogieDeclarations]: Found specification of procedure block_46_if_false__114_118_0
[2025-05-07 17:27:01,533 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_46_if_false__114_118_0
[2025-05-07 17:27:01,533 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_44_if_header__115_118_0 given in one single declaration
[2025-05-07 17:27:01,533 INFO  L130     BoogieDeclarations]: Found specification of procedure block_44_if_header__115_118_0
[2025-05-07 17:27:01,533 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_44_if_header__115_118_0
[2025-05-07 17:27:01,533 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_40__116_118_0 given in one single declaration
[2025-05-07 17:27:01,533 INFO  L130     BoogieDeclarations]: Found specification of procedure block_40__116_118_0
[2025-05-07 17:27:01,533 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_40__116_118_0
[2025-05-07 17:27:01,533 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_39_constructor_117_118_0 given in one single declaration
[2025-05-07 17:27:01,533 INFO  L130     BoogieDeclarations]: Found specification of procedure block_39_constructor_117_118_0
[2025-05-07 17:27:01,533 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_39_constructor_117_118_0
[2025-05-07 17:27:01,533 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_43_constructor_117_118_0 given in one single declaration
[2025-05-07 17:27:01,533 INFO  L130     BoogieDeclarations]: Found specification of procedure block_43_constructor_117_118_0
[2025-05-07 17:27:01,533 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_43_constructor_117_118_0
[2025-05-07 17:27:01,534 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_50_constructor_117_118_0 given in one single declaration
[2025-05-07 17:27:01,534 INFO  L130     BoogieDeclarations]: Found specification of procedure block_50_constructor_117_118_0
[2025-05-07 17:27:01,534 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_50_constructor_117_118_0
[2025-05-07 17:27:01,534 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_51_constructor_117_118_0 given in one single declaration
[2025-05-07 17:27:01,534 INFO  L130     BoogieDeclarations]: Found specification of procedure block_51_constructor_117_118_0
[2025-05-07 17:27:01,534 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_51_constructor_117_118_0
[2025-05-07 17:27:01,534 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_48_constructor_117_118_0 given in one single declaration
[2025-05-07 17:27:01,534 INFO  L130     BoogieDeclarations]: Found specification of procedure block_48_constructor_117_118_0
[2025-05-07 17:27:01,534 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_48_constructor_117_118_0
[2025-05-07 17:27:01,534 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_45_if_true__87_118_0 given in one single declaration
[2025-05-07 17:27:01,534 INFO  L130     BoogieDeclarations]: Found specification of procedure block_45_if_true__87_118_0
[2025-05-07 17:27:01,534 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_45_if_true__87_118_0
[2025-05-07 17:27:01,534 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_49_constructor_117_118_0 given in one single declaration
[2025-05-07 17:27:01,534 INFO  L130     BoogieDeclarations]: Found specification of procedure block_49_constructor_117_118_0
[2025-05-07 17:27:01,534 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_49_constructor_117_118_0
[2025-05-07 17:27:01,534 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_41_return_constructor_117_118_0 given in one single declaration
[2025-05-07 17:27:01,534 INFO  L130     BoogieDeclarations]: Found specification of procedure block_41_return_constructor_117_118_0
[2025-05-07 17:27:01,534 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_41_return_constructor_117_118_0
[2025-05-07 17:27:01,535 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_47__116_118_0 given in one single declaration
[2025-05-07 17:27:01,535 INFO  L130     BoogieDeclarations]: Found specification of procedure block_47__116_118_0
[2025-05-07 17:27:01,535 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_47__116_118_0
[2025-05-07 17:27:01,535 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_42_constructor_117_118_0 given in one single declaration
[2025-05-07 17:27:01,535 INFO  L130     BoogieDeclarations]: Found specification of procedure block_42_constructor_117_118_0
[2025-05-07 17:27:01,535 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_42_constructor_117_118_0
[2025-05-07 17:27:01,535 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_55_C_118_0 given in one single declaration
[2025-05-07 17:27:01,535 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_55_C_118_0
[2025-05-07 17:27:01,535 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_55_C_118_0
[2025-05-07 17:27:01,535 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_54_C_118_0 given in one single declaration
[2025-05-07 17:27:01,535 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_54_C_118_0
[2025-05-07 17:27:01,535 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_54_C_118_0
[2025-05-07 17:27:01,535 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_63_B_42_0 given in one single declaration
[2025-05-07 17:27:01,535 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_63_B_42_0
[2025-05-07 17:27:01,535 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_63_B_42_0
[2025-05-07 17:27:01,535 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_13_constructor_41_118_0 given in one single declaration
[2025-05-07 17:27:01,535 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_13_constructor_41_118_0
[2025-05-07 17:27:01,535 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_13_constructor_41_118_0
[2025-05-07 17:27:01,535 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_58_return_constructor_41_118_0 given in one single declaration
[2025-05-07 17:27:01,535 INFO  L130     BoogieDeclarations]: Found specification of procedure block_58_return_constructor_41_118_0
[2025-05-07 17:27:01,535 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_58_return_constructor_41_118_0
[2025-05-07 17:27:01,535 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_62__40_118_0 given in one single declaration
[2025-05-07 17:27:01,536 INFO  L130     BoogieDeclarations]: Found specification of procedure block_62__40_118_0
[2025-05-07 17:27:01,536 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_62__40_118_0
[2025-05-07 17:27:01,536 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_60_if_true__33_118_0 given in one single declaration
[2025-05-07 17:27:01,536 INFO  L130     BoogieDeclarations]: Found specification of procedure block_60_if_true__33_118_0
[2025-05-07 17:27:01,536 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_60_if_true__33_118_0
[2025-05-07 17:27:01,536 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_59_if_header__39_118_0 given in one single declaration
[2025-05-07 17:27:01,536 INFO  L130     BoogieDeclarations]: Found specification of procedure block_59_if_header__39_118_0
[2025-05-07 17:27:01,536 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_59_if_header__39_118_0
[2025-05-07 17:27:01,536 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_57__40_118_0 given in one single declaration
[2025-05-07 17:27:01,536 INFO  L130     BoogieDeclarations]: Found specification of procedure block_57__40_118_0
[2025-05-07 17:27:01,536 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_57__40_118_0
[2025-05-07 17:27:01,536 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_56_constructor_41_118_0 given in one single declaration
[2025-05-07 17:27:01,536 INFO  L130     BoogieDeclarations]: Found specification of procedure block_56_constructor_41_118_0
[2025-05-07 17:27:01,536 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_56_constructor_41_118_0
[2025-05-07 17:27:01,536 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_61_if_false__38_118_0 given in one single declaration
[2025-05-07 17:27:01,536 INFO  L130     BoogieDeclarations]: Found specification of procedure block_61_if_false__38_118_0
[2025-05-07 17:27:01,536 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_61_if_false__38_118_0
[2025-05-07 17:27:01,536 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_65_B_42_0 given in one single declaration
[2025-05-07 17:27:01,536 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_65_B_42_0
[2025-05-07 17:27:01,536 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_65_B_42_0
[2025-05-07 17:27:01,536 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_64_B_42_0 given in one single declaration
[2025-05-07 17:27:01,536 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_64_B_42_0
[2025-05-07 17:27:01,536 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_64_B_42_0
[2025-05-07 17:27:01,536 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:27:01,537 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:27:01,537 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:27:01,759 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:27:01,761 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:27:02,114 INFO  L?                        ?]: Removed 367 outVars from TransFormulas that were not future-live.
[2025-05-07 17:27:02,114 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:27:02,124 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:27:02,124 INFO  L312             CfgBuilder]: Removed 19 assume(true) statements.
[2025-05-07 17:27:02,125 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:27:02 BoogieIcfgContainer
[2025-05-07 17:27:02,125 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:27:02,126 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:27:02,126 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:27:02,129 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:27:02,129 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:27:01" (1/3) ...
[2025-05-07 17:27:02,129 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dbac34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:27:02, skipping insertion in model container
[2025-05-07 17:27:02,130 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:01" (2/3) ...
[2025-05-07 17:27:02,130 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dbac34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:27:02, skipping insertion in model container
[2025-05-07 17:27:02,130 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:27:02" (3/3) ...
[2025-05-07 17:27:02,131 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:27:02,141 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:27:02,143 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 41 procedures, 169 locations, 271 edges, 41 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:27:02,174 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:27:02,184 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;@5a71335d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:27:02,184 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:27:02,187 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 169 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 79 states have internal predecessors, (79), 57 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (64), 49 states have call predecessors, (64), 57 states have call successors, (64)
[2025-05-07 17:27:02,196 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:27:02,196 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:02,196 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:27:02,197 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:02,200 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:02,201 INFO  L85        PathProgramCache]: Analyzing trace with hash 1342288281, now seen corresponding path program 1 times
[2025-05-07 17:27:02,206 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:02,207 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502560298]
[2025-05-07 17:27:02,207 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:02,207 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:02,249 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:27:02,336 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:27:02,337 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:02,337 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:02,556 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:27:02,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:02,557 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502560298]
[2025-05-07 17:27:02,557 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502560298] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:02,557 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:02,559 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:27:02,560 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303697833]
[2025-05-07 17:27:02,561 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:02,564 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:27:02,564 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:02,592 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:27:02,593 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:27:02,596 INFO  L87              Difference]: Start difference. First operand  has 169 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 79 states have internal predecessors, (79), 57 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (64), 49 states have call predecessors, (64), 57 states have call successors, (64) Second operand  has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:27:02,696 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:02,697 INFO  L93              Difference]: Finished difference Result 166 states and 202 transitions.
[2025-05-07 17:27:02,698 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:27:02,699 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 41
[2025-05-07 17:27:02,700 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:02,708 INFO  L225             Difference]: With dead ends: 166
[2025-05-07 17:27:02,709 INFO  L226             Difference]: Without dead ends: 165
[2025-05-07 17:27:02,710 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:27:02,713 INFO  L437           NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:02,714 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 980 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:02,725 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 165 states.
[2025-05-07 17:27:02,745 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165.
[2025-05-07 17:27:02,746 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 165 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 76 states have internal predecessors, (76), 55 states have call successors, (62), 40 states have call predecessors, (62), 40 states have return successors, (62), 48 states have call predecessors, (62), 55 states have call successors, (62)
[2025-05-07 17:27:02,749 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 200 transitions.
[2025-05-07 17:27:02,750 INFO  L79                 Accepts]: Start accepts. Automaton has 165 states and 200 transitions. Word has length 41
[2025-05-07 17:27:02,751 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:02,751 INFO  L485      AbstractCegarLoop]: Abstraction has 165 states and 200 transitions.
[2025-05-07 17:27:02,752 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:27:02,752 INFO  L278                IsEmpty]: Start isEmpty. Operand 165 states and 200 transitions.
[2025-05-07 17:27:02,753 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:27:02,753 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:02,753 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:27:02,753 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:27:02,753 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:02,754 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:02,754 INFO  L85        PathProgramCache]: Analyzing trace with hash 1080833301, now seen corresponding path program 1 times
[2025-05-07 17:27:02,754 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:02,754 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515985450]
[2025-05-07 17:27:02,754 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:02,754 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:02,781 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:27:02,798 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:27:02,798 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:02,798 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:02,890 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:27:02,890 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:02,890 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515985450]
[2025-05-07 17:27:02,890 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515985450] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:02,890 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:02,890 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:27:02,890 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916722142]
[2025-05-07 17:27:02,890 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:02,891 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:27:02,892 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:02,892 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:27:02,892 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:02,892 INFO  L87              Difference]: Start difference. First operand 165 states and 200 transitions. Second operand  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:27:02,943 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:02,944 INFO  L93              Difference]: Finished difference Result 167 states and 201 transitions.
[2025-05-07 17:27:02,944 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:27:02,944 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), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 41
[2025-05-07 17:27:02,945 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:02,946 INFO  L225             Difference]: With dead ends: 167
[2025-05-07 17:27:02,946 INFO  L226             Difference]: Without dead ends: 165
[2025-05-07 17:27:02,946 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:27:02,947 INFO  L437           NwaCegarLoop]: 197 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:02,947 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 571 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:02,947 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 165 states.
[2025-05-07 17:27:02,955 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163.
[2025-05-07 17:27:02,955 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 163 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 75 states have internal predecessors, (75), 53 states have call successors, (60), 40 states have call predecessors, (60), 40 states have return successors, (60), 47 states have call predecessors, (60), 53 states have call successors, (60)
[2025-05-07 17:27:02,956 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 195 transitions.
[2025-05-07 17:27:02,956 INFO  L79                 Accepts]: Start accepts. Automaton has 163 states and 195 transitions. Word has length 41
[2025-05-07 17:27:02,957 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:02,957 INFO  L485      AbstractCegarLoop]: Abstraction has 163 states and 195 transitions.
[2025-05-07 17:27:02,957 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), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:27:02,957 INFO  L278                IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions.
[2025-05-07 17:27:02,958 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-05-07 17:27:02,958 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:02,959 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, 1]
[2025-05-07 17:27:02,959 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:27:02,959 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:02,959 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:02,959 INFO  L85        PathProgramCache]: Analyzing trace with hash 1757194833, now seen corresponding path program 1 times
[2025-05-07 17:27:02,960 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:02,960 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058015936]
[2025-05-07 17:27:02,960 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:02,960 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:02,990 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-05-07 17:27:02,996 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-05-07 17:27:02,997 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:02,997 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:03,078 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:27:03,078 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:03,078 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058015936]
[2025-05-07 17:27:03,078 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058015936] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:03,078 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:03,078 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:27:03,078 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979388150]
[2025-05-07 17:27:03,078 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:03,079 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:27:03,079 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:03,079 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:27:03,079 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:03,079 INFO  L87              Difference]: Start difference. First operand 163 states and 195 transitions. Second operand  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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:27:03,122 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:03,123 INFO  L93              Difference]: Finished difference Result 167 states and 200 transitions.
[2025-05-07 17:27:03,123 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:27:03,123 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 77
[2025-05-07 17:27:03,124 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:03,125 INFO  L225             Difference]: With dead ends: 167
[2025-05-07 17:27:03,125 INFO  L226             Difference]: Without dead ends: 167
[2025-05-07 17:27:03,125 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:27:03,125 INFO  L437           NwaCegarLoop]: 197 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 571 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:27:03,126 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 571 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:03,126 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 167 states.
[2025-05-07 17:27:03,133 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165.
[2025-05-07 17:27:03,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 165 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 76 states have internal predecessors, (76), 53 states have call successors, (60), 40 states have call predecessors, (60), 41 states have return successors, (62), 48 states have call predecessors, (62), 53 states have call successors, (62)
[2025-05-07 17:27:03,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 198 transitions.
[2025-05-07 17:27:03,135 INFO  L79                 Accepts]: Start accepts. Automaton has 165 states and 198 transitions. Word has length 77
[2025-05-07 17:27:03,135 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:03,135 INFO  L485      AbstractCegarLoop]: Abstraction has 165 states and 198 transitions.
[2025-05-07 17:27:03,135 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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:27:03,135 INFO  L278                IsEmpty]: Start isEmpty. Operand 165 states and 198 transitions.
[2025-05-07 17:27:03,137 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-05-07 17:27:03,137 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:03,137 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, 1]
[2025-05-07 17:27:03,137 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:27:03,137 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:03,138 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:03,138 INFO  L85        PathProgramCache]: Analyzing trace with hash 1553417706, now seen corresponding path program 1 times
[2025-05-07 17:27:03,138 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:03,138 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702695837]
[2025-05-07 17:27:03,138 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:03,138 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:03,164 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-05-07 17:27:03,183 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-05-07 17:27:03,183 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:03,183 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:03,342 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:27:03,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:03,342 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702695837]
[2025-05-07 17:27:03,342 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702695837] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:03,342 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:03,342 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-05-07 17:27:03,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231306794]
[2025-05-07 17:27:03,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:03,343 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-05-07 17:27:03,343 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:03,343 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-05-07 17:27:03,343 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-05-07 17:27:03,344 INFO  L87              Difference]: Start difference. First operand 165 states and 198 transitions. Second operand  has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (21), 9 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:27:03,457 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:03,457 INFO  L93              Difference]: Finished difference Result 171 states and 204 transitions.
[2025-05-07 17:27:03,458 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-05-07 17:27:03,458 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (21), 9 states have call predecessors, (21), 4 states have call successors, (21) Word has length 77
[2025-05-07 17:27:03,458 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:03,460 INFO  L225             Difference]: With dead ends: 171
[2025-05-07 17:27:03,460 INFO  L226             Difference]: Without dead ends: 171
[2025-05-07 17:27:03,460 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-05-07 17:27:03,461 INFO  L437           NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:03,461 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1505 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:27:03,462 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 171 states.
[2025-05-07 17:27:03,469 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171.
[2025-05-07 17:27:03,470 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 171 states, 73 states have (on average 1.082191780821918) internal successors, (79), 79 states have internal predecessors, (79), 53 states have call successors, (60), 40 states have call predecessors, (60), 44 states have return successors, (65), 51 states have call predecessors, (65), 53 states have call successors, (65)
[2025-05-07 17:27:03,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 204 transitions.
[2025-05-07 17:27:03,471 INFO  L79                 Accepts]: Start accepts. Automaton has 171 states and 204 transitions. Word has length 77
[2025-05-07 17:27:03,471 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:03,471 INFO  L485      AbstractCegarLoop]: Abstraction has 171 states and 204 transitions.
[2025-05-07 17:27:03,471 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (21), 9 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:27:03,471 INFO  L278                IsEmpty]: Start isEmpty. Operand 171 states and 204 transitions.
[2025-05-07 17:27:03,472 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-05-07 17:27:03,472 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:03,472 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, 1]
[2025-05-07 17:27:03,472 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:27:03,472 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:03,473 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:03,473 INFO  L85        PathProgramCache]: Analyzing trace with hash 1521433421, now seen corresponding path program 1 times
[2025-05-07 17:27:03,473 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:03,473 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906785425]
[2025-05-07 17:27:03,473 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:03,473 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:03,503 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-05-07 17:27:03,523 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-05-07 17:27:03,523 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:03,523 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:03,668 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:27:03,668 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:03,668 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906785425]
[2025-05-07 17:27:03,668 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906785425] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:03,668 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:03,669 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-05-07 17:27:03,669 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012019035]
[2025-05-07 17:27:03,669 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:03,669 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-05-07 17:27:03,669 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:03,670 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-05-07 17:27:03,670 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-05-07 17:27:03,670 INFO  L87              Difference]: Start difference. First operand 171 states and 204 transitions. Second operand  has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (21), 9 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:27:03,752 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:03,753 INFO  L93              Difference]: Finished difference Result 168 states and 197 transitions.
[2025-05-07 17:27:03,753 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-05-07 17:27:03,753 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (21), 9 states have call predecessors, (21), 4 states have call successors, (21) Word has length 77
[2025-05-07 17:27:03,754 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:03,754 INFO  L225             Difference]: With dead ends: 168
[2025-05-07 17:27:03,754 INFO  L226             Difference]: Without dead ends: 164
[2025-05-07 17:27:03,755 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-05-07 17:27:03,755 INFO  L437           NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:03,755 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1498 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:27:03,756 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 164 states.
[2025-05-07 17:27:03,761 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158.
[2025-05-07 17:27:03,770 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 158 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 73 states have internal predecessors, (73), 48 states have call successors, (55), 40 states have call predecessors, (55), 40 states have return successors, (55), 44 states have call predecessors, (55), 48 states have call successors, (55)
[2025-05-07 17:27:03,771 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions.
[2025-05-07 17:27:03,772 INFO  L79                 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 77
[2025-05-07 17:27:03,772 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:03,772 INFO  L485      AbstractCegarLoop]: Abstraction has 158 states and 183 transitions.
[2025-05-07 17:27:03,772 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (21), 9 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:27:03,772 INFO  L278                IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions.
[2025-05-07 17:27:03,774 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:27:03,774 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:03,774 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, 1, 1, 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:27:03,774 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:27:03,774 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:03,775 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:03,775 INFO  L85        PathProgramCache]: Analyzing trace with hash 769116090, now seen corresponding path program 1 times
[2025-05-07 17:27:03,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:03,775 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837609852]
[2025-05-07 17:27:03,775 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:03,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:03,813 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:27:03,816 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:27:03,816 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:03,816 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:03,886 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:27:03,886 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:03,886 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837609852]
[2025-05-07 17:27:03,886 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837609852] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:03,886 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:03,886 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:27:03,887 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223525130]
[2025-05-07 17:27:03,887 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:03,887 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:27:03,887 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:03,888 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:27:03,888 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:03,888 INFO  L87              Difference]: Start difference. First operand 158 states and 183 transitions. Second operand  has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28)
[2025-05-07 17:27:03,901 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:03,901 INFO  L93              Difference]: Finished difference Result 160 states and 184 transitions.
[2025-05-07 17:27:03,901 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:27:03,902 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 102
[2025-05-07 17:27:03,902 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:03,903 INFO  L225             Difference]: With dead ends: 160
[2025-05-07 17:27:03,903 INFO  L226             Difference]: Without dead ends: 154
[2025-05-07 17:27:03,903 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:27:03,904 INFO  L437           NwaCegarLoop]: 184 mSDtfsCounter, 1 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 541 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:27:03,904 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 541 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:03,905 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 154 states.
[2025-05-07 17:27:03,912 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154.
[2025-05-07 17:27:03,912 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 154 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 72 states have internal predecessors, (72), 44 states have call successors, (51), 40 states have call predecessors, (51), 40 states have return successors, (51), 41 states have call predecessors, (51), 44 states have call successors, (51)
[2025-05-07 17:27:03,914 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 174 transitions.
[2025-05-07 17:27:03,914 INFO  L79                 Accepts]: Start accepts. Automaton has 154 states and 174 transitions. Word has length 102
[2025-05-07 17:27:03,914 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:03,914 INFO  L485      AbstractCegarLoop]: Abstraction has 154 states and 174 transitions.
[2025-05-07 17:27:03,914 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28)
[2025-05-07 17:27:03,914 INFO  L278                IsEmpty]: Start isEmpty. Operand 154 states and 174 transitions.
[2025-05-07 17:27:03,916 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:27:03,916 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:03,916 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, 1, 1, 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:27:03,916 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:27:03,916 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:03,916 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:03,917 INFO  L85        PathProgramCache]: Analyzing trace with hash 1400025322, now seen corresponding path program 1 times
[2025-05-07 17:27:03,917 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:03,917 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121890612]
[2025-05-07 17:27:03,917 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:03,917 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:03,956 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:27:03,979 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:27:03,979 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:03,979 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:04,055 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:27:04,056 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:04,056 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121890612]
[2025-05-07 17:27:04,056 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121890612] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:04,056 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:04,056 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:27:04,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974191859]
[2025-05-07 17:27:04,056 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:04,057 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:27:04,057 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:04,058 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:27:04,058 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:04,058 INFO  L87              Difference]: Start difference. First operand 154 states and 174 transitions. Second operand  has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 4 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28)
[2025-05-07 17:27:04,076 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:04,077 INFO  L93              Difference]: Finished difference Result 156 states and 175 transitions.
[2025-05-07 17:27:04,077 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:27:04,077 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 4 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 102
[2025-05-07 17:27:04,078 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:04,079 INFO  L225             Difference]: With dead ends: 156
[2025-05-07 17:27:04,079 INFO  L226             Difference]: Without dead ends: 152
[2025-05-07 17:27:04,079 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:27:04,080 INFO  L437           NwaCegarLoop]: 174 mSDtfsCounter, 1 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 509 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:27:04,080 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 509 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:04,081 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 152 states.
[2025-05-07 17:27:04,088 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152.
[2025-05-07 17:27:04,088 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 152 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 71 states have internal predecessors, (71), 42 states have call successors, (49), 40 states have call predecessors, (49), 40 states have return successors, (49), 40 states have call predecessors, (49), 42 states have call successors, (49)
[2025-05-07 17:27:04,090 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions.
[2025-05-07 17:27:04,090 INFO  L79                 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 102
[2025-05-07 17:27:04,090 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:04,090 INFO  L485      AbstractCegarLoop]: Abstraction has 152 states and 169 transitions.
[2025-05-07 17:27:04,091 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 4 states have call successors, (28), 1 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28)
[2025-05-07 17:27:04,091 INFO  L278                IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions.
[2025-05-07 17:27:04,092 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:27:04,092 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:04,093 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, 1, 1, 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:27:04,093 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:27:04,093 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:04,093 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:04,093 INFO  L85        PathProgramCache]: Analyzing trace with hash 762214889, now seen corresponding path program 1 times
[2025-05-07 17:27:04,093 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:04,094 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57409616]
[2025-05-07 17:27:04,094 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:04,094 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:04,141 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:27:04,168 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:27:04,168 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:04,168 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:04,332 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:27:04,332 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:04,333 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57409616]
[2025-05-07 17:27:04,333 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57409616] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:04,333 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:04,333 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:27:04,333 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90322724]
[2025-05-07 17:27:04,333 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:04,333 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:27:04,333 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:04,334 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:27:04,334 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:27:04,334 INFO  L87              Difference]: Start difference. First operand 152 states and 169 transitions. Second operand  has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (28), 1 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 4 states have call successors, (28)
[2025-05-07 17:27:04,376 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:04,376 INFO  L93              Difference]: Finished difference Result 160 states and 178 transitions.
[2025-05-07 17:27:04,376 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:27:04,376 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (28), 1 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 4 states have call successors, (28) Word has length 102
[2025-05-07 17:27:04,377 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:04,378 INFO  L225             Difference]: With dead ends: 160
[2025-05-07 17:27:04,378 INFO  L226             Difference]: Without dead ends: 148
[2025-05-07 17:27:04,378 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:27:04,378 INFO  L437           NwaCegarLoop]: 173 mSDtfsCounter, 1 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:04,379 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1023 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:04,379 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 148 states.
[2025-05-07 17:27:04,383 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148.
[2025-05-07 17:27:04,384 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 148 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 69 states have internal predecessors, (69), 41 states have call successors, (47), 39 states have call predecessors, (47), 39 states have return successors, (47), 39 states have call predecessors, (47), 41 states have call successors, (47)
[2025-05-07 17:27:04,385 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 163 transitions.
[2025-05-07 17:27:04,385 INFO  L79                 Accepts]: Start accepts. Automaton has 148 states and 163 transitions. Word has length 102
[2025-05-07 17:27:04,386 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:04,386 INFO  L485      AbstractCegarLoop]: Abstraction has 148 states and 163 transitions.
[2025-05-07 17:27:04,386 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (28), 1 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 4 states have call successors, (28)
[2025-05-07 17:27:04,386 INFO  L278                IsEmpty]: Start isEmpty. Operand 148 states and 163 transitions.
[2025-05-07 17:27:04,387 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:27:04,387 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:04,387 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, 1, 1, 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:27:04,387 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:27:04,388 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:04,388 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:04,388 INFO  L85        PathProgramCache]: Analyzing trace with hash -398769178, now seen corresponding path program 1 times
[2025-05-07 17:27:04,388 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:04,388 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000508336]
[2025-05-07 17:27:04,388 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:04,388 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:04,419 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:27:04,435 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:27:04,435 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:04,435 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:04,833 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:27:04,833 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:04,833 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000508336]
[2025-05-07 17:27:04,833 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000508336] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:04,833 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:04,833 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2025-05-07 17:27:04,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49975126]
[2025-05-07 17:27:04,834 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:04,834 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-05-07 17:27:04,834 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:04,835 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-05-07 17:27:04,835 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:27:04,835 INFO  L87              Difference]: Start difference. First operand 148 states and 163 transitions. Second operand  has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 7 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (28), 13 states have call predecessors, (28), 7 states have call successors, (28)
[2025-05-07 17:27:05,024 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:05,024 INFO  L93              Difference]: Finished difference Result 165 states and 183 transitions.
[2025-05-07 17:27:05,024 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-05-07 17:27:05,024 INFO  L79                 Accepts]: Start accepts. Automaton has  has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 7 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (28), 13 states have call predecessors, (28), 7 states have call successors, (28) Word has length 102
[2025-05-07 17:27:05,025 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:05,025 INFO  L225             Difference]: With dead ends: 165
[2025-05-07 17:27:05,025 INFO  L226             Difference]: Without dead ends: 165
[2025-05-07 17:27:05,026 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272
[2025-05-07 17:27:05,026 INFO  L437           NwaCegarLoop]: 158 mSDtfsCounter, 4 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:05,026 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2187 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:27:05,027 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 165 states.
[2025-05-07 17:27:05,032 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161.
[2025-05-07 17:27:05,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 161 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 75 states have internal predecessors, (75), 42 states have call successors, (48), 39 states have call predecessors, (48), 45 states have return successors, (54), 46 states have call predecessors, (54), 42 states have call successors, (54)
[2025-05-07 17:27:05,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 177 transitions.
[2025-05-07 17:27:05,034 INFO  L79                 Accepts]: Start accepts. Automaton has 161 states and 177 transitions. Word has length 102
[2025-05-07 17:27:05,034 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:05,034 INFO  L485      AbstractCegarLoop]: Abstraction has 161 states and 177 transitions.
[2025-05-07 17:27:05,034 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 7 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (28), 13 states have call predecessors, (28), 7 states have call successors, (28)
[2025-05-07 17:27:05,034 INFO  L278                IsEmpty]: Start isEmpty. Operand 161 states and 177 transitions.
[2025-05-07 17:27:05,035 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:27:05,035 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:05,036 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, 1, 1, 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:27:05,036 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:27:05,036 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:05,036 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:05,036 INFO  L85        PathProgramCache]: Analyzing trace with hash 938261097, now seen corresponding path program 1 times
[2025-05-07 17:27:05,036 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:05,037 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227094475]
[2025-05-07 17:27:05,037 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:05,037 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:05,087 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:27:05,116 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:27:05,116 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:05,116 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:05,464 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:27:05,464 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:05,464 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227094475]
[2025-05-07 17:27:05,464 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227094475] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:05,464 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:05,465 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2025-05-07 17:27:05,465 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656643684]
[2025-05-07 17:27:05,465 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:05,465 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-05-07 17:27:05,465 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:05,466 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-05-07 17:27:05,466 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:27:05,466 INFO  L87              Difference]: Start difference. First operand 161 states and 177 transitions. Second operand  has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 7 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (28), 13 states have call predecessors, (28), 7 states have call successors, (28)
[2025-05-07 17:27:05,643 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:05,643 INFO  L93              Difference]: Finished difference Result 165 states and 182 transitions.
[2025-05-07 17:27:05,644 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-05-07 17:27:05,644 INFO  L79                 Accepts]: Start accepts. Automaton has  has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 7 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (28), 13 states have call predecessors, (28), 7 states have call successors, (28) Word has length 102
[2025-05-07 17:27:05,645 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:05,646 INFO  L225             Difference]: With dead ends: 165
[2025-05-07 17:27:05,646 INFO  L226             Difference]: Without dead ends: 157
[2025-05-07 17:27:05,646 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272
[2025-05-07 17:27:05,646 INFO  L437           NwaCegarLoop]: 153 mSDtfsCounter, 4 mSDsluCounter, 1967 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:05,647 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2120 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:27:05,647 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 157 states.
[2025-05-07 17:27:05,652 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 144.
[2025-05-07 17:27:05,652 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 144 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 67 states have internal predecessors, (67), 40 states have call successors, (45), 38 states have call predecessors, (45), 38 states have return successors, (45), 38 states have call predecessors, (45), 40 states have call successors, (45)
[2025-05-07 17:27:05,653 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions.
[2025-05-07 17:27:05,653 INFO  L79                 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 102
[2025-05-07 17:27:05,654 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:05,654 INFO  L485      AbstractCegarLoop]: Abstraction has 144 states and 157 transitions.
[2025-05-07 17:27:05,654 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 7 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (28), 13 states have call predecessors, (28), 7 states have call successors, (28)
[2025-05-07 17:27:05,654 INFO  L278                IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions.
[2025-05-07 17:27:05,655 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2025-05-07 17:27:05,655 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:05,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:05,655 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:27:05,656 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:05,656 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:05,656 INFO  L85        PathProgramCache]: Analyzing trace with hash 1689547170, now seen corresponding path program 1 times
[2025-05-07 17:27:05,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:05,656 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295955698]
[2025-05-07 17:27:05,656 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:05,656 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:05,699 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes.
[2025-05-07 17:27:05,719 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements.
[2025-05-07 17:27:05,720 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:05,720 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:05,837 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:27:05,837 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:05,837 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295955698]
[2025-05-07 17:27:05,837 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295955698] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:05,837 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:05,837 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:27:05,837 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864373982]
[2025-05-07 17:27:05,837 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:05,838 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:27:05,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:05,838 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:27:05,839 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:27:05,839 INFO  L87              Difference]: Start difference. First operand 144 states and 157 transitions. Second operand  has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (30), 1 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 4 states have call successors, (30)
[2025-05-07 17:27:05,875 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:05,875 INFO  L93              Difference]: Finished difference Result 152 states and 166 transitions.
[2025-05-07 17:27:05,875 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:27:05,876 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (30), 1 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 4 states have call successors, (30) Word has length 110
[2025-05-07 17:27:05,876 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:05,876 INFO  L225             Difference]: With dead ends: 152
[2025-05-07 17:27:05,876 INFO  L226             Difference]: Without dead ends: 140
[2025-05-07 17:27:05,877 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:27:05,877 INFO  L437           NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:05,877 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 940 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:05,878 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2025-05-07 17:27:05,880 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140.
[2025-05-07 17:27:05,880 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 140 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 65 states have internal predecessors, (65), 39 states have call successors, (43), 37 states have call predecessors, (43), 37 states have return successors, (43), 37 states have call predecessors, (43), 39 states have call successors, (43)
[2025-05-07 17:27:05,881 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions.
[2025-05-07 17:27:05,881 INFO  L79                 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 110
[2025-05-07 17:27:05,881 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:05,881 INFO  L485      AbstractCegarLoop]: Abstraction has 140 states and 151 transitions.
[2025-05-07 17:27:05,881 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (30), 1 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 4 states have call successors, (30)
[2025-05-07 17:27:05,881 INFO  L278                IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions.
[2025-05-07 17:27:05,882 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2025-05-07 17:27:05,882 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:05,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:05,882 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:27:05,882 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:05,883 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:05,883 INFO  L85        PathProgramCache]: Analyzing trace with hash 135812020, now seen corresponding path program 1 times
[2025-05-07 17:27:05,883 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:05,883 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742698064]
[2025-05-07 17:27:05,883 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:05,883 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:05,917 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes.
[2025-05-07 17:27:05,932 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements.
[2025-05-07 17:27:05,932 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:05,932 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:06,027 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:27:06,027 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:06,027 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742698064]
[2025-05-07 17:27:06,028 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742698064] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:06,028 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:06,028 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:27:06,028 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057625181]
[2025-05-07 17:27:06,028 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:06,028 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:27:06,028 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:06,029 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:27:06,029 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:27:06,029 INFO  L87              Difference]: Start difference. First operand 140 states and 151 transitions. Second operand  has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (30), 1 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 4 states have call successors, (30)
[2025-05-07 17:27:06,062 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:06,062 INFO  L93              Difference]: Finished difference Result 148 states and 160 transitions.
[2025-05-07 17:27:06,062 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:27:06,062 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (30), 1 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 4 states have call successors, (30) Word has length 110
[2025-05-07 17:27:06,063 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:06,064 INFO  L225             Difference]: With dead ends: 148
[2025-05-07 17:27:06,064 INFO  L226             Difference]: Without dead ends: 136
[2025-05-07 17:27:06,064 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:27:06,065 INFO  L437           NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:06,065 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 914 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:06,066 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 136 states.
[2025-05-07 17:27:06,069 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136.
[2025-05-07 17:27:06,070 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 136 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 63 states have internal predecessors, (63), 38 states have call successors, (41), 36 states have call predecessors, (41), 36 states have return successors, (41), 36 states have call predecessors, (41), 38 states have call successors, (41)
[2025-05-07 17:27:06,071 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions.
[2025-05-07 17:27:06,071 INFO  L79                 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 110
[2025-05-07 17:27:06,071 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:06,071 INFO  L485      AbstractCegarLoop]: Abstraction has 136 states and 145 transitions.
[2025-05-07 17:27:06,072 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (30), 1 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 4 states have call successors, (30)
[2025-05-07 17:27:06,072 INFO  L278                IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions.
[2025-05-07 17:27:06,073 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2025-05-07 17:27:06,073 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:06,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:06,073 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-05-07 17:27:06,073 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:06,074 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:06,074 INFO  L85        PathProgramCache]: Analyzing trace with hash 1870717317, now seen corresponding path program 1 times
[2025-05-07 17:27:06,074 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:06,074 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585635986]
[2025-05-07 17:27:06,074 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:06,074 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:06,109 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes.
[2025-05-07 17:27:06,122 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements.
[2025-05-07 17:27:06,122 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:06,122 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:06,258 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:27:06,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:06,258 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585635986]
[2025-05-07 17:27:06,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585635986] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:06,258 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:06,258 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:27:06,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292258385]
[2025-05-07 17:27:06,258 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:06,258 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:27:06,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:06,259 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:27:06,259 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:27:06,259 INFO  L87              Difference]: Start difference. First operand 136 states and 145 transitions. Second operand  has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (30), 1 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 4 states have call successors, (30)
[2025-05-07 17:27:06,293 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:06,293 INFO  L93              Difference]: Finished difference Result 144 states and 154 transitions.
[2025-05-07 17:27:06,294 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:27:06,294 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (30), 1 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 4 states have call successors, (30) Word has length 110
[2025-05-07 17:27:06,294 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:06,295 INFO  L225             Difference]: With dead ends: 144
[2025-05-07 17:27:06,295 INFO  L226             Difference]: Without dead ends: 132
[2025-05-07 17:27:06,295 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:27:06,295 INFO  L437           NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:06,295 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 868 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:06,296 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 132 states.
[2025-05-07 17:27:06,298 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132.
[2025-05-07 17:27:06,298 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 132 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 61 states have internal predecessors, (61), 37 states have call successors, (39), 35 states have call predecessors, (39), 35 states have return successors, (39), 35 states have call predecessors, (39), 37 states have call successors, (39)
[2025-05-07 17:27:06,298 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions.
[2025-05-07 17:27:06,298 INFO  L79                 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 110
[2025-05-07 17:27:06,298 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:06,298 INFO  L485      AbstractCegarLoop]: Abstraction has 132 states and 139 transitions.
[2025-05-07 17:27:06,299 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (30), 1 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 4 states have call successors, (30)
[2025-05-07 17:27:06,299 INFO  L278                IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions.
[2025-05-07 17:27:06,299 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2025-05-07 17:27:06,299 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:06,299 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:06,299 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-05-07 17:27:06,299 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:06,300 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:06,300 INFO  L85        PathProgramCache]: Analyzing trace with hash -1135482119, now seen corresponding path program 1 times
[2025-05-07 17:27:06,300 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:06,300 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315861310]
[2025-05-07 17:27:06,300 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:06,300 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:06,335 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes.
[2025-05-07 17:27:06,350 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements.
[2025-05-07 17:27:06,350 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:06,350 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:07,131 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:27:07,131 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:07,131 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315861310]
[2025-05-07 17:27:07,132 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315861310] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:07,132 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:07,132 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25
[2025-05-07 17:27:07,132 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774171577]
[2025-05-07 17:27:07,132 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:07,132 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2025-05-07 17:27:07,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:07,133 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2025-05-07 17:27:07,133 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600
[2025-05-07 17:27:07,133 INFO  L87              Difference]: Start difference. First operand 132 states and 139 transitions. Second operand  has 25 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 22 states have internal predecessors, (50), 10 states have call successors, (30), 1 states have call predecessors, (30), 19 states have return successors, (30), 20 states have call predecessors, (30), 10 states have call successors, (30)
[2025-05-07 17:27:07,609 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:07,609 INFO  L93              Difference]: Finished difference Result 149 states and 159 transitions.
[2025-05-07 17:27:07,610 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-05-07 17:27:07,610 INFO  L79                 Accepts]: Start accepts. Automaton has  has 25 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 22 states have internal predecessors, (50), 10 states have call successors, (30), 1 states have call predecessors, (30), 19 states have return successors, (30), 20 states have call predecessors, (30), 10 states have call successors, (30) Word has length 110
[2025-05-07 17:27:07,610 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:07,611 INFO  L225             Difference]: With dead ends: 149
[2025-05-07 17:27:07,611 INFO  L226             Difference]: Without dead ends: 149
[2025-05-07 17:27:07,611 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=803, Unknown=0, NotChecked=0, Total=870
[2025-05-07 17:27:07,611 INFO  L437           NwaCegarLoop]: 124 mSDtfsCounter, 7 mSDsluCounter, 2786 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2910 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:07,612 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2910 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-05-07 17:27:07,612 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 149 states.
[2025-05-07 17:27:07,615 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145.
[2025-05-07 17:27:07,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 145 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 67 states have internal predecessors, (67), 38 states have call successors, (40), 35 states have call predecessors, (40), 41 states have return successors, (46), 42 states have call predecessors, (46), 38 states have call successors, (46)
[2025-05-07 17:27:07,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions.
[2025-05-07 17:27:07,616 INFO  L79                 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 110
[2025-05-07 17:27:07,616 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:07,616 INFO  L485      AbstractCegarLoop]: Abstraction has 145 states and 153 transitions.
[2025-05-07 17:27:07,616 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 22 states have internal predecessors, (50), 10 states have call successors, (30), 1 states have call predecessors, (30), 19 states have return successors, (30), 20 states have call predecessors, (30), 10 states have call successors, (30)
[2025-05-07 17:27:07,616 INFO  L278                IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions.
[2025-05-07 17:27:07,617 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2025-05-07 17:27:07,617 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:07,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:07,617 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-05-07 17:27:07,617 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:07,617 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:07,618 INFO  L85        PathProgramCache]: Analyzing trace with hash 1131521910, now seen corresponding path program 1 times
[2025-05-07 17:27:07,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:07,618 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808294597]
[2025-05-07 17:27:07,618 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:07,618 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:07,655 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes.
[2025-05-07 17:27:07,680 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements.
[2025-05-07 17:27:07,680 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:07,680 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:09,432 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:27:09,432 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:09,432 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808294597]
[2025-05-07 17:27:09,432 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808294597] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:09,432 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:09,432 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35
[2025-05-07 17:27:09,432 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116778060]
[2025-05-07 17:27:09,432 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:09,433 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2025-05-07 17:27:09,433 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:09,433 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2025-05-07 17:27:09,433 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190
[2025-05-07 17:27:09,434 INFO  L87              Difference]: Start difference. First operand 145 states and 153 transitions. Second operand  has 35 states, 25 states have (on average 2.0) internal successors, (50), 30 states have internal predecessors, (50), 15 states have call successors, (30), 1 states have call predecessors, (30), 25 states have return successors, (30), 26 states have call predecessors, (30), 15 states have call successors, (30)
[2025-05-07 17:27:10,150 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:10,151 INFO  L93              Difference]: Finished difference Result 150 states and 160 transitions.
[2025-05-07 17:27:10,151 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2025-05-07 17:27:10,151 INFO  L79                 Accepts]: Start accepts. Automaton has  has 35 states, 25 states have (on average 2.0) internal successors, (50), 30 states have internal predecessors, (50), 15 states have call successors, (30), 1 states have call predecessors, (30), 25 states have return successors, (30), 26 states have call predecessors, (30), 15 states have call successors, (30) Word has length 110
[2025-05-07 17:27:10,151 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:10,152 INFO  L225             Difference]: With dead ends: 150
[2025-05-07 17:27:10,152 INFO  L226             Difference]: Without dead ends: 141
[2025-05-07 17:27:10,152 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=1623, Unknown=0, NotChecked=0, Total=1722
[2025-05-07 17:27:10,153 INFO  L437           NwaCegarLoop]: 120 mSDtfsCounter, 8 mSDsluCounter, 3867 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3987 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:10,153 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3987 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-05-07 17:27:10,153 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 141 states.
[2025-05-07 17:27:10,155 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 128.
[2025-05-07 17:27:10,155 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 128 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 36 states have call successors, (37), 34 states have call predecessors, (37), 34 states have return successors, (37), 34 states have call predecessors, (37), 36 states have call successors, (37)
[2025-05-07 17:27:10,156 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions.
[2025-05-07 17:27:10,156 INFO  L79                 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 110
[2025-05-07 17:27:10,156 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:10,156 INFO  L485      AbstractCegarLoop]: Abstraction has 128 states and 133 transitions.
[2025-05-07 17:27:10,156 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 25 states have (on average 2.0) internal successors, (50), 30 states have internal predecessors, (50), 15 states have call successors, (30), 1 states have call predecessors, (30), 25 states have return successors, (30), 26 states have call predecessors, (30), 15 states have call successors, (30)
[2025-05-07 17:27:10,156 INFO  L278                IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions.
[2025-05-07 17:27:10,157 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2025-05-07 17:27:10,157 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:10,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:10,157 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-05-07 17:27:10,157 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:10,157 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:10,157 INFO  L85        PathProgramCache]: Analyzing trace with hash 1872841742, now seen corresponding path program 1 times
[2025-05-07 17:27:10,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:10,158 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891240500]
[2025-05-07 17:27:10,158 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:10,158 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:10,193 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes.
[2025-05-07 17:27:10,213 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements.
[2025-05-07 17:27:10,213 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:10,214 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:10,311 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:27:10,311 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:10,311 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891240500]
[2025-05-07 17:27:10,311 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891240500] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:10,312 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:10,312 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:27:10,312 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721787492]
[2025-05-07 17:27:10,312 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:10,312 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:27:10,312 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:10,312 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:27:10,312 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:27:10,313 INFO  L87              Difference]: Start difference. First operand 128 states and 133 transitions. Second operand  has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (30), 1 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 4 states have call successors, (30)
[2025-05-07 17:27:10,342 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:10,342 INFO  L93              Difference]: Finished difference Result 136 states and 142 transitions.
[2025-05-07 17:27:10,342 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:27:10,342 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (30), 1 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 4 states have call successors, (30) Word has length 110
[2025-05-07 17:27:10,342 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:10,343 INFO  L225             Difference]: With dead ends: 136
[2025-05-07 17:27:10,343 INFO  L226             Difference]: Without dead ends: 124
[2025-05-07 17:27:10,343 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:27:10,343 INFO  L437           NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:10,343 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 770 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:10,344 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2025-05-07 17:27:10,346 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124.
[2025-05-07 17:27:10,346 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 124 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 57 states have internal predecessors, (57), 35 states have call successors, (35), 33 states have call predecessors, (35), 33 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35)
[2025-05-07 17:27:10,347 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 127 transitions.
[2025-05-07 17:27:10,347 INFO  L79                 Accepts]: Start accepts. Automaton has 124 states and 127 transitions. Word has length 110
[2025-05-07 17:27:10,347 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:10,347 INFO  L485      AbstractCegarLoop]: Abstraction has 124 states and 127 transitions.
[2025-05-07 17:27:10,347 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (30), 1 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 4 states have call successors, (30)
[2025-05-07 17:27:10,347 INFO  L278                IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions.
[2025-05-07 17:27:10,348 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2025-05-07 17:27:10,348 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:10,349 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:10,349 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-05-07 17:27:10,349 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:10,349 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:10,349 INFO  L85        PathProgramCache]: Analyzing trace with hash -2036199228, now seen corresponding path program 1 times
[2025-05-07 17:27:10,349 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:10,349 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101150562]
[2025-05-07 17:27:10,350 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:10,350 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:10,381 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes.
[2025-05-07 17:27:10,393 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements.
[2025-05-07 17:27:10,393 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:10,393 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:10,557 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:27:10,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:10,557 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101150562]
[2025-05-07 17:27:10,557 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101150562] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:10,557 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:10,557 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-05-07 17:27:10,557 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181198334]
[2025-05-07 17:27:10,557 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:10,558 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-05-07 17:27:10,558 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:10,558 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-05-07 17:27:10,558 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:27:10,559 INFO  L87              Difference]: Start difference. First operand 124 states and 127 transitions. Second operand  has 11 states, 8 states have (on average 6.375) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (31), 1 states have call predecessors, (31), 8 states have return successors, (31), 9 states have call predecessors, (31), 6 states have call successors, (31)
[2025-05-07 17:27:10,642 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:10,642 INFO  L93              Difference]: Finished difference Result 130 states and 132 transitions.
[2025-05-07 17:27:10,642 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-05-07 17:27:10,643 INFO  L79                 Accepts]: Start accepts. Automaton has  has 11 states, 8 states have (on average 6.375) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (31), 1 states have call predecessors, (31), 8 states have return successors, (31), 9 states have call predecessors, (31), 6 states have call successors, (31) Word has length 113
[2025-05-07 17:27:10,643 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:10,643 INFO  L225             Difference]: With dead ends: 130
[2025-05-07 17:27:10,643 INFO  L226             Difference]: Without dead ends: 119
[2025-05-07 17:27:10,644 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2025-05-07 17:27:10,644 INFO  L437           NwaCegarLoop]: 125 mSDtfsCounter, 2 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:10,644 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1219 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:27:10,645 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2025-05-07 17:27:10,648 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119.
[2025-05-07 17:27:10,648 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 119 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 54 states have internal predecessors, (54), 33 states have call successors, (33), 32 states have call predecessors, (33), 32 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33)
[2025-05-07 17:27:10,649 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions.
[2025-05-07 17:27:10,649 INFO  L79                 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 113
[2025-05-07 17:27:10,649 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:10,649 INFO  L485      AbstractCegarLoop]: Abstraction has 119 states and 120 transitions.
[2025-05-07 17:27:10,649 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 8 states have (on average 6.375) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (31), 1 states have call predecessors, (31), 8 states have return successors, (31), 9 states have call predecessors, (31), 6 states have call successors, (31)
[2025-05-07 17:27:10,649 INFO  L278                IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions.
[2025-05-07 17:27:10,650 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2025-05-07 17:27:10,650 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:10,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:10,650 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-05-07 17:27:10,650 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:10,650 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:10,651 INFO  L85        PathProgramCache]: Analyzing trace with hash 1790077043, now seen corresponding path program 1 times
[2025-05-07 17:27:10,651 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:10,651 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295231715]
[2025-05-07 17:27:10,651 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:10,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:10,689 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes.
[2025-05-07 17:27:10,712 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements.
[2025-05-07 17:27:10,712 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:10,712 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:10,919 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:27:10,919 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:10,919 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295231715]
[2025-05-07 17:27:10,919 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295231715] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:10,919 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:10,919 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-05-07 17:27:10,919 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047769450]
[2025-05-07 17:27:10,919 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:10,919 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-05-07 17:27:10,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:10,920 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-05-07 17:27:10,920 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:27:10,920 INFO  L87              Difference]: Start difference. First operand 119 states and 120 transitions. Second operand  has 11 states, 8 states have (on average 6.375) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (31), 1 states have call predecessors, (31), 8 states have return successors, (31), 9 states have call predecessors, (31), 6 states have call successors, (31)
[2025-05-07 17:27:10,971 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:10,971 INFO  L93              Difference]: Finished difference Result 80 states and 81 transitions.
[2025-05-07 17:27:10,972 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-05-07 17:27:10,972 INFO  L79                 Accepts]: Start accepts. Automaton has  has 11 states, 8 states have (on average 6.375) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (31), 1 states have call predecessors, (31), 8 states have return successors, (31), 9 states have call predecessors, (31), 6 states have call successors, (31) Word has length 113
[2025-05-07 17:27:10,972 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:10,972 INFO  L225             Difference]: With dead ends: 80
[2025-05-07 17:27:10,972 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:27:10,972 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2025-05-07 17:27:10,973 INFO  L437           NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:10,973 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 662 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:10,973 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:27:10,973 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:27:10,973 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:27:10,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:27:10,973 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113
[2025-05-07 17:27:10,973 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:10,973 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:27:10,973 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 8 states have (on average 6.375) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (31), 1 states have call predecessors, (31), 8 states have return successors, (31), 9 states have call predecessors, (31), 6 states have call successors, (31)
[2025-05-07 17:27:10,973 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:27:10,974 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:27:10,975 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:27:10,976 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-05-07 17:27:10,978 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:10,980 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:27:10,983 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:27:10 BoogieIcfgContainer
[2025-05-07 17:27:10,983 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:27:10,983 INFO  L158              Benchmark]: Toolchain (without parser) took 9614.70ms. Allocated memory was 234.9MB in the beginning and 436.2MB in the end (delta: 201.3MB). Free memory was 130.7MB in the beginning and 258.6MB in the end (delta: -127.8MB). Peak memory consumption was 86.0MB. Max. memory is 33.6GB.
[2025-05-07 17:27:10,983 INFO  L158              Benchmark]: SmtParser took 0.20ms. Allocated memory is still 234.9MB. Free memory is still 172.4MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:10,984 INFO  L158              Benchmark]: ChcToBoogie took 41.09ms. Allocated memory is still 234.9MB. Free memory was 130.7MB in the beginning and 125.9MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:10,984 INFO  L158              Benchmark]: Boogie Preprocessor took 70.19ms. Allocated memory is still 234.9MB. Free memory was 125.9MB in the beginning and 121.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:10,984 INFO  L158              Benchmark]: RCFGBuilder took 643.54ms. Allocated memory is still 234.9MB. Free memory was 121.6MB in the beginning and 125.8MB in the end (delta: -4.2MB). Peak memory consumption was 24.7MB. Max. memory is 33.6GB.
[2025-05-07 17:27:10,984 INFO  L158              Benchmark]: TraceAbstraction took 8856.78ms. Allocated memory was 234.9MB in the beginning and 436.2MB in the end (delta: 201.3MB). Free memory was 125.2MB in the beginning and 258.6MB in the end (delta: -133.4MB). Peak memory consumption was 61.3MB. Max. memory is 33.6GB.
[2025-05-07 17:27:10,985 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.20ms. Allocated memory is still 234.9MB. Free memory is still 172.4MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 41.09ms. Allocated memory is still 234.9MB. Free memory was 130.7MB in the beginning and 125.9MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 70.19ms. Allocated memory is still 234.9MB. Free memory was 125.9MB in the beginning and 121.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 643.54ms. Allocated memory is still 234.9MB. Free memory was 121.6MB in the beginning and 125.8MB in the end (delta: -4.2MB). Peak memory consumption was 24.7MB. Max. memory is 33.6GB.
 * TraceAbstraction took 8856.78ms. Allocated memory was 234.9MB in the beginning and 436.2MB in the end (delta: 201.3MB). Free memory was 125.2MB in the beginning and 258.6MB in the end (delta: -133.4MB). Peak memory consumption was 61.3MB. 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 41 procedures, 169 locations, 271 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 23775 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20923 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2324 IncrementalHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 2852 mSDtfsCounter, 2324 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=4, InterpolantAutomatonStates: 187, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 44 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1709 NumberOfCodeBlocks, 1709 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1691 ConstructedInterpolants, 0 QuantifiedInterpolants, 2521 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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:27:10,998 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
