./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/blockchain_state/balance_receive_5.sol_1_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:28:18,985 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:28:19,021 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b38aa6c-297b-4e24-bc08-dc9efc92c095/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:28:19,024 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:28:19,024 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:28:19,037 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:28:19,038 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:28:19,038 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:28:19,038 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:28:19,038 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:28:19,038 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:28:19,038 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:28:19,038 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:28:19,038 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:28:19,038 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:28:19,039 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:28:19,039 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:28:19,039 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:28:19,039 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:19,039 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:28:19,039 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:28:19,039 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:28:19,039 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:28:19,039 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:28:19,039 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:28:19,040 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:28:19,040 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:28:19,214 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:28:19,222 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:28:19,224 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:28:19,225 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:28:19,226 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:28:19,227 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b38aa6c-297b-4e24-bc08-dc9efc92c095/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/blockchain_state/balance_receive_5.sol_1_no_adts_000.smt2
[2025-05-07 17:28:19,228 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:28:19,230 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:28:19,458 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b38aa6c-297b-4e24-bc08-dc9efc92c095/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/blockchain_state/balance_receive_5.sol_1_no_adts_000.smt2
[2025-05-07 17:28:19,461 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:28:19,462 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:28:19,463 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:28:19,463 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:28:19,463 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:28:19,465 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:19" (1/1) ...
[2025-05-07 17:28:19,493 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:19 Unit
[2025-05-07 17:28:19,493 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:28:19,494 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:28:19,494 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:28:19,494 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:28:19,505 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:19" (1/1) ...
[2025-05-07 17:28:19,505 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:19" (1/1) ...
[2025-05-07 17:28:19,526 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:19" (1/1) ...
[2025-05-07 17:28:19,526 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:19" (1/1) ...
[2025-05-07 17:28:19,530 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:19" (1/1) ...
[2025-05-07 17:28:19,531 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:19" (1/1) ...
[2025-05-07 17:28:19,532 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:19" (1/1) ...
[2025-05-07 17:28:19,534 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:19" (1/1) ...
[2025-05-07 17:28:19,535 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:19" (1/1) ...
[2025-05-07 17:28:19,545 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:28:19,546 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:28:19,546 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:28:19,546 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:28:19,546 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:19" (1/1) ...
[2025-05-07 17:28:19,548 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:19,557 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:19,566 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:28:19,568 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:28:19,575 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:28:19,575 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:28:19,575 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:28:19,575 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_5_0 given in one single declaration
[2025-05-07 17:28:19,575 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_5_0
[2025-05-07 17:28:19,575 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_5_0
[2025-05-07 17:28:19,575 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_0_C_38_0 given in one single declaration
[2025-05-07 17:28:19,575 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_0_C_38_0
[2025-05-07 17:28:19,575 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_0_C_38_0
[2025-05-07 17:28:19,575 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_4_function_f__13_38_0 given in one single declaration
[2025-05-07 17:28:19,576 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_4_function_f__13_38_0
[2025-05-07 17:28:19,576 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_4_function_f__13_38_0
[2025-05-07 17:28:19,576 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_3_function_f__13_38_0 given in one single declaration
[2025-05-07 17:28:19,576 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_3_function_f__13_38_0
[2025-05-07 17:28:19,576 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_3_function_f__13_38_0
[2025-05-07 17:28:19,576 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_9_return_function_f__13_38_0 given in one single declaration
[2025-05-07 17:28:19,576 INFO  L130     BoogieDeclarations]: Found specification of procedure block_9_return_function_f__13_38_0
[2025-05-07 17:28:19,576 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_9_return_function_f__13_38_0
[2025-05-07 17:28:19,576 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_8_f_12_38_0 given in one single declaration
[2025-05-07 17:28:19,576 INFO  L130     BoogieDeclarations]: Found specification of procedure block_8_f_12_38_0
[2025-05-07 17:28:19,576 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_8_f_12_38_0
[2025-05-07 17:28:19,576 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_7_function_f__13_38_0 given in one single declaration
[2025-05-07 17:28:19,576 INFO  L130     BoogieDeclarations]: Found specification of procedure block_7_function_f__13_38_0
[2025-05-07 17:28:19,576 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_7_function_f__13_38_0
[2025-05-07 17:28:19,576 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_10_function_f__13_38_0 given in one single declaration
[2025-05-07 17:28:19,576 INFO  L130     BoogieDeclarations]: Found specification of procedure block_10_function_f__13_38_0
[2025-05-07 17:28:19,576 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_10_function_f__13_38_0
[2025-05-07 17:28:19,576 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_2_C_38_0 given in one single declaration
[2025-05-07 17:28:19,576 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_2_C_38_0
[2025-05-07 17:28:19,577 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_2_C_38_0
[2025-05-07 17:28:19,577 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_17_C_38_0 given in one single declaration
[2025-05-07 17:28:19,577 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_17_C_38_0
[2025-05-07 17:28:19,577 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_17_C_38_0
[2025-05-07 17:28:19,577 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_19_C_38_0 given in one single declaration
[2025-05-07 17:28:19,577 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_19_C_38_0
[2025-05-07 17:28:19,577 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_19_C_38_0
[2025-05-07 17:28:19,577 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_18_C_38_0 given in one single declaration
[2025-05-07 17:28:19,577 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_18_C_38_0
[2025-05-07 17:28:19,577 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_18_C_38_0
[2025-05-07 17:28:19,577 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_20_C_38_0 given in one single declaration
[2025-05-07 17:28:19,577 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_20_C_38_0
[2025-05-07 17:28:19,577 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_20_C_38_0
[2025-05-07 17:28:19,577 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_6_function_inv__37_38_0 given in one single declaration
[2025-05-07 17:28:19,577 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_6_function_inv__37_38_0
[2025-05-07 17:28:19,577 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_6_function_inv__37_38_0
[2025-05-07 17:28:19,577 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_16_function_inv__37_38_0 given in one single declaration
[2025-05-07 17:28:19,577 INFO  L130     BoogieDeclarations]: Found specification of procedure block_16_function_inv__37_38_0
[2025-05-07 17:28:19,577 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_16_function_inv__37_38_0
[2025-05-07 17:28:19,577 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_5_function_inv__37_38_0 given in one single declaration
[2025-05-07 17:28:19,577 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_5_function_inv__37_38_0
[2025-05-07 17:28:19,577 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_5_function_inv__37_38_0
[2025-05-07 17:28:19,578 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_13_return_function_inv__37_38_0 given in one single declaration
[2025-05-07 17:28:19,578 INFO  L130     BoogieDeclarations]: Found specification of procedure block_13_return_function_inv__37_38_0
[2025-05-07 17:28:19,578 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_13_return_function_inv__37_38_0
[2025-05-07 17:28:19,578 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_12_inv_36_38_0 given in one single declaration
[2025-05-07 17:28:19,578 INFO  L130     BoogieDeclarations]: Found specification of procedure block_12_inv_36_38_0
[2025-05-07 17:28:19,578 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_12_inv_36_38_0
[2025-05-07 17:28:19,578 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_11_function_inv__37_38_0 given in one single declaration
[2025-05-07 17:28:19,578 INFO  L130     BoogieDeclarations]: Found specification of procedure block_11_function_inv__37_38_0
[2025-05-07 17:28:19,578 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_11_function_inv__37_38_0
[2025-05-07 17:28:19,578 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_14_function_inv__37_38_0 given in one single declaration
[2025-05-07 17:28:19,578 INFO  L130     BoogieDeclarations]: Found specification of procedure block_14_function_inv__37_38_0
[2025-05-07 17:28:19,578 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_14_function_inv__37_38_0
[2025-05-07 17:28:19,578 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_15_function_inv__37_38_0 given in one single declaration
[2025-05-07 17:28:19,578 INFO  L130     BoogieDeclarations]: Found specification of procedure block_15_function_inv__37_38_0
[2025-05-07 17:28:19,578 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_15_function_inv__37_38_0
[2025-05-07 17:28:19,578 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:28:19,578 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:28:19,578 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:28:19,686 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:28:19,688 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:28:19,876 INFO  L?                        ?]: Removed 189 outVars from TransFormulas that were not future-live.
[2025-05-07 17:28:19,876 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:28:19,884 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:28:19,884 INFO  L312             CfgBuilder]: Removed 10 assume(true) statements.
[2025-05-07 17:28:19,884 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:19 BoogieIcfgContainer
[2025-05-07 17:28:19,884 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:28:19,886 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:28:19,886 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:28:19,888 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:28:19,889 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:19" (1/3) ...
[2025-05-07 17:28:19,889 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44395818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:28:19, skipping insertion in model container
[2025-05-07 17:28:19,889 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:19" (2/3) ...
[2025-05-07 17:28:19,889 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44395818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:28:19, skipping insertion in model container
[2025-05-07 17:28:19,889 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:19" (3/3) ...
[2025-05-07 17:28:19,890 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:28:19,900 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:28:19,902 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 23 procedures, 89 locations, 129 edges, 23 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:28:19,931 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:28:19,939 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;@7b5b2db9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:28:19,939 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:28:19,942 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 89 states, 38 states have (on average 1.105263157894737) internal successors, (42), 42 states have internal predecessors, (42), 27 states have call successors, (29), 22 states have call predecessors, (29), 22 states have return successors, (29), 24 states have call predecessors, (29), 27 states have call successors, (29)
[2025-05-07 17:28:19,948 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2025-05-07 17:28:19,949 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:19,949 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]
[2025-05-07 17:28:19,949 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:19,952 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:19,953 INFO  L85        PathProgramCache]: Analyzing trace with hash 1361056813, now seen corresponding path program 1 times
[2025-05-07 17:28:19,958 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:19,958 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942645285]
[2025-05-07 17:28:19,958 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:19,959 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:19,998 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-05-07 17:28:20,055 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-05-07 17:28:20,056 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:20,056 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:20,239 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:28:20,239 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:20,239 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942645285]
[2025-05-07 17:28:20,240 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942645285] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:20,240 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:20,242 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:20,243 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21105018]
[2025-05-07 17:28:20,243 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:20,246 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:20,246 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:20,263 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:20,263 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:20,265 INFO  L87              Difference]: Start difference. First operand  has 89 states, 38 states have (on average 1.105263157894737) internal successors, (42), 42 states have internal predecessors, (42), 27 states have call successors, (29), 22 states have call predecessors, (29), 22 states have return successors, (29), 24 states have call predecessors, (29), 27 states have call successors, (29) Second operand  has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 5 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14)
[2025-05-07 17:28:20,334 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:20,335 INFO  L93              Difference]: Finished difference Result 92 states and 104 transitions.
[2025-05-07 17:28:20,336 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:20,338 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 5 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 52
[2025-05-07 17:28:20,338 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:20,344 INFO  L225             Difference]: With dead ends: 92
[2025-05-07 17:28:20,345 INFO  L226             Difference]: Without dead ends: 92
[2025-05-07 17:28:20,346 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:28:20,349 INFO  L437           NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:20,350 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 478 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:20,362 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-05-07 17:28:20,385 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2025-05-07 17:28:20,386 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 42 states have internal predecessors, (42), 28 states have call successors, (30), 22 states have call predecessors, (30), 24 states have return successors, (32), 27 states have call predecessors, (32), 28 states have call successors, (32)
[2025-05-07 17:28:20,390 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions.
[2025-05-07 17:28:20,390 INFO  L79                 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 52
[2025-05-07 17:28:20,391 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:20,391 INFO  L485      AbstractCegarLoop]: Abstraction has 92 states and 104 transitions.
[2025-05-07 17:28:20,391 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 5 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14)
[2025-05-07 17:28:20,391 INFO  L278                IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions.
[2025-05-07 17:28:20,393 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2025-05-07 17:28:20,393 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:20,393 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]
[2025-05-07 17:28:20,394 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:28:20,394 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:20,394 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:20,394 INFO  L85        PathProgramCache]: Analyzing trace with hash 1815543299, now seen corresponding path program 1 times
[2025-05-07 17:28:20,394 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:20,394 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556708472]
[2025-05-07 17:28:20,395 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:20,395 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:20,424 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-05-07 17:28:20,450 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-05-07 17:28:20,450 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:20,450 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:20,877 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:28:20,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:20,877 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556708472]
[2025-05-07 17:28:20,877 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556708472] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:20,877 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:20,877 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:28:20,877 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124514327]
[2025-05-07 17:28:20,877 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:20,878 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:28:20,878 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:20,879 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:28:20,879 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:20,879 INFO  L87              Difference]: Start difference. First operand 92 states and 104 transitions. Second operand  has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 8 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14)
[2025-05-07 17:28:21,094 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:21,094 INFO  L93              Difference]: Finished difference Result 102 states and 119 transitions.
[2025-05-07 17:28:21,094 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:28:21,094 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 8 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) Word has length 52
[2025-05-07 17:28:21,095 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:21,095 INFO  L225             Difference]: With dead ends: 102
[2025-05-07 17:28:21,096 INFO  L226             Difference]: Without dead ends: 102
[2025-05-07 17:28:21,096 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272
[2025-05-07 17:28:21,096 INFO  L437           NwaCegarLoop]: 87 mSDtfsCounter, 5 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:21,096 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1095 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:21,097 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2025-05-07 17:28:21,103 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100.
[2025-05-07 17:28:21,104 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 100 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 45 states have internal predecessors, (45), 30 states have call successors, (32), 22 states have call predecessors, (32), 27 states have return successors, (40), 32 states have call predecessors, (40), 30 states have call successors, (40)
[2025-05-07 17:28:21,105 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions.
[2025-05-07 17:28:21,105 INFO  L79                 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 52
[2025-05-07 17:28:21,105 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:21,105 INFO  L485      AbstractCegarLoop]: Abstraction has 100 states and 117 transitions.
[2025-05-07 17:28:21,105 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 8 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14)
[2025-05-07 17:28:21,105 INFO  L278                IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions.
[2025-05-07 17:28:21,106 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2025-05-07 17:28:21,106 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:21,106 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]
[2025-05-07 17:28:21,106 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:28:21,106 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:21,107 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:21,107 INFO  L85        PathProgramCache]: Analyzing trace with hash -765461053, now seen corresponding path program 1 times
[2025-05-07 17:28:21,107 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:21,107 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111032057]
[2025-05-07 17:28:21,107 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:21,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:21,123 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-05-07 17:28:21,131 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-05-07 17:28:21,132 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:21,132 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:21,209 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:28:21,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:21,209 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111032057]
[2025-05-07 17:28:21,209 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111032057] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:21,209 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:21,209 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:28:21,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180706392]
[2025-05-07 17:28:21,210 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:21,210 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:28:21,210 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:21,210 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:28:21,210 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:28:21,210 INFO  L87              Difference]: Start difference. First operand 100 states and 117 transitions. Second operand  has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:28:21,231 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:21,232 INFO  L93              Difference]: Finished difference Result 102 states and 118 transitions.
[2025-05-07 17:28:21,232 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:28:21,232 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 52
[2025-05-07 17:28:21,232 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:21,233 INFO  L225             Difference]: With dead ends: 102
[2025-05-07 17:28:21,233 INFO  L226             Difference]: Without dead ends: 98
[2025-05-07 17:28:21,233 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:28:21,234 INFO  L437           NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:21,234 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 365 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:21,234 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2025-05-07 17:28:21,240 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98.
[2025-05-07 17:28:21,240 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 44 states have internal predecessors, (44), 28 states have call successors, (30), 22 states have call predecessors, (30), 27 states have return successors, (38), 31 states have call predecessors, (38), 28 states have call successors, (38)
[2025-05-07 17:28:21,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions.
[2025-05-07 17:28:21,241 INFO  L79                 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 52
[2025-05-07 17:28:21,241 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:21,241 INFO  L485      AbstractCegarLoop]: Abstraction has 98 states and 112 transitions.
[2025-05-07 17:28:21,241 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:28:21,242 INFO  L278                IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions.
[2025-05-07 17:28:21,242 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2025-05-07 17:28:21,242 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:21,243 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]
[2025-05-07 17:28:21,243 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:28:21,243 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:21,243 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:21,243 INFO  L85        PathProgramCache]: Analyzing trace with hash 797416007, now seen corresponding path program 1 times
[2025-05-07 17:28:21,243 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:21,243 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728428300]
[2025-05-07 17:28:21,243 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:21,243 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:21,258 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-05-07 17:28:21,267 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-05-07 17:28:21,267 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:21,267 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:21,368 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:28:21,368 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:21,368 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728428300]
[2025-05-07 17:28:21,368 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728428300] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:21,368 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:21,368 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:28:21,369 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382224289]
[2025-05-07 17:28:21,369 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:21,369 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:28:21,369 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:21,370 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:28:21,370 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:28:21,370 INFO  L87              Difference]: Start difference. First operand 98 states and 112 transitions. Second operand  has 8 states, 6 states have (on average 4.0) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14)
[2025-05-07 17:28:21,433 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:21,433 INFO  L93              Difference]: Finished difference Result 97 states and 108 transitions.
[2025-05-07 17:28:21,434 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:28:21,434 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 4.0) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 52
[2025-05-07 17:28:21,434 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:21,435 INFO  L225             Difference]: With dead ends: 97
[2025-05-07 17:28:21,435 INFO  L226             Difference]: Without dead ends: 97
[2025-05-07 17:28:21,435 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-05-07 17:28:21,435 INFO  L437           NwaCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:21,436 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 598 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:21,436 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2025-05-07 17:28:21,439 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92.
[2025-05-07 17:28:21,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 26 states have call successors, (28), 22 states have call predecessors, (28), 25 states have return successors, (32), 27 states have call predecessors, (32), 26 states have call successors, (32)
[2025-05-07 17:28:21,440 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions.
[2025-05-07 17:28:21,440 INFO  L79                 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 52
[2025-05-07 17:28:21,440 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:21,440 INFO  L485      AbstractCegarLoop]: Abstraction has 92 states and 102 transitions.
[2025-05-07 17:28:21,441 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 4.0) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14)
[2025-05-07 17:28:21,441 INFO  L278                IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions.
[2025-05-07 17:28:21,442 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-05-07 17:28:21,442 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:21,442 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:21,442 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:28:21,442 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:21,442 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:21,442 INFO  L85        PathProgramCache]: Analyzing trace with hash -5954534, now seen corresponding path program 1 times
[2025-05-07 17:28:21,442 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:21,442 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451405674]
[2025-05-07 17:28:21,442 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:21,442 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:21,477 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-05-07 17:28:21,488 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-05-07 17:28:21,488 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:21,488 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:21,608 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2025-05-07 17:28:21,608 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:21,608 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451405674]
[2025-05-07 17:28:21,608 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451405674] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:21,608 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405577321]
[2025-05-07 17:28:21,608 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:21,608 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:21,610 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:21,612 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:21,613 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:28:21,808 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-05-07 17:28:21,932 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-05-07 17:28:21,932 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:21,932 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:21,936 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:21,942 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:22,010 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-05-07 17:28:22,010 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:28:22,010 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405577321] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:22,011 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:28:22,011 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11
[2025-05-07 17:28:22,011 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916398357]
[2025-05-07 17:28:22,011 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:22,011 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:22,011 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:22,011 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:22,011 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:28:22,012 INFO  L87              Difference]: Start difference. First operand 92 states and 102 transitions. Second operand  has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 5 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20)
[2025-05-07 17:28:22,039 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:22,039 INFO  L93              Difference]: Finished difference Result 97 states and 107 transitions.
[2025-05-07 17:28:22,040 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:22,040 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 5 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 77
[2025-05-07 17:28:22,040 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:22,041 INFO  L225             Difference]: With dead ends: 97
[2025-05-07 17:28:22,041 INFO  L226             Difference]: Without dead ends: 88
[2025-05-07 17:28:22,041 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:28:22,041 INFO  L437           NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:22,042 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 461 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:22,042 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2025-05-07 17:28:22,045 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88.
[2025-05-07 17:28:22,045 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 88 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 40 states have internal predecessors, (40), 25 states have call successors, (26), 21 states have call predecessors, (26), 24 states have return successors, (30), 26 states have call predecessors, (30), 25 states have call successors, (30)
[2025-05-07 17:28:22,046 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions.
[2025-05-07 17:28:22,046 INFO  L79                 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 77
[2025-05-07 17:28:22,046 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:22,046 INFO  L485      AbstractCegarLoop]: Abstraction has 88 states and 96 transitions.
[2025-05-07 17:28:22,046 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 5 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20)
[2025-05-07 17:28:22,046 INFO  L278                IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions.
[2025-05-07 17:28:22,047 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-05-07 17:28:22,047 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:22,047 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:22,052 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:28:22,248 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2025-05-07 17:28:22,249 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:22,250 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:22,251 INFO  L85        PathProgramCache]: Analyzing trace with hash -1331105680, now seen corresponding path program 1 times
[2025-05-07 17:28:22,251 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:22,251 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570526316]
[2025-05-07 17:28:22,251 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:22,251 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:22,354 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-05-07 17:28:22,380 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-05-07 17:28:22,380 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:22,381 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:22,513 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-05-07 17:28:22,513 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:22,513 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570526316]
[2025-05-07 17:28:22,514 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570526316] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:22,514 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207121733]
[2025-05-07 17:28:22,514 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:22,514 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:22,516 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:22,517 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:22,518 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-05-07 17:28:22,714 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-05-07 17:28:22,821 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-05-07 17:28:22,821 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:22,821 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:22,826 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:22,830 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:22,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-05-07 17:28:22,876 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:28:22,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207121733] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:22,876 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:28:22,876 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11
[2025-05-07 17:28:22,876 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177003541]
[2025-05-07 17:28:22,876 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:22,877 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:22,877 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:22,877 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:22,877 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:28:22,877 INFO  L87              Difference]: Start difference. First operand 88 states and 96 transitions. Second operand  has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 5 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20)
[2025-05-07 17:28:22,905 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:22,905 INFO  L93              Difference]: Finished difference Result 88 states and 95 transitions.
[2025-05-07 17:28:22,905 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:22,905 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 5 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 77
[2025-05-07 17:28:22,906 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:22,906 INFO  L225             Difference]: With dead ends: 88
[2025-05-07 17:28:22,906 INFO  L226             Difference]: Without dead ends: 88
[2025-05-07 17:28:22,907 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:28:22,907 INFO  L437           NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:22,908 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 426 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:22,908 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2025-05-07 17:28:22,913 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88.
[2025-05-07 17:28:22,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 88 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 40 states have internal predecessors, (40), 25 states have call successors, (26), 21 states have call predecessors, (26), 24 states have return successors, (29), 26 states have call predecessors, (29), 25 states have call successors, (29)
[2025-05-07 17:28:22,914 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions.
[2025-05-07 17:28:22,914 INFO  L79                 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 77
[2025-05-07 17:28:22,914 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:22,914 INFO  L485      AbstractCegarLoop]: Abstraction has 88 states and 95 transitions.
[2025-05-07 17:28:22,915 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 5 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20)
[2025-05-07 17:28:22,915 INFO  L278                IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions.
[2025-05-07 17:28:22,916 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-05-07 17:28:22,916 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:22,916 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:22,921 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-05-07 17:28:23,116 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:23,116 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:23,117 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:23,117 INFO  L85        PathProgramCache]: Analyzing trace with hash -498889804, now seen corresponding path program 1 times
[2025-05-07 17:28:23,117 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:23,117 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627312006]
[2025-05-07 17:28:23,117 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:23,117 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:23,146 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-05-07 17:28:23,162 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-05-07 17:28:23,162 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:23,162 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:23,611 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-05-07 17:28:23,612 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:23,612 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627312006]
[2025-05-07 17:28:23,612 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627312006] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:23,612 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141247148]
[2025-05-07 17:28:23,612 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:23,612 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:23,615 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:23,616 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:23,617 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-05-07 17:28:23,817 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-05-07 17:28:23,920 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-05-07 17:28:23,920 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:23,920 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:23,925 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 32 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:23,928 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:24,172 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-05-07 17:28:24,172 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:26,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-05-07 17:28:26,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141247148] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:28:26,984 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:28:26,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 20] total 45
[2025-05-07 17:28:26,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806966374]
[2025-05-07 17:28:26,984 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:26,985 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 45 states
[2025-05-07 17:28:26,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:26,985 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants.
[2025-05-07 17:28:26,986 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1839, Unknown=0, NotChecked=0, Total=1980
[2025-05-07 17:28:26,986 INFO  L87              Difference]: Start difference. First operand 88 states and 95 transitions. Second operand  has 45 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 40 states have internal predecessors, (58), 28 states have call successors, (37), 1 states have call predecessors, (37), 30 states have return successors, (50), 35 states have call predecessors, (50), 28 states have call successors, (50)
[2025-05-07 17:28:27,319 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:27,320 INFO  L93              Difference]: Finished difference Result 92 states and 102 transitions.
[2025-05-07 17:28:27,320 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2025-05-07 17:28:27,320 INFO  L79                 Accepts]: Start accepts. Automaton has  has 45 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 40 states have internal predecessors, (58), 28 states have call successors, (37), 1 states have call predecessors, (37), 30 states have return successors, (50), 35 states have call predecessors, (50), 28 states have call successors, (50) Word has length 77
[2025-05-07 17:28:27,320 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:27,321 INFO  L225             Difference]: With dead ends: 92
[2025-05-07 17:28:27,321 INFO  L226             Difference]: Without dead ends: 92
[2025-05-07 17:28:27,322 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 125 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=2268, Unknown=0, NotChecked=0, Total=2450
[2025-05-07 17:28:27,322 INFO  L437           NwaCegarLoop]: 80 mSDtfsCounter, 13 mSDsluCounter, 2272 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:27,322 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2352 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:27,323 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-05-07 17:28:27,325 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88.
[2025-05-07 17:28:27,326 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 88 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 40 states have internal predecessors, (40), 25 states have call successors, (26), 21 states have call predecessors, (26), 24 states have return successors, (29), 26 states have call predecessors, (29), 25 states have call successors, (29)
[2025-05-07 17:28:27,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions.
[2025-05-07 17:28:27,326 INFO  L79                 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 77
[2025-05-07 17:28:27,326 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:27,326 INFO  L485      AbstractCegarLoop]: Abstraction has 88 states and 95 transitions.
[2025-05-07 17:28:27,327 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 45 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 40 states have internal predecessors, (58), 28 states have call successors, (37), 1 states have call predecessors, (37), 30 states have return successors, (50), 35 states have call predecessors, (50), 28 states have call successors, (50)
[2025-05-07 17:28:27,327 INFO  L278                IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions.
[2025-05-07 17:28:27,327 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-05-07 17:28:27,327 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:27,327 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:27,332 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-05-07 17:28:27,528 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:27,528 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:27,529 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:27,529 INFO  L85        PathProgramCache]: Analyzing trace with hash 2091995426, now seen corresponding path program 1 times
[2025-05-07 17:28:27,530 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:27,530 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092910132]
[2025-05-07 17:28:27,530 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:27,530 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:27,600 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-05-07 17:28:27,620 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-05-07 17:28:27,620 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:27,620 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:28,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:28:28,792 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:28,792 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092910132]
[2025-05-07 17:28:28,792 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092910132] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:28,792 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620777432]
[2025-05-07 17:28:28,792 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:28,792 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:28,794 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:28,795 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:28,796 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-05-07 17:28:28,966 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-05-07 17:28:29,044 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-05-07 17:28:29,045 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:29,045 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:29,049 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 96 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:29,053 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:29,517 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2025-05-07 17:28:29,521 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:28:29,521 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:28:29,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [620777432] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:29,521 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:28:29,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [28] total 40
[2025-05-07 17:28:29,521 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129206510]
[2025-05-07 17:28:29,521 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:29,522 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2025-05-07 17:28:29,522 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:29,522 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2025-05-07 17:28:29,523 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1466, Unknown=0, NotChecked=0, Total=1560
[2025-05-07 17:28:29,523 INFO  L87              Difference]: Start difference. First operand 88 states and 95 transitions. Second operand  has 24 states, 16 states have (on average 2.125) internal successors, (34), 21 states have internal predecessors, (34), 12 states have call successors, (21), 1 states have call predecessors, (21), 16 states have return successors, (21), 17 states have call predecessors, (21), 12 states have call successors, (21)
[2025-05-07 17:28:29,940 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:29,940 INFO  L93              Difference]: Finished difference Result 93 states and 103 transitions.
[2025-05-07 17:28:29,941 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-05-07 17:28:29,941 INFO  L79                 Accepts]: Start accepts. Automaton has  has 24 states, 16 states have (on average 2.125) internal successors, (34), 21 states have internal predecessors, (34), 12 states have call successors, (21), 1 states have call predecessors, (21), 16 states have return successors, (21), 17 states have call predecessors, (21), 12 states have call successors, (21) Word has length 77
[2025-05-07 17:28:29,941 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:29,942 INFO  L225             Difference]: With dead ends: 93
[2025-05-07 17:28:29,942 INFO  L226             Difference]: Without dead ends: 93
[2025-05-07 17:28:29,943 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=1951, Unknown=0, NotChecked=0, Total=2070
[2025-05-07 17:28:29,943 INFO  L437           NwaCegarLoop]: 71 mSDtfsCounter, 8 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:29,944 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1496 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:28:29,944 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2025-05-07 17:28:29,947 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93.
[2025-05-07 17:28:29,947 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 93 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 26 states have call successors, (27), 21 states have call predecessors, (27), 26 states have return successors, (34), 29 states have call predecessors, (34), 26 states have call successors, (34)
[2025-05-07 17:28:29,947 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions.
[2025-05-07 17:28:29,947 INFO  L79                 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 77
[2025-05-07 17:28:29,948 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:29,948 INFO  L485      AbstractCegarLoop]: Abstraction has 93 states and 103 transitions.
[2025-05-07 17:28:29,948 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 16 states have (on average 2.125) internal successors, (34), 21 states have internal predecessors, (34), 12 states have call successors, (21), 1 states have call predecessors, (21), 16 states have return successors, (21), 17 states have call predecessors, (21), 12 states have call successors, (21)
[2025-05-07 17:28:29,948 INFO  L278                IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions.
[2025-05-07 17:28:29,948 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:28:29,948 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:29,949 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:29,953 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-05-07 17:28:30,149 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:30,150 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:30,151 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:30,151 INFO  L85        PathProgramCache]: Analyzing trace with hash 146058763, now seen corresponding path program 1 times
[2025-05-07 17:28:30,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:30,151 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993439241]
[2025-05-07 17:28:30,152 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:30,152 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:30,239 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:28:30,251 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:28:30,251 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:30,251 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:31,617 INFO  L134       CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-05-07 17:28:31,617 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:31,617 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993439241]
[2025-05-07 17:28:31,617 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993439241] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:31,617 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95229698]
[2025-05-07 17:28:31,617 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:31,617 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:31,618 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:31,620 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:31,621 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-05-07 17:28:31,819 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:28:31,921 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:28:31,921 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:31,921 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:31,927 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1397 conjuncts, 107 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:31,931 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:32,102 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2025-05-07 17:28:32,746 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11
[2025-05-07 17:28:32,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-05-07 17:28:32,751 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:39,345 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1
[2025-05-07 17:28:40,133 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22
[2025-05-07 17:28:40,566 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [95229698] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:40,566 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-05-07 17:28:40,567 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28] total 51
[2025-05-07 17:28:40,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120851376]
[2025-05-07 17:28:40,567 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:40,567 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 51 states
[2025-05-07 17:28:40,567 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:40,568 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants.
[2025-05-07 17:28:40,569 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=3042, Unknown=0, NotChecked=0, Total=3192
[2025-05-07 17:28:40,569 INFO  L87              Difference]: Start difference. First operand 93 states and 103 transitions. Second operand  has 51 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 44 states have internal predecessors, (65), 29 states have call successors, (41), 1 states have call predecessors, (41), 33 states have return successors, (50), 41 states have call predecessors, (50), 29 states have call successors, (50)
[2025-05-07 17:28:41,425 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:41,425 INFO  L93              Difference]: Finished difference Result 98 states and 112 transitions.
[2025-05-07 17:28:41,426 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2025-05-07 17:28:41,426 INFO  L79                 Accepts]: Start accepts. Automaton has  has 51 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 44 states have internal predecessors, (65), 29 states have call successors, (41), 1 states have call predecessors, (41), 33 states have return successors, (50), 41 states have call predecessors, (50), 29 states have call successors, (50) Word has length 102
[2025-05-07 17:28:41,426 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:41,427 INFO  L225             Difference]: With dead ends: 98
[2025-05-07 17:28:41,427 INFO  L226             Difference]: Without dead ends: 98
[2025-05-07 17:28:41,428 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=233, Invalid=4459, Unknown=0, NotChecked=0, Total=4692
[2025-05-07 17:28:41,428 INFO  L437           NwaCegarLoop]: 77 mSDtfsCounter, 23 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:41,428 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2605 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-05-07 17:28:41,428 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2025-05-07 17:28:41,431 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96.
[2025-05-07 17:28:41,432 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 41 states have (on average 1.048780487804878) internal successors, (43), 43 states have internal predecessors, (43), 27 states have call successors, (28), 21 states have call predecessors, (28), 27 states have return successors, (37), 31 states have call predecessors, (37), 27 states have call successors, (37)
[2025-05-07 17:28:41,432 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions.
[2025-05-07 17:28:41,432 INFO  L79                 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 102
[2025-05-07 17:28:41,432 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:41,432 INFO  L485      AbstractCegarLoop]: Abstraction has 96 states and 108 transitions.
[2025-05-07 17:28:41,433 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 51 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 44 states have internal predecessors, (65), 29 states have call successors, (41), 1 states have call predecessors, (41), 33 states have return successors, (50), 41 states have call predecessors, (50), 29 states have call successors, (50)
[2025-05-07 17:28:41,433 INFO  L278                IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions.
[2025-05-07 17:28:41,433 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2025-05-07 17:28:41,433 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:41,433 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:41,438 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-05-07 17:28:41,634 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:41,635 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:41,636 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:41,636 INFO  L85        PathProgramCache]: Analyzing trace with hash -515259716, now seen corresponding path program 2 times
[2025-05-07 17:28:41,636 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:41,636 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767786321]
[2025-05-07 17:28:41,637 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:28:41,637 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:41,745 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 127 statements into 2 equivalence classes.
[2025-05-07 17:28:41,764 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 127 of 127 statements.
[2025-05-07 17:28:41,764 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:28:41,764 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:43,912 INFO  L134       CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2025-05-07 17:28:43,912 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:43,912 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767786321]
[2025-05-07 17:28:43,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767786321] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:43,912 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358957663]
[2025-05-07 17:28:43,912 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:28:43,913 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:43,914 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:43,915 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:43,916 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-05-07 17:28:44,237 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 127 statements into 2 equivalence classes.
[2025-05-07 17:28:44,377 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 127 of 127 statements.
[2025-05-07 17:28:44,377 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:28:44,377 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:44,384 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1773 conjuncts, 156 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:44,389 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:44,934 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9
[2025-05-07 17:28:45,206 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2025-05-07 17:28:45,211 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9
[2025-05-07 17:28:45,215 INFO  L134       CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked.
[2025-05-07 17:28:45,215 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:58,424 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1
[2025-05-07 17:29:01,073 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1
[2025-05-07 17:29:01,832 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22
[2025-05-07 17:29:02,177 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [358957663] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:02,177 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-05-07 17:29:02,177 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 28] total 58
[2025-05-07 17:29:02,177 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752678780]
[2025-05-07 17:29:02,178 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:29:02,178 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 58 states
[2025-05-07 17:29:02,178 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:02,178 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants.
[2025-05-07 17:29:02,179 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=3997, Unknown=0, NotChecked=0, Total=4160
[2025-05-07 17:29:02,179 INFO  L87              Difference]: Start difference. First operand 96 states and 108 transitions. Second operand  has 58 states, 38 states have (on average 1.868421052631579) internal successors, (71), 48 states have internal predecessors, (71), 30 states have call successors, (43), 1 states have call predecessors, (43), 38 states have return successors, (58), 47 states have call predecessors, (58), 30 states have call successors, (58)
[2025-05-07 17:29:03,337 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:03,337 INFO  L93              Difference]: Finished difference Result 95 states and 110 transitions.
[2025-05-07 17:29:03,337 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2025-05-07 17:29:03,337 INFO  L79                 Accepts]: Start accepts. Automaton has  has 58 states, 38 states have (on average 1.868421052631579) internal successors, (71), 48 states have internal predecessors, (71), 30 states have call successors, (43), 1 states have call predecessors, (43), 38 states have return successors, (58), 47 states have call predecessors, (58), 30 states have call successors, (58) Word has length 127
[2025-05-07 17:29:03,338 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:03,338 INFO  L225             Difference]: With dead ends: 95
[2025-05-07 17:29:03,338 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:29:03,339 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=293, Invalid=6679, Unknown=0, NotChecked=0, Total=6972
[2025-05-07 17:29:03,339 INFO  L437           NwaCegarLoop]: 69 mSDtfsCounter, 23 mSDsluCounter, 2967 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3036 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:03,339 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3036 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-05-07 17:29:03,339 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:29:03,339 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:29:03,340 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-05-07 17:29:03,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:29:03,340 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127
[2025-05-07 17:29:03,340 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:03,340 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:29:03,340 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 58 states, 38 states have (on average 1.868421052631579) internal successors, (71), 48 states have internal predecessors, (71), 30 states have call successors, (43), 1 states have call predecessors, (43), 38 states have return successors, (58), 47 states have call predecessors, (58), 30 states have call successors, (58)
[2025-05-07 17:29:03,340 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:29:03,340 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:29:03,342 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:29:03,348 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-05-07 17:29:03,543 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:03,551 INFO  L422         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:03,557 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:29:03,564 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:29:03 BoogieIcfgContainer
[2025-05-07 17:29:03,564 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:29:03,566 INFO  L158              Benchmark]: Toolchain (without parser) took 44102.92ms. Allocated memory was 234.9MB in the beginning and 570.4MB in the end (delta: 335.5MB). Free memory was 151.7MB in the beginning and 484.4MB in the end (delta: -332.7MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:03,566 INFO  L158              Benchmark]: SmtParser took 0.29ms. Allocated memory is still 234.9MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:03,567 INFO  L158              Benchmark]: ChcToBoogie took 30.71ms. Allocated memory is still 234.9MB. Free memory was 151.7MB in the beginning and 149.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:03,567 INFO  L158              Benchmark]: Boogie Preprocessor took 51.68ms. Allocated memory is still 234.9MB. Free memory was 149.1MB in the beginning and 146.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:03,568 INFO  L158              Benchmark]: RCFGBuilder took 338.77ms. Allocated memory is still 234.9MB. Free memory was 145.9MB in the beginning and 188.8MB in the end (delta: -42.9MB). Peak memory consumption was 25.4MB. Max. memory is 33.6GB.
[2025-05-07 17:29:03,569 INFO  L158              Benchmark]: TraceAbstraction took 43678.37ms. Allocated memory was 234.9MB in the beginning and 570.4MB in the end (delta: 335.5MB). Free memory was 188.2MB in the beginning and 484.4MB in the end (delta: -296.2MB). Peak memory consumption was 37.9MB. Max. memory is 33.6GB.
[2025-05-07 17:29:03,571 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.29ms. Allocated memory is still 234.9MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 30.71ms. Allocated memory is still 234.9MB. Free memory was 151.7MB in the beginning and 149.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 51.68ms. Allocated memory is still 234.9MB. Free memory was 149.1MB in the beginning and 146.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 338.77ms. Allocated memory is still 234.9MB. Free memory was 145.9MB in the beginning and 188.8MB in the end (delta: -42.9MB). Peak memory consumption was 25.4MB. Max. memory is 33.6GB.
 * TraceAbstraction took 43678.37ms. Allocated memory was 234.9MB in the beginning and 570.4MB in the end (delta: 335.5MB). Free memory was 188.2MB in the beginning and 484.4MB in the end (delta: -296.2MB). Peak memory consumption was 37.9MB. 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 23 procedures, 89 locations, 129 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.6s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 12912 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12061 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3369 IncrementalHoareTripleChecker+Invalid, 3447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 851 mSDtfsCounter, 3369 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 872 GetRequests, 573 SyntacticMatches, 11 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2092 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=2, InterpolantAutomatonStates: 152, 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, 10 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 36.3s InterpolantComputationTime, 1282 NumberOfCodeBlocks, 1282 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1342 ConstructedInterpolants, 0 QuantifiedInterpolants, 4290 SizeOfPredicates, 74 NumberOfNonLiveVariables, 7305 ConjunctsInSsa, 401 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 244/341 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-05-07 17:29:03,594 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
