./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/control_flow/short_circuit_or_fail.sol_0_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:27:26,741 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:27:26,791 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87edaae9-b4a7-48ab-97b9-2966b15a39db/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:27:26,795 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:27:26,795 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:27:26,814 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:27:26,815 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:27:26,815 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:27:26,815 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:27:26,815 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:27:26,816 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:27:26,816 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:27:26,816 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:27:26,816 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:27:26,816 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:27:26,816 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:27:26,816 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:27:26,816 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:27:26,816 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:27:26,817 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:27:26,817 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:27:26,817 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:27:26,817 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:27:26,817 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:27:26,817 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:27:26,818 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:27:26,818 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:27:27,013 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:27:27,021 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:27:27,023 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:27:27,024 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:27:27,024 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:27:27,025 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87edaae9-b4a7-48ab-97b9-2966b15a39db/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/control_flow/short_circuit_or_fail.sol_0_no_adts_000.smt2
[2025-05-07 17:27:27,026 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:27:27,029 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:27:27,318 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87edaae9-b4a7-48ab-97b9-2966b15a39db/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/control_flow/short_circuit_or_fail.sol_0_no_adts_000.smt2
[2025-05-07 17:27:27,320 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:27:27,321 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:27:27,322 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:27:27,322 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:27:27,322 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:27:27,324 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:27:27" (1/1) ...
[2025-05-07 17:27:27,355 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:27 Unit
[2025-05-07 17:27:27,356 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:27:27,356 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:27:27,356 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:27:27,356 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:27:27,368 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:27" (1/1) ...
[2025-05-07 17:27:27,368 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:27" (1/1) ...
[2025-05-07 17:27:27,389 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:27" (1/1) ...
[2025-05-07 17:27:27,389 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:27" (1/1) ...
[2025-05-07 17:27:27,393 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:27" (1/1) ...
[2025-05-07 17:27:27,394 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:27" (1/1) ...
[2025-05-07 17:27:27,396 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:27" (1/1) ...
[2025-05-07 17:27:27,397 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:27" (1/1) ...
[2025-05-07 17:27:27,399 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:27" (1/1) ...
[2025-05-07 17:27:27,410 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:27:27,410 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:27:27,410 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:27:27,410 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:27:27,411 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:27" (1/1) ...
[2025-05-07 17:27:27,413 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:27:27,423 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:27:27,431 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-05-07 17:27:27,434 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:27:27,445 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:27:27,445 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:27:27,445 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:27:27,445 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_4_0 given in one single declaration
[2025-05-07 17:27:27,445 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_4_0
[2025-05-07 17:27:27,445 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_4_0
[2025-05-07 17:27:27,445 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_0_c_54_0 given in one single declaration
[2025-05-07 17:27:27,445 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_0_c_54_0
[2025-05-07 17:27:27,445 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_0_c_54_0
[2025-05-07 17:27:27,446 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_2_c_54_0 given in one single declaration
[2025-05-07 17:27:27,446 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_2_c_54_0
[2025-05-07 17:27:27,446 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_2_c_54_0
[2025-05-07 17:27:27,446 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_19_c_54_0 given in one single declaration
[2025-05-07 17:27:27,446 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_19_c_54_0
[2025-05-07 17:27:27,446 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_19_c_54_0
[2025-05-07 17:27:27,446 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_21_c_54_0 given in one single declaration
[2025-05-07 17:27:27,446 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_21_c_54_0
[2025-05-07 17:27:27,446 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_21_c_54_0
[2025-05-07 17:27:27,446 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_20_c_54_0 given in one single declaration
[2025-05-07 17:27:27,446 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_20_c_54_0
[2025-05-07 17:27:27,446 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_20_c_54_0
[2025-05-07 17:27:27,446 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_22_c_54_0 given in one single declaration
[2025-05-07 17:27:27,446 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_22_c_54_0
[2025-05-07 17:27:27,446 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_22_c_54_0
[2025-05-07 17:27:27,446 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_5_function_g__53_54_0 given in one single declaration
[2025-05-07 17:27:27,446 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_5_function_g__53_54_0
[2025-05-07 17:27:27,447 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_5_function_g__53_54_0
[2025-05-07 17:27:27,447 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_18_function_g__53_54_0 given in one single declaration
[2025-05-07 17:27:27,447 INFO  L130     BoogieDeclarations]: Found specification of procedure block_18_function_g__53_54_0
[2025-05-07 17:27:27,447 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_18_function_g__53_54_0
[2025-05-07 17:27:27,447 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_4_function_g__53_54_0 given in one single declaration
[2025-05-07 17:27:27,447 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_4_function_g__53_54_0
[2025-05-07 17:27:27,447 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_4_function_g__53_54_0
[2025-05-07 17:27:27,447 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_16_function_g__53_54_0 given in one single declaration
[2025-05-07 17:27:27,447 INFO  L130     BoogieDeclarations]: Found specification of procedure block_16_function_g__53_54_0
[2025-05-07 17:27:27,447 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_16_function_g__53_54_0
[2025-05-07 17:27:27,447 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_11_g_52_54_0 given in one single declaration
[2025-05-07 17:27:27,447 INFO  L130     BoogieDeclarations]: Found specification of procedure block_11_g_52_54_0
[2025-05-07 17:27:27,447 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_11_g_52_54_0
[2025-05-07 17:27:27,447 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_10_function_g__53_54_0 given in one single declaration
[2025-05-07 17:27:27,447 INFO  L130     BoogieDeclarations]: Found specification of procedure block_10_function_g__53_54_0
[2025-05-07 17:27:27,447 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_10_function_g__53_54_0
[2025-05-07 17:27:27,447 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_13_function_f__16_54_0 given in one single declaration
[2025-05-07 17:27:27,447 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_13_function_f__16_54_0
[2025-05-07 17:27:27,447 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_13_function_f__16_54_0
[2025-05-07 17:27:27,448 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_3_function_f__16_54_0 given in one single declaration
[2025-05-07 17:27:27,448 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_3_function_f__16_54_0
[2025-05-07 17:27:27,448 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_3_function_f__16_54_0
[2025-05-07 17:27:27,448 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_8_return_function_f__16_54_0 given in one single declaration
[2025-05-07 17:27:27,448 INFO  L130     BoogieDeclarations]: Found specification of procedure block_8_return_function_f__16_54_0
[2025-05-07 17:27:27,448 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_8_return_function_f__16_54_0
[2025-05-07 17:27:27,448 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_7_f_15_54_0 given in one single declaration
[2025-05-07 17:27:27,448 INFO  L130     BoogieDeclarations]: Found specification of procedure block_7_f_15_54_0
[2025-05-07 17:27:27,448 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_7_f_15_54_0
[2025-05-07 17:27:27,448 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_6_function_f__16_54_0 given in one single declaration
[2025-05-07 17:27:27,448 INFO  L130     BoogieDeclarations]: Found specification of procedure block_6_function_f__16_54_0
[2025-05-07 17:27:27,448 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_6_function_f__16_54_0
[2025-05-07 17:27:27,448 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_14_function_f__16_54_0 given in one single declaration
[2025-05-07 17:27:27,448 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_14_function_f__16_54_0
[2025-05-07 17:27:27,448 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_14_function_f__16_54_0
[2025-05-07 17:27:27,448 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_15_function_g__53_54_0 given in one single declaration
[2025-05-07 17:27:27,448 INFO  L130     BoogieDeclarations]: Found specification of procedure block_15_function_g__53_54_0
[2025-05-07 17:27:27,448 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_15_function_g__53_54_0
[2025-05-07 17:27:27,448 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_12_return_function_g__53_54_0 given in one single declaration
[2025-05-07 17:27:27,449 INFO  L130     BoogieDeclarations]: Found specification of procedure block_12_return_function_g__53_54_0
[2025-05-07 17:27:27,449 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_12_return_function_g__53_54_0
[2025-05-07 17:27:27,449 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:27:27,449 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:27:27,449 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:27:27,591 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:27:27,593 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:27:27,839 INFO  L?                        ?]: Removed 208 outVars from TransFormulas that were not future-live.
[2025-05-07 17:27:27,839 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:27:27,847 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:27:27,847 INFO  L312             CfgBuilder]: Removed 12 assume(true) statements.
[2025-05-07 17:27:27,848 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:27:27 BoogieIcfgContainer
[2025-05-07 17:27:27,848 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:27:27,849 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:27:27,849 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:27:27,852 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:27:27,852 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:27:27" (1/3) ...
[2025-05-07 17:27:27,852 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747a1ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:27:27, skipping insertion in model container
[2025-05-07 17:27:27,852 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:27" (2/3) ...
[2025-05-07 17:27:27,852 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747a1ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:27:27, skipping insertion in model container
[2025-05-07 17:27:27,853 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:27:27" (3/3) ...
[2025-05-07 17:27:27,853 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:27:27,863 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:27:27,865 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 23 procedures, 96 locations, 155 edges, 23 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:27:27,894 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:27:27,905 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;@6cf6bd7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:27:27,905 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:27:27,909 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 96 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 36 states have call successors, (38), 22 states have call predecessors, (38), 22 states have return successors, (38), 32 states have call predecessors, (38), 36 states have call successors, (38)
[2025-05-07 17:27:27,919 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-05-07 17:27:27,919 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:27,920 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:27,920 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:27,924 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:27,924 INFO  L85        PathProgramCache]: Analyzing trace with hash 1164741188, now seen corresponding path program 1 times
[2025-05-07 17:27:27,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:27,930 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37900677]
[2025-05-07 17:27:27,930 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:27,930 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:27,988 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-05-07 17:27:28,051 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-05-07 17:27:28,051 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:28,051 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:28,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:27:28,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:28,391 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37900677]
[2025-05-07 17:27:28,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37900677] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:28,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:28,394 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:27:28,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309172027]
[2025-05-07 17:27:28,396 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:28,400 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:27:28,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:28,428 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:27:28,428 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:27:28,431 INFO  L87              Difference]: Start difference. First operand  has 96 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 36 states have call successors, (38), 22 states have call predecessors, (38), 22 states have return successors, (38), 32 states have call predecessors, (38), 36 states have call successors, (38) Second operand  has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (18), 1 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:27:28,496 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:28,497 INFO  L93              Difference]: Finished difference Result 98 states and 119 transitions.
[2025-05-07 17:27:28,498 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:27:28,499 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (18), 1 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 65
[2025-05-07 17:27:28,499 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:28,506 INFO  L225             Difference]: With dead ends: 98
[2025-05-07 17:27:28,506 INFO  L226             Difference]: Without dead ends: 94
[2025-05-07 17:27:28,507 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:27:28,509 INFO  L437           NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:28,510 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:28,521 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2025-05-07 17:27:28,540 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92.
[2025-05-07 17:27:28,541 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 38 states have internal predecessors, (38), 34 states have call successors, (36), 22 states have call predecessors, (36), 22 states have return successors, (36), 31 states have call predecessors, (36), 34 states have call successors, (36)
[2025-05-07 17:27:28,546 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions.
[2025-05-07 17:27:28,546 INFO  L79                 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 65
[2025-05-07 17:27:28,547 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:28,547 INFO  L485      AbstractCegarLoop]: Abstraction has 92 states and 110 transitions.
[2025-05-07 17:27:28,547 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (18), 1 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:27:28,547 INFO  L278                IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions.
[2025-05-07 17:27:28,552 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-05-07 17:27:28,552 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:28,552 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:28,552 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:27:28,553 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:28,553 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:28,553 INFO  L85        PathProgramCache]: Analyzing trace with hash -2042018616, now seen corresponding path program 1 times
[2025-05-07 17:27:28,553 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:28,553 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169400520]
[2025-05-07 17:27:28,554 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:28,554 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:28,598 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-05-07 17:27:28,627 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-05-07 17:27:28,627 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:28,627 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:28,772 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:27:28,772 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:28,772 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169400520]
[2025-05-07 17:27:28,772 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169400520] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:28,772 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:28,772 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:27:28,772 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386183384]
[2025-05-07 17:27:28,772 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:28,773 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:27:28,774 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:28,774 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:27:28,774 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:27:28,775 INFO  L87              Difference]: Start difference. First operand 92 states and 110 transitions. Second operand  has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (18), 7 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:27:28,877 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:28,877 INFO  L93              Difference]: Finished difference Result 94 states and 111 transitions.
[2025-05-07 17:27:28,877 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:27:28,877 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (18), 7 states have call predecessors, (18), 4 states have call successors, (18) Word has length 65
[2025-05-07 17:27:28,878 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:28,879 INFO  L225             Difference]: With dead ends: 94
[2025-05-07 17:27:28,879 INFO  L226             Difference]: Without dead ends: 92
[2025-05-07 17:27:28,879 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:27:28,880 INFO  L437           NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:28,880 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 579 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:27:28,881 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-05-07 17:27:28,887 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90.
[2025-05-07 17:27:28,888 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 90 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 37 states have internal predecessors, (37), 32 states have call successors, (34), 22 states have call predecessors, (34), 22 states have return successors, (34), 30 states have call predecessors, (34), 32 states have call successors, (34)
[2025-05-07 17:27:28,889 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions.
[2025-05-07 17:27:28,889 INFO  L79                 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 65
[2025-05-07 17:27:28,890 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:28,890 INFO  L485      AbstractCegarLoop]: Abstraction has 90 states and 105 transitions.
[2025-05-07 17:27:28,890 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (18), 7 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:27:28,890 INFO  L278                IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions.
[2025-05-07 17:27:28,891 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2025-05-07 17:27:28,891 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:28,891 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-05-07 17:27:28,891 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:27:28,891 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:28,891 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:28,892 INFO  L85        PathProgramCache]: Analyzing trace with hash -1342246638, now seen corresponding path program 1 times
[2025-05-07 17:27:28,892 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:28,892 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991250132]
[2025-05-07 17:27:28,892 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:28,892 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:28,932 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes.
[2025-05-07 17:27:28,969 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements.
[2025-05-07 17:27:28,969 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:28,969 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:30,084 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-05-07 17:27:30,084 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:30,084 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991250132]
[2025-05-07 17:27:30,085 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991250132] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:30,085 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:30,085 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-05-07 17:27:30,085 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661638461]
[2025-05-07 17:27:30,085 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:30,085 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-05-07 17:27:30,085 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:30,086 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-05-07 17:27:30,086 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-05-07 17:27:30,086 INFO  L87              Difference]: Start difference. First operand 90 states and 105 transitions. Second operand  has 9 states, 6 states have (on average 5.666666666666667) internal successors, (34), 9 states have internal predecessors, (34), 6 states have call successors, (22), 1 states have call predecessors, (22), 6 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23)
[2025-05-07 17:27:30,222 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:30,222 INFO  L93              Difference]: Finished difference Result 88 states and 102 transitions.
[2025-05-07 17:27:30,223 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-05-07 17:27:30,223 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 6 states have (on average 5.666666666666667) internal successors, (34), 9 states have internal predecessors, (34), 6 states have call successors, (22), 1 states have call predecessors, (22), 6 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23) Word has length 85
[2025-05-07 17:27:30,223 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:30,224 INFO  L225             Difference]: With dead ends: 88
[2025-05-07 17:27:30,224 INFO  L226             Difference]: Without dead ends: 84
[2025-05-07 17:27:30,225 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:27:30,225 INFO  L437           NwaCegarLoop]: 93 mSDtfsCounter, 2 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:30,226 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 717 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:27:30,226 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2025-05-07 17:27:30,232 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2025-05-07 17:27:30,233 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 29 states have call successors, (30), 21 states have call predecessors, (30), 21 states have return successors, (30), 27 states have call predecessors, (30), 29 states have call successors, (30)
[2025-05-07 17:27:30,234 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions.
[2025-05-07 17:27:30,234 INFO  L79                 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 85
[2025-05-07 17:27:30,234 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:30,234 INFO  L485      AbstractCegarLoop]: Abstraction has 84 states and 95 transitions.
[2025-05-07 17:27:30,235 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 6 states have (on average 5.666666666666667) internal successors, (34), 9 states have internal predecessors, (34), 6 states have call successors, (22), 1 states have call predecessors, (22), 6 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23)
[2025-05-07 17:27:30,235 INFO  L278                IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions.
[2025-05-07 17:27:30,236 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2025-05-07 17:27:30,236 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:30,236 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-05-07 17:27:30,236 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:27:30,237 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:30,237 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:30,237 INFO  L85        PathProgramCache]: Analyzing trace with hash -132014391, now seen corresponding path program 1 times
[2025-05-07 17:27:30,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:30,237 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28066213]
[2025-05-07 17:27:30,237 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:30,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:30,269 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes.
[2025-05-07 17:27:30,283 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements.
[2025-05-07 17:27:30,283 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:30,283 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:30,393 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-05-07 17:27:30,394 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:30,394 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28066213]
[2025-05-07 17:27:30,394 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28066213] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:27:30,394 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768678370]
[2025-05-07 17:27:30,394 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:30,394 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:30,396 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:27:30,399 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:27:30,400 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:27:30,621 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes.
[2025-05-07 17:27:30,737 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements.
[2025-05-07 17:27:30,737 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:30,737 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:30,743 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-05-07 17:27:30,751 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:27:30,798 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:27:30,798 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:27:30,798 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [768678370] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:30,798 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:27:30,799 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 7
[2025-05-07 17:27:30,799 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699495252]
[2025-05-07 17:27:30,799 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:30,799 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:27:30,799 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:30,800 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:27:30,800 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:27:30,800 INFO  L87              Difference]: Start difference. First operand 84 states and 95 transitions. Second operand  has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23)
[2025-05-07 17:27:30,857 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:30,857 INFO  L93              Difference]: Finished difference Result 82 states and 90 transitions.
[2025-05-07 17:27:30,858 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:27:30,858 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) Word has length 82
[2025-05-07 17:27:30,858 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:30,859 INFO  L225             Difference]: With dead ends: 82
[2025-05-07 17:27:30,859 INFO  L226             Difference]: Without dead ends: 81
[2025-05-07 17:27:30,860 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:27:30,860 INFO  L437           NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:30,861 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 489 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:30,861 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2025-05-07 17:27:30,865 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81.
[2025-05-07 17:27:30,866 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 81 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 26 states have call successors, (27), 21 states have call predecessors, (27), 21 states have return successors, (27), 25 states have call predecessors, (27), 26 states have call successors, (27)
[2025-05-07 17:27:30,867 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions.
[2025-05-07 17:27:30,867 INFO  L79                 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 82
[2025-05-07 17:27:30,867 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:30,867 INFO  L485      AbstractCegarLoop]: Abstraction has 81 states and 88 transitions.
[2025-05-07 17:27:30,867 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23)
[2025-05-07 17:27:30,867 INFO  L278                IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions.
[2025-05-07 17:27:30,869 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2025-05-07 17:27:30,869 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:30,869 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-05-07 17:27:30,874 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:27:31,069 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:31,070 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:31,070 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:31,070 INFO  L85        PathProgramCache]: Analyzing trace with hash -1115176574, now seen corresponding path program 1 times
[2025-05-07 17:27:31,070 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:31,070 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780562488]
[2025-05-07 17:27:31,070 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:31,071 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:31,101 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes.
[2025-05-07 17:27:31,119 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements.
[2025-05-07 17:27:31,119 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:31,119 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:31,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-05-07 17:27:31,260 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:31,260 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780562488]
[2025-05-07 17:27:31,260 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780562488] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:31,260 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:31,260 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:27:31,260 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002119487]
[2025-05-07 17:27:31,260 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:31,260 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:27:31,260 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:31,261 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:27:31,261 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:27:31,261 INFO  L87              Difference]: Start difference. First operand 81 states and 88 transitions. Second operand  has 7 states, 5 states have (on average 6.2) internal successors, (31), 7 states have internal predecessors, (31), 6 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21)
[2025-05-07 17:27:31,300 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:31,300 INFO  L93              Difference]: Finished difference Result 86 states and 94 transitions.
[2025-05-07 17:27:31,301 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:27:31,301 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 6.2) internal successors, (31), 7 states have internal predecessors, (31), 6 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21) Word has length 85
[2025-05-07 17:27:31,301 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:31,301 INFO  L225             Difference]: With dead ends: 86
[2025-05-07 17:27:31,302 INFO  L226             Difference]: Without dead ends: 86
[2025-05-07 17:27:31,302 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:27:31,302 INFO  L437           NwaCegarLoop]: 84 mSDtfsCounter, 2 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:31,302 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 406 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:31,303 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2025-05-07 17:27:31,306 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86.
[2025-05-07 17:27:31,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 86 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 27 states have call successors, (28), 21 states have call predecessors, (28), 23 states have return successors, (30), 28 states have call predecessors, (30), 27 states have call successors, (30)
[2025-05-07 17:27:31,307 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions.
[2025-05-07 17:27:31,307 INFO  L79                 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 85
[2025-05-07 17:27:31,307 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:31,307 INFO  L485      AbstractCegarLoop]: Abstraction has 86 states and 94 transitions.
[2025-05-07 17:27:31,307 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 6.2) internal successors, (31), 7 states have internal predecessors, (31), 6 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21)
[2025-05-07 17:27:31,307 INFO  L278                IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions.
[2025-05-07 17:27:31,308 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2025-05-07 17:27:31,308 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:31,308 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-05-07 17:27:31,308 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:27:31,308 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:31,308 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:31,308 INFO  L85        PathProgramCache]: Analyzing trace with hash 128883752, now seen corresponding path program 1 times
[2025-05-07 17:27:31,308 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:31,308 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773571877]
[2025-05-07 17:27:31,308 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:31,308 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:31,330 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes.
[2025-05-07 17:27:31,339 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements.
[2025-05-07 17:27:31,339 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:31,339 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:31,426 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-05-07 17:27:31,426 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:31,426 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773571877]
[2025-05-07 17:27:31,427 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773571877] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:31,427 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:31,427 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:27:31,427 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37873904]
[2025-05-07 17:27:31,427 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:31,427 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:27:31,427 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:31,428 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:27:31,428 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:27:31,428 INFO  L87              Difference]: Start difference. First operand 86 states and 94 transitions. Second operand  has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 5 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21)
[2025-05-07 17:27:31,448 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:31,448 INFO  L93              Difference]: Finished difference Result 56 states and 60 transitions.
[2025-05-07 17:27:31,448 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:27:31,449 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 5 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 85
[2025-05-07 17:27:31,449 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:31,449 INFO  L225             Difference]: With dead ends: 56
[2025-05-07 17:27:31,449 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:27:31,449 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:27:31,450 INFO  L437           NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:31,450 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:31,450 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:27:31,450 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:27:31,450 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-05-07 17:27:31,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:27:31,451 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85
[2025-05-07 17:27:31,451 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:31,451 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:27:31,451 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 5 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21)
[2025-05-07 17:27:31,451 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:27:31,451 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:27:31,453 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:27:31,453 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:27:31,455 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:31,457 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:27:31,459 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:27:31 BoogieIcfgContainer
[2025-05-07 17:27:31,459 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:27:31,459 INFO  L158              Benchmark]: Toolchain (without parser) took 4138.05ms. Allocated memory is still 234.9MB. Free memory was 146.9MB in the beginning and 170.7MB in the end (delta: -23.8MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:31,459 INFO  L158              Benchmark]: SmtParser took 0.24ms. 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:27:31,460 INFO  L158              Benchmark]: ChcToBoogie took 33.86ms. Allocated memory is still 234.9MB. Free memory was 146.8MB in the beginning and 143.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:31,460 INFO  L158              Benchmark]: Boogie Preprocessor took 53.57ms. Allocated memory is still 234.9MB. Free memory was 143.7MB in the beginning and 140.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:31,460 INFO  L158              Benchmark]: RCFGBuilder took 437.51ms. Allocated memory is still 234.9MB. Free memory was 140.4MB in the beginning and 173.5MB in the end (delta: -33.1MB). Peak memory consumption was 42.2MB. Max. memory is 33.6GB.
[2025-05-07 17:27:31,460 INFO  L158              Benchmark]: TraceAbstraction took 3609.82ms. Allocated memory is still 234.9MB. Free memory was 172.7MB in the beginning and 170.7MB in the end (delta: 2.0MB). Peak memory consumption was 5.6MB. Max. memory is 33.6GB.
[2025-05-07 17:27:31,461 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.24ms. Allocated memory is still 234.9MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 33.86ms. Allocated memory is still 234.9MB. Free memory was 146.8MB in the beginning and 143.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 53.57ms. Allocated memory is still 234.9MB. Free memory was 143.7MB in the beginning and 140.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 437.51ms. Allocated memory is still 234.9MB. Free memory was 140.4MB in the beginning and 173.5MB in the end (delta: -33.1MB). Peak memory consumption was 42.2MB. Max. memory is 33.6GB.
 * TraceAbstraction took 3609.82ms. Allocated memory is still 234.9MB. Free memory was 172.7MB in the beginning and 170.7MB in the end (delta: 2.0MB). Peak memory consumption was 5.6MB. 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, 96 locations, 155 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 2887 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2360 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 228 IncrementalHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 527 mSDtfsCounter, 228 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, InterpolantAutomatonStates: 41, 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, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 549 NumberOfCodeBlocks, 549 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 542 ConstructedInterpolants, 0 QuantifiedInterpolants, 813 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1160 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 58/65 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-05-07 17:27:31,470 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
