./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/external_calls/external_call_with_value_2.sol_1_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:26:55,504 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:26:55,542 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d0d3245-273e-4e62-8d0b-350315d09e68/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:26:55,545 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:26:55,545 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:26:55,558 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:26:55,559 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:26:55,559 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:26:55,559 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:26:55,559 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:26:55,560 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:26:55,560 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:26:55,560 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:26:55,560 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:26:55,560 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:26:55,560 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:26:55,560 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:26:55,560 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:26:55,560 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:26:55,560 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:26:55,561 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:26:55,561 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:26:55,561 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:26:55,561 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:26:55,561 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:26:55,562 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:26:55,562 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:26:55,742 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:26:55,748 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:26:55,750 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:26:55,751 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:26:55,751 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:26:55,752 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d0d3245-273e-4e62-8d0b-350315d09e68/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/external_calls/external_call_with_value_2.sol_1_no_adts_000.smt2
[2025-05-07 17:26:55,753 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:26:55,755 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:26:55,992 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d0d3245-273e-4e62-8d0b-350315d09e68/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/external_calls/external_call_with_value_2.sol_1_no_adts_000.smt2
[2025-05-07 17:26:55,996 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:26:55,997 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:26:55,998 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:26:55,998 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:26:55,998 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:26:56,000 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:26:55" (1/1) ...
[2025-05-07 17:26:56,033 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:56 Unit
[2025-05-07 17:26:56,034 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:26:56,035 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:26:56,035 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:26:56,035 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:26:56,051 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:56" (1/1) ...
[2025-05-07 17:26:56,052 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:56" (1/1) ...
[2025-05-07 17:26:56,076 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:56" (1/1) ...
[2025-05-07 17:26:56,076 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:56" (1/1) ...
[2025-05-07 17:26:56,082 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:56" (1/1) ...
[2025-05-07 17:26:56,083 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:56" (1/1) ...
[2025-05-07 17:26:56,084 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:56" (1/1) ...
[2025-05-07 17:26:56,086 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:56" (1/1) ...
[2025-05-07 17:26:56,087 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:56" (1/1) ...
[2025-05-07 17:26:56,098 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:26:56,099 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:26:56,099 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:26:56,099 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:26:56,100 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:56" (1/1) ...
[2025-05-07 17:26:56,102 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:26:56,113 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:26:56,124 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:26:56,126 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:26:56,135 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:26:56,136 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:26:56,136 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:26:56,136 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_4_0 given in one single declaration
[2025-05-07 17:26:56,136 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_4_0
[2025-05-07 17:26:56,136 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_4_0
[2025-05-07 17:26:56,136 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_9_function_g__48_49_0 given in one single declaration
[2025-05-07 17:26:56,136 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_9_function_g__48_49_0
[2025-05-07 17:26:56,136 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_9_function_g__48_49_0
[2025-05-07 17:26:56,136 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_8_function_g__48_49_0 given in one single declaration
[2025-05-07 17:26:56,136 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_8_function_g__48_49_0
[2025-05-07 17:26:56,136 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_8_function_g__48_49_0
[2025-05-07 17:26:56,136 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_18_function_g__48_49_0 given in one single declaration
[2025-05-07 17:26:56,136 INFO  L130     BoogieDeclarations]: Found specification of procedure block_18_function_g__48_49_0
[2025-05-07 17:26:56,136 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_18_function_g__48_49_0
[2025-05-07 17:26:56,136 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_16_return_function_g__48_49_0 given in one single declaration
[2025-05-07 17:26:56,136 INFO  L130     BoogieDeclarations]: Found specification of procedure block_16_return_function_g__48_49_0
[2025-05-07 17:26:56,136 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_16_return_function_g__48_49_0
[2025-05-07 17:26:56,137 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_19_function_g__48_49_0 given in one single declaration
[2025-05-07 17:26:56,137 INFO  L130     BoogieDeclarations]: Found specification of procedure block_19_function_g__48_49_0
[2025-05-07 17:26:56,137 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_19_function_g__48_49_0
[2025-05-07 17:26:56,137 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure nondet_call_17_0 given in one single declaration
[2025-05-07 17:26:56,137 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_call_17_0
[2025-05-07 17:26:56,137 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_call_17_0
[2025-05-07 17:26:56,137 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure nondet_interface_6_C_49_0 given in one single declaration
[2025-05-07 17:26:56,137 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_interface_6_C_49_0
[2025-05-07 17:26:56,137 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_interface_6_C_49_0
[2025-05-07 17:26:56,137 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_15_g_47_49_0 given in one single declaration
[2025-05-07 17:26:56,137 INFO  L130     BoogieDeclarations]: Found specification of procedure block_15_g_47_49_0
[2025-05-07 17:26:56,137 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_15_g_47_49_0
[2025-05-07 17:26:56,137 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_14_function_g__48_49_0 given in one single declaration
[2025-05-07 17:26:56,137 INFO  L130     BoogieDeclarations]: Found specification of procedure block_14_function_g__48_49_0
[2025-05-07 17:26:56,137 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_14_function_g__48_49_0
[2025-05-07 17:26:56,137 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_20_function_g__48_49_0 given in one single declaration
[2025-05-07 17:26:56,137 INFO  L130     BoogieDeclarations]: Found specification of procedure block_20_function_g__48_49_0
[2025-05-07 17:26:56,137 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_20_function_g__48_49_0
[2025-05-07 17:26:56,137 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_5_C_49_0 given in one single declaration
[2025-05-07 17:26:56,138 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_5_C_49_0
[2025-05-07 17:26:56,138 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_5_C_49_0
[2025-05-07 17:26:56,138 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_7_C_49_0 given in one single declaration
[2025-05-07 17:26:56,138 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_7_C_49_0
[2025-05-07 17:26:56,138 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_7_C_49_0
[2025-05-07 17:26:56,138 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_21_C_49_0 given in one single declaration
[2025-05-07 17:26:56,138 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_21_C_49_0
[2025-05-07 17:26:56,138 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_21_C_49_0
[2025-05-07 17:26:56,138 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_23_C_49_0 given in one single declaration
[2025-05-07 17:26:56,138 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_23_C_49_0
[2025-05-07 17:26:56,138 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_23_C_49_0
[2025-05-07 17:26:56,138 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_22_C_49_0 given in one single declaration
[2025-05-07 17:26:56,138 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_22_C_49_0
[2025-05-07 17:26:56,138 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_22_C_49_0
[2025-05-07 17:26:56,138 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_24_C_49_0 given in one single declaration
[2025-05-07 17:26:56,138 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_24_C_49_0
[2025-05-07 17:26:56,138 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_24_C_49_0
[2025-05-07 17:26:56,138 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:26:56,138 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:26:56,138 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:26:56,242 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:26:56,244 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:26:56,419 INFO  L?                        ?]: Removed 162 outVars from TransFormulas that were not future-live.
[2025-05-07 17:26:56,420 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:26:56,437 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:26:56,437 INFO  L312             CfgBuilder]: Removed 9 assume(true) statements.
[2025-05-07 17:26:56,437 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:26:56 BoogieIcfgContainer
[2025-05-07 17:26:56,437 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:26:56,439 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:26:56,439 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:26:56,443 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:26:56,443 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:26:55" (1/3) ...
[2025-05-07 17:26:56,444 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c21543a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:26:56, skipping insertion in model container
[2025-05-07 17:26:56,444 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:56" (2/3) ...
[2025-05-07 17:26:56,444 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c21543a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:26:56, skipping insertion in model container
[2025-05-07 17:26:56,444 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:26:56" (3/3) ...
[2025-05-07 17:26:56,445 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:26:56,459 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:26:56,461 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 19 procedures, 79 locations, 126 edges, 19 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:26:56,493 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:26:56,504 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;@1cf1df51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:26:56,504 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:26:56,507 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 79 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 28 states have call successors, (30), 18 states have call predecessors, (30), 18 states have return successors, (30), 25 states have call predecessors, (30), 28 states have call successors, (30)
[2025-05-07 17:26:56,516 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2025-05-07 17:26:56,516 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:56,517 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]
[2025-05-07 17:26:56,517 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:56,521 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:56,521 INFO  L85        PathProgramCache]: Analyzing trace with hash 53058389, now seen corresponding path program 1 times
[2025-05-07 17:26:56,526 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:56,527 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118287390]
[2025-05-07 17:26:56,527 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:56,527 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:56,568 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes.
[2025-05-07 17:26:56,622 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements.
[2025-05-07 17:26:56,623 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:56,623 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:56,819 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:26:56,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:56,819 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118287390]
[2025-05-07 17:26:56,820 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118287390] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:56,820 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:56,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:26:56,824 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051450048]
[2025-05-07 17:26:56,824 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:56,828 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:26:56,828 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:56,863 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:26:56,863 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:26:56,865 INFO  L87              Difference]: Start difference. First operand  has 79 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 28 states have call successors, (30), 18 states have call predecessors, (30), 18 states have return successors, (30), 25 states have call predecessors, (30), 28 states have call successors, (30) Second operand  has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15)
[2025-05-07 17:26:56,943 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:56,943 INFO  L93              Difference]: Finished difference Result 83 states and 103 transitions.
[2025-05-07 17:26:56,944 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:26:56,946 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) Word has length 55
[2025-05-07 17:26:56,946 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:56,951 INFO  L225             Difference]: With dead ends: 83
[2025-05-07 17:26:56,951 INFO  L226             Difference]: Without dead ends: 83
[2025-05-07 17:26:56,952 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:26:56,955 INFO  L437           NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:56,955 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 349 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:56,965 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2025-05-07 17:26:56,982 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81.
[2025-05-07 17:26:56,983 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 81 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 36 states have internal predecessors, (36), 28 states have call successors, (30), 18 states have call predecessors, (30), 20 states have return successors, (35), 26 states have call predecessors, (35), 28 states have call successors, (35)
[2025-05-07 17:26:56,987 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions.
[2025-05-07 17:26:56,987 INFO  L79                 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 55
[2025-05-07 17:26:56,988 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:56,988 INFO  L485      AbstractCegarLoop]: Abstraction has 81 states and 101 transitions.
[2025-05-07 17:26:56,988 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15)
[2025-05-07 17:26:56,988 INFO  L278                IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions.
[2025-05-07 17:26:56,990 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:26:56,990 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:56,990 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]
[2025-05-07 17:26:56,991 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:26:56,991 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:56,991 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:56,991 INFO  L85        PathProgramCache]: Analyzing trace with hash 1466108007, now seen corresponding path program 1 times
[2025-05-07 17:26:56,991 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:56,992 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839784539]
[2025-05-07 17:26:56,992 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:56,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:57,016 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:26:57,021 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:26:57,021 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:57,021 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:57,096 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:26:57,097 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:57,097 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839784539]
[2025-05-07 17:26:57,097 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839784539] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:57,097 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:57,097 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:57,097 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748785957]
[2025-05-07 17:26:57,097 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:57,098 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:57,098 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:57,099 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:57,099 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:57,099 INFO  L87              Difference]: Start difference. First operand 81 states and 101 transitions. Second operand  has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:26:57,110 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:57,110 INFO  L93              Difference]: Finished difference Result 85 states and 105 transitions.
[2025-05-07 17:26:57,111 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:57,111 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 58
[2025-05-07 17:26:57,111 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:57,112 INFO  L225             Difference]: With dead ends: 85
[2025-05-07 17:26:57,112 INFO  L226             Difference]: Without dead ends: 81
[2025-05-07 17:26:57,112 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:57,112 INFO  L437           NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:57,112 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 277 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:57,113 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2025-05-07 17:26:57,118 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79.
[2025-05-07 17:26:57,118 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 79 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 26 states have call successors, (28), 18 states have call predecessors, (28), 20 states have return successors, (33), 25 states have call predecessors, (33), 26 states have call successors, (33)
[2025-05-07 17:26:57,119 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions.
[2025-05-07 17:26:57,119 INFO  L79                 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 58
[2025-05-07 17:26:57,119 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:57,119 INFO  L485      AbstractCegarLoop]: Abstraction has 79 states and 96 transitions.
[2025-05-07 17:26:57,119 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:26:57,120 INFO  L278                IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions.
[2025-05-07 17:26:57,120 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:26:57,120 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:57,121 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]
[2025-05-07 17:26:57,121 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:26:57,121 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:57,121 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:57,121 INFO  L85        PathProgramCache]: Analyzing trace with hash 1599044579, now seen corresponding path program 1 times
[2025-05-07 17:26:57,121 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:57,121 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288749475]
[2025-05-07 17:26:57,121 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:57,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:57,139 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:26:57,152 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:26:57,153 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:57,153 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:57,272 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:26:57,272 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:57,272 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288749475]
[2025-05-07 17:26:57,272 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288749475] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:57,272 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:57,272 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:26:57,272 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415536413]
[2025-05-07 17:26:57,272 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:57,273 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:26:57,273 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:57,273 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:26:57,273 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:57,273 INFO  L87              Difference]: Start difference. First operand 79 states and 96 transitions. Second operand  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:26:57,314 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:57,314 INFO  L93              Difference]: Finished difference Result 83 states and 101 transitions.
[2025-05-07 17:26:57,314 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:26:57,315 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) Word has length 58
[2025-05-07 17:26:57,315 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:57,316 INFO  L225             Difference]: With dead ends: 83
[2025-05-07 17:26:57,316 INFO  L226             Difference]: Without dead ends: 83
[2025-05-07 17:26:57,316 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:26:57,317 INFO  L437           NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 429 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:26:57,317 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 429 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:57,317 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2025-05-07 17:26:57,322 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83.
[2025-05-07 17:26:57,322 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 26 states have call successors, (28), 18 states have call predecessors, (28), 22 states have return successors, (36), 27 states have call predecessors, (36), 26 states have call successors, (36)
[2025-05-07 17:26:57,323 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions.
[2025-05-07 17:26:57,323 INFO  L79                 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 58
[2025-05-07 17:26:57,323 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:57,323 INFO  L485      AbstractCegarLoop]: Abstraction has 83 states and 101 transitions.
[2025-05-07 17:26:57,324 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:26:57,324 INFO  L278                IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions.
[2025-05-07 17:26:57,325 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:26:57,325 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:57,325 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]
[2025-05-07 17:26:57,325 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:26:57,325 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:57,325 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:57,325 INFO  L85        PathProgramCache]: Analyzing trace with hash 1285658691, now seen corresponding path program 1 times
[2025-05-07 17:26:57,325 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:57,326 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986089952]
[2025-05-07 17:26:57,326 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:57,326 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:57,347 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:26:57,357 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:26:57,358 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:57,358 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:57,436 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:26:57,436 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:57,436 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986089952]
[2025-05-07 17:26:57,437 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986089952] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:57,437 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:57,437 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:26:57,437 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109856166]
[2025-05-07 17:26:57,437 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:57,437 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:26:57,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:57,438 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:26:57,438 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:57,438 INFO  L87              Difference]: Start difference. First operand 83 states and 101 transitions. Second operand  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:26:57,481 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:57,481 INFO  L93              Difference]: Finished difference Result 87 states and 106 transitions.
[2025-05-07 17:26:57,482 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:26:57,482 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) Word has length 58
[2025-05-07 17:26:57,482 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:57,483 INFO  L225             Difference]: With dead ends: 87
[2025-05-07 17:26:57,484 INFO  L226             Difference]: Without dead ends: 87
[2025-05-07 17:26:57,484 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:26:57,484 INFO  L437           NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 434 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:26:57,485 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 434 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:57,486 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 87 states.
[2025-05-07 17:26:57,492 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83.
[2025-05-07 17:26:57,493 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 26 states have call successors, (28), 18 states have call predecessors, (28), 22 states have return successors, (36), 27 states have call predecessors, (36), 26 states have call successors, (36)
[2025-05-07 17:26:57,494 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions.
[2025-05-07 17:26:57,494 INFO  L79                 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 58
[2025-05-07 17:26:57,494 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:57,494 INFO  L485      AbstractCegarLoop]: Abstraction has 83 states and 101 transitions.
[2025-05-07 17:26:57,494 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:26:57,494 INFO  L278                IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions.
[2025-05-07 17:26:57,496 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:26:57,496 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:57,496 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]
[2025-05-07 17:26:57,496 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:26:57,496 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:57,497 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:57,497 INFO  L85        PathProgramCache]: Analyzing trace with hash -799739825, now seen corresponding path program 1 times
[2025-05-07 17:26:57,497 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:57,497 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205551688]
[2025-05-07 17:26:57,497 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:57,497 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:57,521 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:26:57,540 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:26:57,540 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:57,540 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:58,035 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:26:58,035 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:58,035 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205551688]
[2025-05-07 17:26:58,036 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205551688] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:58,036 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:58,036 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:26:58,036 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29852859]
[2025-05-07 17:26:58,036 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:58,036 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:26:58,036 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:58,036 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:26:58,036 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:58,037 INFO  L87              Difference]: Start difference. First operand 83 states and 101 transitions. Second operand  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:26:58,103 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:58,103 INFO  L93              Difference]: Finished difference Result 83 states and 100 transitions.
[2025-05-07 17:26:58,103 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:26:58,104 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 58
[2025-05-07 17:26:58,104 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:58,105 INFO  L225             Difference]: With dead ends: 83
[2025-05-07 17:26:58,105 INFO  L226             Difference]: Without dead ends: 83
[2025-05-07 17:26:58,106 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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:26:58,106 INFO  L437           NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:58,107 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 383 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:26:58,107 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2025-05-07 17:26:58,112 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83.
[2025-05-07 17:26:58,113 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 26 states have call successors, (28), 18 states have call predecessors, (28), 22 states have return successors, (35), 27 states have call predecessors, (35), 26 states have call successors, (35)
[2025-05-07 17:26:58,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions.
[2025-05-07 17:26:58,114 INFO  L79                 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 58
[2025-05-07 17:26:58,114 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:58,114 INFO  L485      AbstractCegarLoop]: Abstraction has 83 states and 100 transitions.
[2025-05-07 17:26:58,114 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:26:58,114 INFO  L278                IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions.
[2025-05-07 17:26:58,116 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-05-07 17:26:58,116 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:58,116 INFO  L218           NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:58,116 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:26:58,116 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:58,117 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:58,117 INFO  L85        PathProgramCache]: Analyzing trace with hash -894285515, now seen corresponding path program 1 times
[2025-05-07 17:26:58,117 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:58,117 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074381932]
[2025-05-07 17:26:58,117 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:58,117 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:58,149 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-05-07 17:26:58,173 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-05-07 17:26:58,173 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:58,173 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:58,327 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-05-07 17:26:58,327 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:58,327 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074381932]
[2025-05-07 17:26:58,327 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074381932] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:58,327 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:58,327 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:26:58,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680020269]
[2025-05-07 17:26:58,327 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:58,328 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:26:58,328 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:58,328 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:26:58,328 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:26:58,328 INFO  L87              Difference]: Start difference. First operand 83 states and 100 transitions. Second operand  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 8 states have call predecessors, (22), 4 states have call successors, (22)
[2025-05-07 17:26:58,417 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:58,417 INFO  L93              Difference]: Finished difference Result 94 states and 118 transitions.
[2025-05-07 17:26:58,418 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:26:58,418 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 8 states have call predecessors, (22), 4 states have call successors, (22) Word has length 87
[2025-05-07 17:26:58,418 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:58,419 INFO  L225             Difference]: With dead ends: 94
[2025-05-07 17:26:58,419 INFO  L226             Difference]: Without dead ends: 94
[2025-05-07 17:26:58,419 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:26:58,419 INFO  L437           NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:58,420 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 586 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:26:58,420 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2025-05-07 17:26:58,424 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92.
[2025-05-07 17:26:58,424 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 41 states have internal predecessors, (41), 27 states have call successors, (29), 18 states have call predecessors, (29), 26 states have return successors, (46), 32 states have call predecessors, (46), 27 states have call successors, (46)
[2025-05-07 17:26:58,425 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions.
[2025-05-07 17:26:58,425 INFO  L79                 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 87
[2025-05-07 17:26:58,425 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:58,425 INFO  L485      AbstractCegarLoop]: Abstraction has 92 states and 116 transitions.
[2025-05-07 17:26:58,425 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 8 states have call predecessors, (22), 4 states have call successors, (22)
[2025-05-07 17:26:58,425 INFO  L278                IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions.
[2025-05-07 17:26:58,426 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-05-07 17:26:58,426 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:58,426 INFO  L218           NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:58,426 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:26:58,426 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:58,427 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:58,427 INFO  L85        PathProgramCache]: Analyzing trace with hash 316462485, now seen corresponding path program 1 times
[2025-05-07 17:26:58,427 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:58,427 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511730799]
[2025-05-07 17:26:58,427 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:58,427 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:58,448 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-05-07 17:26:58,459 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-05-07 17:26:58,459 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:58,459 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:58,595 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-05-07 17:26:58,595 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:58,595 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511730799]
[2025-05-07 17:26:58,595 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511730799] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:58,595 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:58,595 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:26:58,595 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974226864]
[2025-05-07 17:26:58,596 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:58,596 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:26:58,596 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:58,597 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:26:58,597 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:26:58,597 INFO  L87              Difference]: Start difference. First operand 92 states and 116 transitions. Second operand  has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (21), 8 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:26:58,687 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:58,688 INFO  L93              Difference]: Finished difference Result 101 states and 135 transitions.
[2025-05-07 17:26:58,688 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:26:58,688 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (21), 8 states have call predecessors, (21), 4 states have call successors, (21) Word has length 87
[2025-05-07 17:26:58,689 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:58,690 INFO  L225             Difference]: With dead ends: 101
[2025-05-07 17:26:58,690 INFO  L226             Difference]: Without dead ends: 101
[2025-05-07 17:26:58,690 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:26:58,691 INFO  L437           NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:58,691 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 620 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:26:58,691 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 101 states.
[2025-05-07 17:26:58,699 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97.
[2025-05-07 17:26:58,699 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97 states, 41 states have (on average 1.048780487804878) internal successors, (43), 43 states have internal predecessors, (43), 28 states have call successors, (30), 18 states have call predecessors, (30), 28 states have return successors, (57), 35 states have call predecessors, (57), 28 states have call successors, (57)
[2025-05-07 17:26:58,700 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 130 transitions.
[2025-05-07 17:26:58,700 INFO  L79                 Accepts]: Start accepts. Automaton has 97 states and 130 transitions. Word has length 87
[2025-05-07 17:26:58,701 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:58,701 INFO  L485      AbstractCegarLoop]: Abstraction has 97 states and 130 transitions.
[2025-05-07 17:26:58,701 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (21), 8 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:26:58,701 INFO  L278                IsEmpty]: Start isEmpty. Operand 97 states and 130 transitions.
[2025-05-07 17:26:58,702 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-05-07 17:26:58,702 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:58,703 INFO  L218           NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:58,703 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:26:58,703 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:58,703 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:58,703 INFO  L85        PathProgramCache]: Analyzing trace with hash 1264737903, now seen corresponding path program 1 times
[2025-05-07 17:26:58,703 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:58,703 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008943545]
[2025-05-07 17:26:58,704 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:58,704 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:58,736 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:26:58,755 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:26:58,755 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:58,755 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:59,606 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-05-07 17:26:59,606 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:59,606 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008943545]
[2025-05-07 17:26:59,606 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008943545] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:26:59,606 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16604577]
[2025-05-07 17:26:59,606 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:59,606 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:59,608 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:26:59,610 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:26:59,611 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:26:59,822 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:26:59,952 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:26:59,952 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:59,952 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:59,957 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 92 conjuncts are in the unsatisfiable core
[2025-05-07 17:26:59,967 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:26:59,994 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:27:00,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-05-07 17:27:00,403 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:27:04,347 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:27:04,690 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 12 treesize of output 10
[2025-05-07 17:27:04,790 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-05-07 17:27:04,790 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [16604577] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:27:04,790 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:27:04,790 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 16] total 29
[2025-05-07 17:27:04,791 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956159438]
[2025-05-07 17:27:04,791 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:27:04,791 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2025-05-07 17:27:04,791 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:04,792 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2025-05-07 17:27:04,792 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812
[2025-05-07 17:27:04,792 INFO  L87              Difference]: Start difference. First operand 97 states and 130 transitions. Second operand  has 29 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 23 states have internal predecessors, (49), 18 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (42), 22 states have call predecessors, (42), 18 states have call successors, (42)
[2025-05-07 17:27:05,437 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:05,437 INFO  L93              Difference]: Finished difference Result 121 states and 181 transitions.
[2025-05-07 17:27:05,437 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-05-07 17:27:05,437 INFO  L79                 Accepts]: Start accepts. Automaton has  has 29 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 23 states have internal predecessors, (49), 18 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (42), 22 states have call predecessors, (42), 18 states have call successors, (42) Word has length 90
[2025-05-07 17:27:05,438 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:05,438 INFO  L225             Difference]: With dead ends: 121
[2025-05-07 17:27:05,438 INFO  L226             Difference]: Without dead ends: 121
[2025-05-07 17:27:05,439 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=1418, Unknown=0, NotChecked=0, Total=1560
[2025-05-07 17:27:05,439 INFO  L437           NwaCegarLoop]: 81 mSDtfsCounter, 16 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:05,439 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1831 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-05-07 17:27:05,440 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 121 states.
[2025-05-07 17:27:05,445 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104.
[2025-05-07 17:27:05,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 104 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 46 states have internal predecessors, (46), 29 states have call successors, (31), 18 states have call predecessors, (31), 31 states have return successors, (65), 40 states have call predecessors, (65), 29 states have call successors, (65)
[2025-05-07 17:27:05,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions.
[2025-05-07 17:27:05,446 INFO  L79                 Accepts]: Start accepts. Automaton has 104 states and 142 transitions. Word has length 90
[2025-05-07 17:27:05,447 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:05,447 INFO  L485      AbstractCegarLoop]: Abstraction has 104 states and 142 transitions.
[2025-05-07 17:27:05,447 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 23 states have internal predecessors, (49), 18 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (42), 22 states have call predecessors, (42), 18 states have call successors, (42)
[2025-05-07 17:27:05,447 INFO  L278                IsEmpty]: Start isEmpty. Operand 104 states and 142 transitions.
[2025-05-07 17:27:05,448 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-05-07 17:27:05,448 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:05,448 INFO  L218           NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:05,455 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:27:05,649 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:05,649 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:05,650 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:05,651 INFO  L85        PathProgramCache]: Analyzing trace with hash 1474280975, now seen corresponding path program 1 times
[2025-05-07 17:27:05,651 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:05,651 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249462558]
[2025-05-07 17:27:05,651 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:05,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:05,727 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:27:05,738 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:27:05,738 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:05,738 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:05,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-05-07 17:27:05,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:05,829 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249462558]
[2025-05-07 17:27:05,829 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249462558] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:05,829 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:05,829 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:27:05,829 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308063943]
[2025-05-07 17:27:05,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:05,830 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:27:05,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:05,830 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:27:05,831 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:27:05,831 INFO  L87              Difference]: Start difference. First operand 104 states and 142 transitions. Second operand  has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 7 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:27:05,902 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:05,902 INFO  L93              Difference]: Finished difference Result 104 states and 141 transitions.
[2025-05-07 17:27:05,902 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:27:05,902 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 7 states have call predecessors, (23), 5 states have call successors, (23) Word has length 90
[2025-05-07 17:27:05,903 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:05,903 INFO  L225             Difference]: With dead ends: 104
[2025-05-07 17:27:05,903 INFO  L226             Difference]: Without dead ends: 104
[2025-05-07 17:27:05,904 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:27:05,904 INFO  L437           NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:05,904 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 620 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:27:05,904 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 104 states.
[2025-05-07 17:27:05,908 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104.
[2025-05-07 17:27:05,908 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 104 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 46 states have internal predecessors, (46), 29 states have call successors, (31), 18 states have call predecessors, (31), 31 states have return successors, (64), 40 states have call predecessors, (64), 29 states have call successors, (64)
[2025-05-07 17:27:05,909 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 141 transitions.
[2025-05-07 17:27:05,909 INFO  L79                 Accepts]: Start accepts. Automaton has 104 states and 141 transitions. Word has length 90
[2025-05-07 17:27:05,909 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:05,909 INFO  L485      AbstractCegarLoop]: Abstraction has 104 states and 141 transitions.
[2025-05-07 17:27:05,909 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 7 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:27:05,910 INFO  L278                IsEmpty]: Start isEmpty. Operand 104 states and 141 transitions.
[2025-05-07 17:27:05,916 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-05-07 17:27:05,916 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:05,916 INFO  L218           NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-05-07 17:27:05,916 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:27:05,917 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:05,917 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:05,917 INFO  L85        PathProgramCache]: Analyzing trace with hash -640359377, now seen corresponding path program 1 times
[2025-05-07 17:27:05,918 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:05,918 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307426395]
[2025-05-07 17:27:05,918 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:05,918 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:05,943 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-05-07 17:27:05,953 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-05-07 17:27:05,953 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:05,953 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:06,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked.
[2025-05-07 17:27:06,138 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:06,138 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307426395]
[2025-05-07 17:27:06,138 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307426395] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:27:06,138 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403767155]
[2025-05-07 17:27:06,138 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:06,138 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:06,140 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:27:06,142 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:27:06,143 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-05-07 17:27:06,394 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-05-07 17:27:06,550 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-05-07 17:27:06,550 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:06,550 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:06,555 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1529 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-05-07 17:27:06,560 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:27:06,637 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked.
[2025-05-07 17:27:06,637 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:27:06,637 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403767155] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:06,637 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:27:06,637 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16
[2025-05-07 17:27:06,638 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986893308]
[2025-05-07 17:27:06,638 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:06,638 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:27:06,638 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:06,639 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:27:06,639 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240
[2025-05-07 17:27:06,639 INFO  L87              Difference]: Start difference. First operand 104 states and 141 transitions. Second operand  has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (26), 2 states have call predecessors, (26), 7 states have return successors, (30), 8 states have call predecessors, (30), 5 states have call successors, (30)
[2025-05-07 17:27:06,700 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:06,701 INFO  L93              Difference]: Finished difference Result 75 states and 91 transitions.
[2025-05-07 17:27:06,701 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:27:06,701 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (26), 2 states have call predecessors, (26), 7 states have return successors, (30), 8 states have call predecessors, (30), 5 states have call successors, (30) Word has length 122
[2025-05-07 17:27:06,701 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:06,701 INFO  L225             Difference]: With dead ends: 75
[2025-05-07 17:27:06,701 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:27:06,702 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240
[2025-05-07 17:27:06,702 INFO  L437           NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:06,702 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 536 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:27:06,702 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:27:06,702 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:27:06,702 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:06,703 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:27:06,703 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122
[2025-05-07 17:27:06,703 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:06,703 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:27:06,703 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (26), 2 states have call predecessors, (26), 7 states have return successors, (30), 8 states have call predecessors, (30), 5 states have call successors, (30)
[2025-05-07 17:27:06,703 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:27:06,703 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:27:06,705 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:27:06,712 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-05-07 17:27:06,906 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:06,908 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:06,909 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:27:06,911 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:27:06 BoogieIcfgContainer
[2025-05-07 17:27:06,911 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:27:06,912 INFO  L158              Benchmark]: Toolchain (without parser) took 10915.17ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 153.2MB in the beginning and 186.2MB in the end (delta: -32.9MB). Peak memory consumption was 31.6MB. Max. memory is 33.6GB.
[2025-05-07 17:27:06,912 INFO  L158              Benchmark]: SmtParser took 0.18ms. Allocated memory is still 234.9MB. Free memory is still 173.3MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:06,912 INFO  L158              Benchmark]: ChcToBoogie took 36.45ms. Allocated memory is still 234.9MB. Free memory was 153.2MB in the beginning and 150.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:06,912 INFO  L158              Benchmark]: Boogie Preprocessor took 63.94ms. Allocated memory is still 234.9MB. Free memory was 150.7MB in the beginning and 147.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:06,912 INFO  L158              Benchmark]: RCFGBuilder took 338.45ms. Allocated memory is still 234.9MB. Free memory was 147.7MB in the beginning and 192.6MB in the end (delta: -44.9MB). Peak memory consumption was 43.0MB. Max. memory is 33.6GB.
[2025-05-07 17:27:06,913 INFO  L158              Benchmark]: TraceAbstraction took 10472.03ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 192.2MB in the beginning and 186.2MB in the end (delta: 6.0MB). Peak memory consumption was 55.7MB. Max. memory is 33.6GB.
[2025-05-07 17:27:06,913 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.18ms. Allocated memory is still 234.9MB. Free memory is still 173.3MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 36.45ms. Allocated memory is still 234.9MB. Free memory was 153.2MB in the beginning and 150.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 63.94ms. Allocated memory is still 234.9MB. Free memory was 150.7MB in the beginning and 147.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 338.45ms. Allocated memory is still 234.9MB. Free memory was 147.7MB in the beginning and 192.6MB in the end (delta: -44.9MB). Peak memory consumption was 43.0MB. Max. memory is 33.6GB.
 * TraceAbstraction took 10472.03ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 192.2MB in the beginning and 186.2MB in the end (delta: 6.0MB). Peak memory consumption was 55.7MB. 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 19 procedures, 79 locations, 126 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 6065 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5185 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1032 IncrementalHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 880 mSDtfsCounter, 1032 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 405 GetRequests, 317 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=8, InterpolantAutomatonStates: 79, 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, 31 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 975 NumberOfCodeBlocks, 975 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1052 ConstructedInterpolants, 0 QuantifiedInterpolants, 2077 SizeOfPredicates, 40 NumberOfNonLiveVariables, 2628 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 326/346 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:06,923 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
