/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-3-nl.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:26,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:26,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:23:26,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:26,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:26,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:26,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:26,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:26,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:26,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:26,751 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:26,751 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:26,751 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:26,751 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:26,751 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:26,751 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:26,751 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:26,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:26,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:26,752 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:26,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:26,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:26,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:26,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:26,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:26,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:26,752 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:26,752 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:26,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:26,752 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:26,752 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:26,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:26,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:26,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:26,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:26,753 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:26,753 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:26,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:26,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:26,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:26,971 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:26,972 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:26,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-3-nl.wvr.bpl [2025-04-26 16:23:26,975 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-3-nl.wvr.bpl' [2025-04-26 16:23:26,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:26,997 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:26,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:26,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:26,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:27,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,045 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:27,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:27,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:27,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:27,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:27,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,063 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,064 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,071 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:27,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:27,090 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:27,090 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:27,092 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:27,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:27,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:27,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:23:27,173 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:27,173 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:27,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:27,174 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:27,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:27,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:27,174 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:27,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:27,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:27,174 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:23:27,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:23:27,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:23:27,175 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:23:27,221 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:27,223 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:27,340 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:27,340 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:27,361 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:27,362 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:27,362 INFO L201 PluginConnector]: Adding new model queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:27 BoogieIcfgContainer [2025-04-26 16:23:27,362 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:27,364 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:27,364 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:27,368 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:27,369 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:27,370 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/2) ... [2025-04-26 16:23:27,371 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60ce1935 and model type queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:23:27, skipping insertion in model container [2025-04-26 16:23:27,371 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:27,371 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:27" (2/2) ... [2025-04-26 16:23:27,373 INFO L376 chiAutomizerObserver]: Analyzing ICFG queue-add-3-nl.wvr.bpl [2025-04-26 16:23:27,429 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:23:27,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 111 flow [2025-04-26 16:23:27,487 INFO L116 PetriNetUnfolderBase]: 3/39 cut-off events. [2025-04-26 16:23:27,490 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:23:27,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-04-26 16:23:27,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 45 transitions, 111 flow [2025-04-26 16:23:27,497 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 39 transitions, 96 flow [2025-04-26 16:23:27,497 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 46 places, 39 transitions, 96 flow [2025-04-26 16:23:27,506 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:27,506 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:27,506 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:27,506 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:27,506 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:27,507 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:27,507 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:27,507 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:27,508 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:27,667 INFO L131 ngComponentsAnalysis]: Automaton has 91 accepting balls. 883 [2025-04-26 16:23:27,667 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:27,667 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:27,671 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:23:27,672 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:27,672 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:27,672 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 1014 states, but on-demand construction may add more states [2025-04-26 16:23:27,692 INFO L131 ngComponentsAnalysis]: Automaton has 91 accepting balls. 883 [2025-04-26 16:23:27,692 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:27,692 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:27,692 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:23:27,692 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:27,698 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" [2025-04-26 16:23:27,698 INFO L754 eck$LassoCheckResult]: Loop: "[106] L32-1-->L33: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[108] L33-->L33-1: Formula: (and (= 1 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" [2025-04-26 16:23:27,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:27,703 INFO L85 PathProgramCache]: Analyzing trace with hash 132071, now seen corresponding path program 1 times [2025-04-26 16:23:27,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:27,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172185365] [2025-04-26 16:23:27,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:27,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:27,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:27,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:27,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,790 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:27,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:27,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:27,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:27,816 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:27,816 INFO L85 PathProgramCache]: Analyzing trace with hash 4188677, now seen corresponding path program 1 times [2025-04-26 16:23:27,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:27,816 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424467774] [2025-04-26 16:23:27,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:27,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:27,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:27,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:27,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,830 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:27,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:27,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:27,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:27,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:27,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1714522859, now seen corresponding path program 1 times [2025-04-26 16:23:27,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:27,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290729939] [2025-04-26 16:23:27,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:27,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:27,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:27,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:27,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,852 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:27,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:27,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:27,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:27,988 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:27,989 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:27,989 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:27,989 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:27,990 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:27,990 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:27,990 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:27,990 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:27,990 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:23:27,990 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:27,990 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:28,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,141 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:28,143 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:28,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:28,146 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:28,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:23:28,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:28,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:28,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:28,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:28,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:28,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:28,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:28,174 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:28,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:28,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:28,184 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:28,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:23:28,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:28,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:28,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:28,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:28,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:28,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:28,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:28,209 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:28,240 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:23:28,240 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:28,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:28,243 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:28,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:23:28,246 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:28,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:28,265 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:28,266 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:28,266 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:23:28,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:28,276 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:28,294 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:28,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:28,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:28,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:28,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:28,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:28,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:28,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:28,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:28,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:28,439 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:28,444 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 1014 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:28,579 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 1014 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2424 states and 8221 transitions. Complement of second has 7 states. [2025-04-26 16:23:28,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2025-04-26 16:23:28,595 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 104 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:23:28,597 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:28,597 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 104 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:23:28,598 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:28,598 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 104 transitions. Stem has 3 letters. Loop has 8 letters. [2025-04-26 16:23:28,598 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:28,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2424 states and 8221 transitions. [2025-04-26 16:23:28,627 INFO L131 ngComponentsAnalysis]: Automaton has 100 accepting balls. 799 [2025-04-26 16:23:28,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2424 states to 1835 states and 6252 transitions. [2025-04-26 16:23:28,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1061 [2025-04-26 16:23:28,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1351 [2025-04-26 16:23:28,665 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1835 states and 6252 transitions. [2025-04-26 16:23:28,665 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:28,665 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1835 states and 6252 transitions. [2025-04-26 16:23:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states and 6252 transitions. [2025-04-26 16:23:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1548. [2025-04-26 16:23:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1548 states have (on average 3.4211886304909562) internal successors, (in total 5296), 1547 states have internal predecessors, (5296), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:28,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 5296 transitions. [2025-04-26 16:23:28,760 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1548 states and 5296 transitions. [2025-04-26 16:23:28,760 INFO L438 stractBuchiCegarLoop]: Abstraction has 1548 states and 5296 transitions. [2025-04-26 16:23:28,760 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:28,761 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1548 states and 5296 transitions. [2025-04-26 16:23:28,769 INFO L131 ngComponentsAnalysis]: Automaton has 100 accepting balls. 799 [2025-04-26 16:23:28,769 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:28,769 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:28,769 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:28,769 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:28,770 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" [2025-04-26 16:23:28,771 INFO L754 eck$LassoCheckResult]: Loop: "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[119] L53-1-->L58: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" [2025-04-26 16:23:28,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,771 INFO L85 PathProgramCache]: Analyzing trace with hash 126955561, now seen corresponding path program 1 times [2025-04-26 16:23:28,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:28,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817799662] [2025-04-26 16:23:28,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:28,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:28,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:28,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,780 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:28,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:28,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:28,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:28,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,787 INFO L85 PathProgramCache]: Analyzing trace with hash 26157701, now seen corresponding path program 1 times [2025-04-26 16:23:28,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:28,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500748135] [2025-04-26 16:23:28,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:28,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:28,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:28,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:28,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,798 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:28,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:28,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:28,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:28,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,804 INFO L85 PathProgramCache]: Analyzing trace with hash -948595539, now seen corresponding path program 1 times [2025-04-26 16:23:28,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:28,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224746498] [2025-04-26 16:23:28,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:28,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:28,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:28,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:28,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:28,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:28,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224746498] [2025-04-26 16:23:28,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224746498] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:28,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:28,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:23:28,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788934581] [2025-04-26 16:23:28,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:28,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:28,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:23:28,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:23:28,967 INFO L87 Difference]: Start difference. First operand 1548 states and 5296 transitions. cyclomatic complexity: 3875 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:29,014 INFO L93 Difference]: Finished difference Result 1751 states and 5718 transitions. [2025-04-26 16:23:29,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1751 states and 5718 transitions. [2025-04-26 16:23:29,027 INFO L131 ngComponentsAnalysis]: Automaton has 114 accepting balls. 839 [2025-04-26 16:23:29,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1751 states to 1751 states and 5718 transitions. [2025-04-26 16:23:29,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2025-04-26 16:23:29,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2025-04-26 16:23:29,045 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1751 states and 5718 transitions. [2025-04-26 16:23:29,045 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:29,045 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1751 states and 5718 transitions. [2025-04-26 16:23:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states and 5718 transitions. [2025-04-26 16:23:29,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1671. [2025-04-26 16:23:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1671 states have (on average 3.2926391382405744) internal successors, (in total 5502), 1670 states have internal predecessors, (5502), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 5502 transitions. [2025-04-26 16:23:29,100 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1671 states and 5502 transitions. [2025-04-26 16:23:29,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:23:29,100 INFO L438 stractBuchiCegarLoop]: Abstraction has 1671 states and 5502 transitions. [2025-04-26 16:23:29,100 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:29,100 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1671 states and 5502 transitions. [2025-04-26 16:23:29,108 INFO L131 ngComponentsAnalysis]: Automaton has 108 accepting balls. 809 [2025-04-26 16:23:29,108 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:29,108 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:29,108 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:29,108 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:29,109 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" [2025-04-26 16:23:29,109 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:23:29,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:29,109 INFO L85 PathProgramCache]: Analyzing trace with hash -359318555, now seen corresponding path program 1 times [2025-04-26 16:23:29,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:29,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138637947] [2025-04-26 16:23:29,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:29,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:29,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:29,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:29,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,115 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:29,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:29,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:29,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:29,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:29,118 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 1 times [2025-04-26 16:23:29,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:29,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393068041] [2025-04-26 16:23:29,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:29,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:29,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:29,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:29,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,123 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:29,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:29,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:29,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:29,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:29,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1503059781, now seen corresponding path program 1 times [2025-04-26 16:23:29,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:29,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889857052] [2025-04-26 16:23:29,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:29,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:29,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:29,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:29,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:29,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:29,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889857052] [2025-04-26 16:23:29,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889857052] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:29,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:29,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:23:29,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678140988] [2025-04-26 16:23:29,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:29,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:29,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:23:29,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:23:29,246 INFO L87 Difference]: Start difference. First operand 1671 states and 5502 transitions. cyclomatic complexity: 3974 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:29,283 INFO L93 Difference]: Finished difference Result 1924 states and 6113 transitions. [2025-04-26 16:23:29,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1924 states and 6113 transitions. [2025-04-26 16:23:29,295 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 629 [2025-04-26 16:23:29,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1924 states to 1762 states and 5573 transitions. [2025-04-26 16:23:29,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1146 [2025-04-26 16:23:29,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1146 [2025-04-26 16:23:29,312 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1762 states and 5573 transitions. [2025-04-26 16:23:29,313 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:29,313 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1762 states and 5573 transitions. [2025-04-26 16:23:29,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states and 5573 transitions. [2025-04-26 16:23:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1678. [2025-04-26 16:23:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1678 states have (on average 3.1871275327771156) internal successors, (in total 5348), 1677 states have internal predecessors, (5348), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 5348 transitions. [2025-04-26 16:23:29,349 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1678 states and 5348 transitions. [2025-04-26 16:23:29,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:23:29,351 INFO L438 stractBuchiCegarLoop]: Abstraction has 1678 states and 5348 transitions. [2025-04-26 16:23:29,351 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:23:29,351 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1678 states and 5348 transitions. [2025-04-26 16:23:29,358 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 629 [2025-04-26 16:23:29,359 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:29,359 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:29,359 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:29,359 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:29,360 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[118] L53-->L53-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[119] L53-1-->L58: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:23:29,360 INFO L754 eck$LassoCheckResult]: Loop: "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[119] L53-1-->L58: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:23:29,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:29,360 INFO L85 PathProgramCache]: Analyzing trace with hash 653310784, now seen corresponding path program 1 times [2025-04-26 16:23:29,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:29,361 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904773458] [2025-04-26 16:23:29,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:29,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:29,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:29,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:29,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,367 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:29,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:29,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:29,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:29,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:29,373 INFO L85 PathProgramCache]: Analyzing trace with hash 143530301, now seen corresponding path program 2 times [2025-04-26 16:23:29,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:29,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056480982] [2025-04-26 16:23:29,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:29,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:29,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:29,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:29,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,378 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:29,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:29,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:29,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:29,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:29,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1836001596, now seen corresponding path program 1 times [2025-04-26 16:23:29,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:29,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710161130] [2025-04-26 16:23:29,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:29,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:29,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:29,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:29,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:29,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:29,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710161130] [2025-04-26 16:23:29,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710161130] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:29,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:29,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:23:29,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624809896] [2025-04-26 16:23:29,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:29,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:29,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:23:29,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:23:29,527 INFO L87 Difference]: Start difference. First operand 1678 states and 5348 transitions. cyclomatic complexity: 3786 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:29,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:29,582 INFO L93 Difference]: Finished difference Result 4281 states and 13510 transitions. [2025-04-26 16:23:29,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4281 states and 13510 transitions. [2025-04-26 16:23:29,611 INFO L131 ngComponentsAnalysis]: Automaton has 218 accepting balls. 1359 [2025-04-26 16:23:29,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4281 states to 4053 states and 12774 transitions. [2025-04-26 16:23:29,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2535 [2025-04-26 16:23:29,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2535 [2025-04-26 16:23:29,645 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4053 states and 12774 transitions. [2025-04-26 16:23:29,645 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:29,645 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4053 states and 12774 transitions. [2025-04-26 16:23:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4053 states and 12774 transitions. [2025-04-26 16:23:29,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4053 to 3575. [2025-04-26 16:23:29,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3575 states, 3575 states have (on average 3.2201398601398603) internal successors, (in total 11512), 3574 states have internal predecessors, (11512), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3575 states to 3575 states and 11512 transitions. [2025-04-26 16:23:29,757 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3575 states and 11512 transitions. [2025-04-26 16:23:29,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:23:29,757 INFO L438 stractBuchiCegarLoop]: Abstraction has 3575 states and 11512 transitions. [2025-04-26 16:23:29,757 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:23:29,757 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3575 states and 11512 transitions. [2025-04-26 16:23:29,774 INFO L131 ngComponentsAnalysis]: Automaton has 180 accepting balls. 1169 [2025-04-26 16:23:29,774 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:29,774 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:29,775 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:29,775 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:29,775 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[105] L32-1-->L40: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[118] L53-->L53-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[119] L53-1-->L58: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" [2025-04-26 16:23:29,775 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:23:29,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:29,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1543934937, now seen corresponding path program 1 times [2025-04-26 16:23:29,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:29,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999164049] [2025-04-26 16:23:29,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:29,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:29,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:29,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:29,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,787 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:29,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:29,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:29,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:29,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 2 times [2025-04-26 16:23:29,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:29,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561037654] [2025-04-26 16:23:29,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:29,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:29,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:29,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:29,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:29,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,806 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:29,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:29,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:29,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:29,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:29,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1986748089, now seen corresponding path program 1 times [2025-04-26 16:23:29,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:29,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546461924] [2025-04-26 16:23:29,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:29,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:29,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:29,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:29,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,830 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:29,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:29,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:29,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:30,130 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:30,130 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:30,130 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:30,130 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:30,130 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:30,130 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,130 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:30,130 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:30,130 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:23:30,130 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:30,130 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:30,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,533 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:30,533 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:30,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,536 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:30,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:23:30,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:30,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,553 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:23:30,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,562 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:30,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:23:30,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:30,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,580 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:30,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,587 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:30,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:23:30,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:30,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,610 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:23:30,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,618 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:30,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:23:30,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:30,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,636 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:23:30,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,644 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:30,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:23:30,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:30,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,663 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:30,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,672 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:30,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:23:30,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:30,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,691 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:23:30,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,701 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:30,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:23:30,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:30,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,720 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:30,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,729 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:30,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:23:30,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:30,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,746 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:23:30,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,754 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:30,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:23:30,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:30,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,772 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:30,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,781 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:30,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:23:30,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:30,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,804 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:30,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,813 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:30,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:23:30,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:30,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,827 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:23:30,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,855 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:23:30,855 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:23:30,897 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:30,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,906 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:30,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:23:30,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:30,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,926 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:30,934 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:23:30,935 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:23:30,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,937 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:30,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:23:30,942 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:30,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:23:30,963 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:30,963 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:30,963 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2025-04-26 16:23:30,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:30,976 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:23:30,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:30,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:30,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:30,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:30,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:30,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:31,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:31,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:31,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:31,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:31,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:31,065 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:31,065 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3575 states and 11512 transitions. cyclomatic complexity: 8167 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:31,184 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3575 states and 11512 transitions. cyclomatic complexity: 8167. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 9940 states and 33178 transitions. Complement of second has 5 states. [2025-04-26 16:23:31,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:31,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:31,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-04-26 16:23:31,186 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 77 transitions. Stem has 14 letters. Loop has 5 letters. [2025-04-26 16:23:31,186 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:31,186 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 77 transitions. Stem has 19 letters. Loop has 5 letters. [2025-04-26 16:23:31,186 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:31,186 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 77 transitions. Stem has 14 letters. Loop has 10 letters. [2025-04-26 16:23:31,186 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:31,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9940 states and 33178 transitions. [2025-04-26 16:23:31,262 INFO L131 ngComponentsAnalysis]: Automaton has 180 accepting balls. 1169 [2025-04-26 16:23:31,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9940 states to 7669 states and 25120 transitions. [2025-04-26 16:23:31,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3420 [2025-04-26 16:23:31,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4319 [2025-04-26 16:23:31,337 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7669 states and 25120 transitions. [2025-04-26 16:23:31,337 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:31,337 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7669 states and 25120 transitions. [2025-04-26 16:23:31,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7669 states and 25120 transitions. [2025-04-26 16:23:31,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7669 to 6088. [2025-04-26 16:23:31,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6088 states, 6088 states have (on average 3.3771353482260182) internal successors, (in total 20560), 6087 states have internal predecessors, (20560), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:31,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6088 states to 6088 states and 20560 transitions. [2025-04-26 16:23:31,517 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6088 states and 20560 transitions. [2025-04-26 16:23:31,517 INFO L438 stractBuchiCegarLoop]: Abstraction has 6088 states and 20560 transitions. [2025-04-26 16:23:31,517 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:23:31,517 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6088 states and 20560 transitions. [2025-04-26 16:23:31,540 INFO L131 ngComponentsAnalysis]: Automaton has 180 accepting balls. 1169 [2025-04-26 16:23:31,540 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:31,540 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:31,540 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:31,540 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:31,541 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[118] L53-->L53-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[119] L53-1-->L58: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:23:31,541 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:23:31,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:31,541 INFO L85 PathProgramCache]: Analyzing trace with hash -2009471551, now seen corresponding path program 2 times [2025-04-26 16:23:31,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:31,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873665959] [2025-04-26 16:23:31,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:31,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:31,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:31,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:31,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:31,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:31,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:31,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:31,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:31,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:31,552 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 3 times [2025-04-26 16:23:31,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:31,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594657128] [2025-04-26 16:23:31,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:31,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:31,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:31,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:31,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:31,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,561 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:31,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:31,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:31,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:31,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash -911196065, now seen corresponding path program 2 times [2025-04-26 16:23:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:31,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843420164] [2025-04-26 16:23:31,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:31,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:31,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:31,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:31,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:31,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,575 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:31,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:31,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:31,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:31,867 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:31,867 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:31,867 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:31,867 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:31,867 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:31,867 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:31,867 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:31,868 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:31,868 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:23:31,868 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:31,868 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:31,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:32,209 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:32,210 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:32,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:32,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:32,215 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:32,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:23:32,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:32,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:32,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:32,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:32,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:32,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:32,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:32,231 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:32,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:23:32,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:32,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:32,238 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:32,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:23:32,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:32,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:32,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:32,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:32,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:32,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:32,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:32,257 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:32,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:23:32,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:32,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:32,265 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:32,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:23:32,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:32,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:32,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:32,278 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:23:32,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:32,325 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:23:32,325 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:23:32,369 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:32,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:32,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:32,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:32,402 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:32,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:23:32,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:32,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:32,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:32,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:32,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:32,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:32,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:32,428 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:32,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:32,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:32,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:32,441 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:32,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:23:32,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:32,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:32,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:32,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:32,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:32,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:32,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:32,468 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:32,477 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:23:32,477 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:32,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:32,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:32,479 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:32,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:23:32,482 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:32,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:23:32,498 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:32,498 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:32,498 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2025-04-26 16:23:32,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:23:32,512 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:23:32,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:32,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:32,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:32,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:32,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:32,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:32,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:32,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:32,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:32,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:32,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:32,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:32,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:32,579 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:32,579 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6088 states and 20560 transitions. cyclomatic complexity: 14906 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:32,717 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6088 states and 20560 transitions. cyclomatic complexity: 14906. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 19204 states and 65117 transitions. Complement of second has 5 states. [2025-04-26 16:23:32,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-04-26 16:23:32,718 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 76 transitions. Stem has 14 letters. Loop has 5 letters. [2025-04-26 16:23:32,718 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:32,718 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 76 transitions. Stem has 19 letters. Loop has 5 letters. [2025-04-26 16:23:32,718 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:32,718 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 76 transitions. Stem has 14 letters. Loop has 10 letters. [2025-04-26 16:23:32,718 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:32,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19204 states and 65117 transitions. [2025-04-26 16:23:32,889 INFO L131 ngComponentsAnalysis]: Automaton has 180 accepting balls. 1169 [2025-04-26 16:23:33,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19204 states to 14830 states and 49131 transitions. [2025-04-26 16:23:33,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5870 [2025-04-26 16:23:33,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6686 [2025-04-26 16:23:33,019 INFO L74 IsDeterministic]: Start isDeterministic. Operand 14830 states and 49131 transitions. [2025-04-26 16:23:33,019 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:33,019 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14830 states and 49131 transitions. [2025-04-26 16:23:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14830 states and 49131 transitions. [2025-04-26 16:23:33,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14830 to 7663. [2025-04-26 16:23:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7663 states, 7663 states have (on average 3.3747879420592457) internal successors, (in total 25861), 7662 states have internal predecessors, (25861), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7663 states to 7663 states and 25861 transitions. [2025-04-26 16:23:33,270 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7663 states and 25861 transitions. [2025-04-26 16:23:33,270 INFO L438 stractBuchiCegarLoop]: Abstraction has 7663 states and 25861 transitions. [2025-04-26 16:23:33,270 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:23:33,270 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7663 states and 25861 transitions. [2025-04-26 16:23:33,306 INFO L131 ngComponentsAnalysis]: Automaton has 180 accepting balls. 1169 [2025-04-26 16:23:33,306 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:33,306 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:33,307 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:33,307 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:33,307 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[106] L32-1-->L33: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[108] L33-->L33-1: Formula: (and (= 1 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[125] L73-1-->thread3FINAL: Formula: (not v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" [2025-04-26 16:23:33,308 INFO L754 eck$LassoCheckResult]: Loop: "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[119] L53-1-->L58: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" [2025-04-26 16:23:33,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:33,308 INFO L85 PathProgramCache]: Analyzing trace with hash 450143801, now seen corresponding path program 1 times [2025-04-26 16:23:33,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:33,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421946565] [2025-04-26 16:23:33,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:33,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:33,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:33,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:33,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:33,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:33,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:33,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421946565] [2025-04-26 16:23:33,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421946565] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:33,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:33,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:23:33,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252708194] [2025-04-26 16:23:33,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:33,329 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:23:33,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:33,329 INFO L85 PathProgramCache]: Analyzing trace with hash 26157701, now seen corresponding path program 3 times [2025-04-26 16:23:33,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:33,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387028798] [2025-04-26 16:23:33,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:33,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:33,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:33,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:33,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:33,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:33,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:33,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:33,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:33,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:33,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:33,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:33,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:33,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:23:33,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:23:33,411 INFO L87 Difference]: Start difference. First operand 7663 states and 25861 transitions. cyclomatic complexity: 18674 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:33,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:33,481 INFO L93 Difference]: Finished difference Result 8328 states and 27745 transitions. [2025-04-26 16:23:33,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8328 states and 27745 transitions. [2025-04-26 16:23:33,537 INFO L131 ngComponentsAnalysis]: Automaton has 189 accepting balls. 1223 [2025-04-26 16:23:33,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8328 states to 8328 states and 27745 transitions. [2025-04-26 16:23:33,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3881 [2025-04-26 16:23:33,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3881 [2025-04-26 16:23:33,706 INFO L74 IsDeterministic]: Start isDeterministic. Operand 8328 states and 27745 transitions. [2025-04-26 16:23:33,706 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:33,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8328 states and 27745 transitions. [2025-04-26 16:23:33,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8328 states and 27745 transitions. [2025-04-26 16:23:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8328 to 7873. [2025-04-26 16:23:33,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7873 states, 7873 states have (on average 3.352851517845802) internal successors, (in total 26397), 7872 states have internal predecessors, (26397), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7873 states to 7873 states and 26397 transitions. [2025-04-26 16:23:33,860 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7873 states and 26397 transitions. [2025-04-26 16:23:33,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:23:33,862 INFO L438 stractBuchiCegarLoop]: Abstraction has 7873 states and 26397 transitions. [2025-04-26 16:23:33,862 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:23:33,862 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7873 states and 26397 transitions. [2025-04-26 16:23:33,891 INFO L131 ngComponentsAnalysis]: Automaton has 189 accepting balls. 1223 [2025-04-26 16:23:33,891 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:33,891 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:33,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:33,892 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:33,892 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[106] L32-1-->L33: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[108] L33-->L33-1: Formula: (and (= 1 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[118] L53-->L53-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[119] L53-1-->L58: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[119] L53-1-->L58: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:23:33,893 INFO L754 eck$LassoCheckResult]: Loop: "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[119] L53-1-->L58: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:23:33,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:33,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1568984212, now seen corresponding path program 1 times [2025-04-26 16:23:33,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:33,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393902640] [2025-04-26 16:23:33,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:33,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:33,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:33,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:33,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:33,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:33,899 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:33,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:33,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:33,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:33,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:33,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:33,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:33,906 INFO L85 PathProgramCache]: Analyzing trace with hash 143530301, now seen corresponding path program 4 times [2025-04-26 16:23:33,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:33,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717845144] [2025-04-26 16:23:33,906 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:33,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:33,910 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 6 statements into 2 equivalence classes. [2025-04-26 16:23:33,911 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:33,911 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:33,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:33,911 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:33,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:33,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:33,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:33,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:33,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:33,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:33,916 INFO L85 PathProgramCache]: Analyzing trace with hash 176024464, now seen corresponding path program 2 times [2025-04-26 16:23:33,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:33,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722559733] [2025-04-26 16:23:33,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:33,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:33,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-26 16:23:33,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:23:33,923 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:33,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:33,994 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:33,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:33,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722559733] [2025-04-26 16:23:33,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722559733] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:23:33,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372145087] [2025-04-26 16:23:33,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:33,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:23:33,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:33,998 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:23:34,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-26 16:23:34,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-26 16:23:34,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:23:34,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:34,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:34,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:23:34,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:34,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:23:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:34,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372145087] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:23:34,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:23:34,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-04-26 16:23:34,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051688350] [2025-04-26 16:23:34,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:23:34,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:34,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:23:34,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:23:34,178 INFO L87 Difference]: Start difference. First operand 7873 states and 26397 transitions. cyclomatic complexity: 19013 Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (in total 35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:34,407 INFO L93 Difference]: Finished difference Result 16239 states and 53917 transitions. [2025-04-26 16:23:34,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16239 states and 53917 transitions. [2025-04-26 16:23:34,517 INFO L131 ngComponentsAnalysis]: Automaton has 408 accepting balls. 2318 [2025-04-26 16:23:34,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16239 states to 15446 states and 51373 transitions. [2025-04-26 16:23:34,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7286 [2025-04-26 16:23:34,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7286 [2025-04-26 16:23:34,620 INFO L74 IsDeterministic]: Start isDeterministic. Operand 15446 states and 51373 transitions. [2025-04-26 16:23:34,620 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:34,620 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15446 states and 51373 transitions. [2025-04-26 16:23:34,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15446 states and 51373 transitions. [2025-04-26 16:23:34,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15446 to 10682. [2025-04-26 16:23:34,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10682 states, 10682 states have (on average 3.3513387006178617) internal successors, (in total 35799), 10681 states have internal predecessors, (35799), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10682 states to 10682 states and 35799 transitions. [2025-04-26 16:23:34,904 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10682 states and 35799 transitions. [2025-04-26 16:23:34,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:23:34,905 INFO L438 stractBuchiCegarLoop]: Abstraction has 10682 states and 35799 transitions. [2025-04-26 16:23:34,905 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:23:34,905 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10682 states and 35799 transitions. [2025-04-26 16:23:34,942 INFO L131 ngComponentsAnalysis]: Automaton has 243 accepting balls. 1493 [2025-04-26 16:23:34,943 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:34,943 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:34,943 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:34,943 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:34,944 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[106] L32-1-->L33: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[108] L33-->L33-1: Formula: (and (= 1 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[118] L53-->L53-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[119] L53-1-->L58: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[118] L53-->L53-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[119] L53-1-->L58: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:23:34,944 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:23:34,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:34,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2102580099, now seen corresponding path program 1 times [2025-04-26 16:23:34,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:34,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697814711] [2025-04-26 16:23:34,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:34,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:34,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:23:34,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:34,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:34,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:34,952 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:34,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:23:34,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:34,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:34,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:34,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:34,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 4 times [2025-04-26 16:23:34,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:34,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174945301] [2025-04-26 16:23:34,963 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:34,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:34,966 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-04-26 16:23:34,968 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:34,968 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:34,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:34,968 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:34,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:34,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:34,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:34,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:34,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:34,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:34,971 INFO L85 PathProgramCache]: Analyzing trace with hash -80765987, now seen corresponding path program 1 times [2025-04-26 16:23:34,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:34,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921531681] [2025-04-26 16:23:34,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:34,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:34,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:23:34,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:23:34,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:34,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:34,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:34,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:23:34,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:23:34,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:34,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:34,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:35,483 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:35,483 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:35,483 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:35,483 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:35,484 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:35,484 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:35,484 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:35,484 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:35,484 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration9_Lasso [2025-04-26 16:23:35,484 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:35,484 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:35,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:35,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:35,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:35,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:35,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:35,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:35,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:35,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:35,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:35,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:35,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:35,909 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:35,909 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:35,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:35,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:35,911 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:35,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:23:35,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:35,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:35,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:35,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:35,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:35,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:35,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:35,926 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:35,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:23:35,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:35,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:35,933 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:35,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:23:35,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:35,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:35,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:35,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:35,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:35,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:35,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:35,947 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:35,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:23:35,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:35,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:35,954 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:35,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:23:35,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:35,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:35,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:35,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:35,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:35,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:35,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:35,970 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:35,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:23:35,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:35,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:35,978 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:35,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:23:35,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:35,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:35,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:35,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:35,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:35,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:35,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:35,994 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:35,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:35,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,001 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:36,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:23:36,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:36,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:36,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:36,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:36,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:36,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:36,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:36,023 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:36,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:36,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,031 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:36,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:23:36,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:36,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:36,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:36,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:36,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:36,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:36,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:36,049 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:36,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:36,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,057 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:36,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:23:36,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:36,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:36,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:36,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:36,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:36,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:36,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:36,073 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:36,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:36,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,081 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:36,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:23:36,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:36,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:36,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:36,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:36,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:36,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:36,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:36,096 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:36,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:23:36,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,103 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:36,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:23:36,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:36,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:36,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:36,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:36,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:36,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:36,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:36,118 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:36,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:23:36,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,125 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:36,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:23:36,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:36,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:36,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:36,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:36,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:36,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:36,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:36,140 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:36,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:23:36,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,147 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:36,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:23:36,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:36,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:36,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:36,159 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:23:36,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:36,178 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:23:36,178 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:23:36,211 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:36,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:23:36,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,220 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:36,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:23:36,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:36,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:36,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:36,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:36,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:36,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:36,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:36,237 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:36,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:23:36,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,244 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:36,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:23:36,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:36,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:36,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:36,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:36,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:36,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:36,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:36,261 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:36,269 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:36,269 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:36,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,288 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:36,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:23:36,290 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:36,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 16:23:36,305 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:36,305 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:36,305 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2025-04-26 16:23:36,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 16:23:36,317 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-04-26 16:23:36,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:36,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:23:36,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:36,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:36,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:36,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:36,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:36,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:36,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:36,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:36,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:36,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:36,383 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:36,383 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10682 states and 35799 transitions. cyclomatic complexity: 25738 Second operand has 4 states, 4 states have (on average 6.75) internal successors, (in total 27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:36,547 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10682 states and 35799 transitions. cyclomatic complexity: 25738. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (in total 27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 22885 states and 75989 transitions. Complement of second has 5 states. [2025-04-26 16:23:36,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (in total 27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-26 16:23:36,548 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 24 letters. Loop has 5 letters. [2025-04-26 16:23:36,548 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:36,548 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:36,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:36,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:23:36,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:36,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:36,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:36,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:36,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:36,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:36,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:36,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:36,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:36,612 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:36,612 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10682 states and 35799 transitions. cyclomatic complexity: 25738 Second operand has 4 states, 4 states have (on average 6.75) internal successors, (in total 27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:36,848 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10682 states and 35799 transitions. cyclomatic complexity: 25738. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (in total 27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 30977 states and 104629 transitions. Complement of second has 7 states. [2025-04-26 16:23:36,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:36,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (in total 27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:36,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-04-26 16:23:36,849 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 24 letters. Loop has 5 letters. [2025-04-26 16:23:36,849 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:36,849 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:36,857 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:36,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:23:36,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:36,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:36,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:36,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:36,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:36,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:36,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:36,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:36,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:36,908 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:36,908 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10682 states and 35799 transitions. cyclomatic complexity: 25738 Second operand has 4 states, 4 states have (on average 6.75) internal successors, (in total 27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:37,040 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10682 states and 35799 transitions. cyclomatic complexity: 25738. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (in total 27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 24286 states and 82591 transitions. Complement of second has 5 states. [2025-04-26 16:23:37,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (in total 27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-04-26 16:23:37,041 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 89 transitions. Stem has 24 letters. Loop has 5 letters. [2025-04-26 16:23:37,042 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:37,042 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 89 transitions. Stem has 29 letters. Loop has 5 letters. [2025-04-26 16:23:37,042 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:37,042 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 89 transitions. Stem has 24 letters. Loop has 10 letters. [2025-04-26 16:23:37,042 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:37,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24286 states and 82591 transitions. [2025-04-26 16:23:37,212 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 1119 [2025-04-26 16:23:37,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24286 states to 10158 states and 33211 transitions. [2025-04-26 16:23:37,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2673 [2025-04-26 16:23:37,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3305 [2025-04-26 16:23:37,271 INFO L74 IsDeterministic]: Start isDeterministic. Operand 10158 states and 33211 transitions. [2025-04-26 16:23:37,271 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:37,271 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10158 states and 33211 transitions. [2025-04-26 16:23:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10158 states and 33211 transitions. [2025-04-26 16:23:37,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10158 to 4448. [2025-04-26 16:23:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4448 states, 4448 states have (on average 3.347796762589928) internal successors, (in total 14891), 4447 states have internal predecessors, (14891), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4448 states to 4448 states and 14891 transitions. [2025-04-26 16:23:37,496 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4448 states and 14891 transitions. [2025-04-26 16:23:37,496 INFO L438 stractBuchiCegarLoop]: Abstraction has 4448 states and 14891 transitions. [2025-04-26 16:23:37,496 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:23:37,496 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4448 states and 14891 transitions. [2025-04-26 16:23:37,507 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 966 [2025-04-26 16:23:37,508 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:37,508 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:37,508 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:37,508 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:37,508 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[106] L32-1-->L33: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[108] L33-->L33-1: Formula: (and (= 1 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[108] L33-->L33-1: Formula: (and (= 1 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" [2025-04-26 16:23:37,509 INFO L754 eck$LassoCheckResult]: Loop: "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[119] L53-1-->L58: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" [2025-04-26 16:23:37,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:37,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1998189171, now seen corresponding path program 1 times [2025-04-26 16:23:37,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:37,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913880051] [2025-04-26 16:23:37,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:37,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:37,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:37,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:37,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,513 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:37,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:37,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:37,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:37,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:37,522 INFO L85 PathProgramCache]: Analyzing trace with hash 26157701, now seen corresponding path program 5 times [2025-04-26 16:23:37,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:37,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722698409] [2025-04-26 16:23:37,522 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:23:37,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:37,528 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:37,529 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:37,529 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:37,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,530 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:37,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:37,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:37,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:37,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:37,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1692391185, now seen corresponding path program 3 times [2025-04-26 16:23:37,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:37,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910242184] [2025-04-26 16:23:37,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:37,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:37,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-26 16:23:37,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:23:37,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 16:23:37,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,539 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:37,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:23:37,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:23:37,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:37,758 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:37,758 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:37,758 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:37,758 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:37,758 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:37,758 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,758 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:37,759 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:37,759 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration10_Lasso [2025-04-26 16:23:37,759 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:37,759 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:37,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,994 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:37,994 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:37,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:37,996 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:37,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:23:37,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:38,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:38,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:38,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:38,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:38,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:38,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:38,014 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:38,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 16:23:38,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,021 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:38,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:23:38,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:38,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:38,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:38,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:38,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:38,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:38,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:38,035 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:38,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 16:23:38,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,042 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:38,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:23:38,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:38,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:38,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:38,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:38,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:38,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:38,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:38,056 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:38,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 16:23:38,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,063 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:38,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:23:38,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:38,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:38,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:38,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:38,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:38,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:38,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:38,081 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:38,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:38,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,088 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:38,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:23:38,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:38,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:38,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:38,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:38,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:38,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:38,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:38,106 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:38,111 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:38,111 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:23:38,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,113 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:38,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:23:38,115 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:38,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-04-26 16:23:38,130 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:38,130 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:38,130 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 16:23:38,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:38,144 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-04-26 16:23:38,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:38,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:38,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:38,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:38,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:38,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:38,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:38,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:38,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:38,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:38,194 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:38,194 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4448 states and 14891 transitions. cyclomatic complexity: 10566 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (in total 18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:38,230 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4448 states and 14891 transitions. cyclomatic complexity: 10566. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (in total 18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 5709 states and 18982 transitions. Complement of second has 4 states. [2025-04-26 16:23:38,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (in total 18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-04-26 16:23:38,231 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 72 transitions. Stem has 16 letters. Loop has 6 letters. [2025-04-26 16:23:38,232 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:38,232 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 72 transitions. Stem has 22 letters. Loop has 6 letters. [2025-04-26 16:23:38,232 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:38,232 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 72 transitions. Stem has 16 letters. Loop has 12 letters. [2025-04-26 16:23:38,232 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:38,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5709 states and 18982 transitions. [2025-04-26 16:23:38,256 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 540 [2025-04-26 16:23:38,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5709 states to 3700 states and 12163 transitions. [2025-04-26 16:23:38,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 897 [2025-04-26 16:23:38,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 897 [2025-04-26 16:23:38,271 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3700 states and 12163 transitions. [2025-04-26 16:23:38,271 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:38,271 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3700 states and 12163 transitions. [2025-04-26 16:23:38,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3700 states and 12163 transitions. [2025-04-26 16:23:38,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3700 to 3700. [2025-04-26 16:23:38,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3700 states, 3700 states have (on average 3.287297297297297) internal successors, (in total 12163), 3699 states have internal predecessors, (12163), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3700 states and 12163 transitions. [2025-04-26 16:23:38,315 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3700 states and 12163 transitions. [2025-04-26 16:23:38,315 INFO L438 stractBuchiCegarLoop]: Abstraction has 3700 states and 12163 transitions. [2025-04-26 16:23:38,315 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:23:38,316 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3700 states and 12163 transitions. [2025-04-26 16:23:38,324 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 540 [2025-04-26 16:23:38,325 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:38,325 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:38,325 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:38,325 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:38,325 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[106] L32-1-->L33: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[108] L33-->L33-1: Formula: (and (= 1 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[108] L33-->L33-1: Formula: (and (= 1 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[108] L33-->L33-1: Formula: (and (= 1 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" [2025-04-26 16:23:38,325 INFO L754 eck$LassoCheckResult]: Loop: "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[119] L53-1-->L58: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" [2025-04-26 16:23:38,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1998189139, now seen corresponding path program 1 times [2025-04-26 16:23:38,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692337868] [2025-04-26 16:23:38,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:38,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:38,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:38,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:38,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:38,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:38,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:38,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,332 INFO L85 PathProgramCache]: Analyzing trace with hash 26157701, now seen corresponding path program 6 times [2025-04-26 16:23:38,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672540096] [2025-04-26 16:23:38,332 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:23:38,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,334 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:38,335 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:38,335 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:23:38,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,335 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:38,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:38,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:38,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:38,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash 27737905, now seen corresponding path program 1 times [2025-04-26 16:23:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263845416] [2025-04-26 16:23:38,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:38,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:23:38,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:23:38,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,347 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:38,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:23:38,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:23:38,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:38,747 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:38,747 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:38,747 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:38,747 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:38,747 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:38,747 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,747 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:38,747 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:38,747 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration11_Lasso [2025-04-26 16:23:38,747 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:38,747 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:38,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,021 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:39,022 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:39,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:39,026 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:39,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 16:23:39,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:39,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:39,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:39,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:39,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:39,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:39,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:39,042 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:39,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:39,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:39,052 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:39,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 16:23:39,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:39,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:39,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:39,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:39,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:39,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:39,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:39,068 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:39,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:39,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:39,076 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:39,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 16:23:39,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:39,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:39,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:39,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:39,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:39,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:39,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:39,094 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:39,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 16:23:39,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:39,103 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:39,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 16:23:39,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:39,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:39,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:39,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:39,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:39,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:39,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:39,119 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:39,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:39,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:39,127 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:39,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 16:23:39,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:39,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:39,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:39,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:39,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:39,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:39,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:39,143 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:39,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:39,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:39,151 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:39,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 16:23:39,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:39,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:39,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:39,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:39,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:39,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:39,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:39,170 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:39,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:39,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:39,179 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:39,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 16:23:39,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:39,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:39,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:39,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:39,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:39,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:39,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:39,197 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:39,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:39,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:39,206 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:39,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 16:23:39,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:39,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:39,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:39,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:39,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:39,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:39,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:39,224 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:39,229 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:23:39,229 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:39,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:39,231 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:39,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 16:23:39,232 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:39,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-04-26 16:23:39,247 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:39,247 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:39,247 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 16:23:39,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:39,255 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:23:39,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:39,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:39,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:39,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:39,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:39,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:39,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:39,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:39,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:39,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:39,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:39,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:39,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:39,315 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:39,315 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3700 states and 12163 transitions. cyclomatic complexity: 8553 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:39,345 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3700 states and 12163 transitions. cyclomatic complexity: 8553. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 4753 states and 15232 transitions. Complement of second has 5 states. [2025-04-26 16:23:39,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:39,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-04-26 16:23:39,346 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 16 letters. Loop has 6 letters. [2025-04-26 16:23:39,346 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:39,346 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:39,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:39,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:39,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:39,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:39,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:39,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:39,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:39,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:39,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:39,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:39,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:39,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:39,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:39,404 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:39,404 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3700 states and 12163 transitions. cyclomatic complexity: 8553 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:39,444 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3700 states and 12163 transitions. cyclomatic complexity: 8553. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 5891 states and 18951 transitions. Complement of second has 7 states. [2025-04-26 16:23:39,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-26 16:23:39,445 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 16 letters. Loop has 6 letters. [2025-04-26 16:23:39,445 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:39,445 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:39,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:39,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:39,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:39,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:39,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:39,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:39,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:39,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:39,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:39,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:39,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:39,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:39,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:39,510 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:39,510 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3700 states and 12163 transitions. cyclomatic complexity: 8553 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:39,556 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3700 states and 12163 transitions. cyclomatic complexity: 8553. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 8964 states and 29367 transitions. Complement of second has 5 states. [2025-04-26 16:23:39,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:39,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-04-26 16:23:39,557 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 16 letters. Loop has 6 letters. [2025-04-26 16:23:39,557 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:39,557 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 22 letters. Loop has 6 letters. [2025-04-26 16:23:39,557 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:39,557 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 16 letters. Loop has 12 letters. [2025-04-26 16:23:39,557 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:39,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8964 states and 29367 transitions. [2025-04-26 16:23:39,600 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:39,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8964 states to 0 states and 0 transitions. [2025-04-26 16:23:39,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:23:39,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:23:39,601 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:23:39,601 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:39,601 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:39,601 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:39,601 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:39,601 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 16:23:39,601 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:23:39,601 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:39,601 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:23:39,607 INFO L201 PluginConnector]: Adding new model queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:39 BoogieIcfgContainer [2025-04-26 16:23:39,607 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:39,608 INFO L158 Benchmark]: Toolchain (without parser) took 12610.92ms. Allocated memory was 159.4MB in the beginning and 604.0MB in the end (delta: 444.6MB). Free memory was 84.7MB in the beginning and 205.5MB in the end (delta: -120.8MB). Peak memory consumption was 321.1MB. Max. memory is 8.0GB. [2025-04-26 16:23:39,609 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.68ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:39,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.14ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 82.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:39,609 INFO L158 Benchmark]: Boogie Preprocessor took 40.90ms. Allocated memory is still 159.4MB. Free memory was 82.8MB in the beginning and 81.8MB in the end (delta: 994.4kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:23:39,609 INFO L158 Benchmark]: RCFGBuilder took 272.23ms. Allocated memory is still 159.4MB. Free memory was 81.8MB in the beginning and 70.6MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:23:39,609 INFO L158 Benchmark]: BuchiAutomizer took 12243.44ms. Allocated memory was 159.4MB in the beginning and 604.0MB in the end (delta: 444.6MB). Free memory was 70.4MB in the beginning and 205.5MB in the end (delta: -135.1MB). Peak memory consumption was 308.5MB. Max. memory is 8.0GB. [2025-04-26 16:23:39,610 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.68ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.14ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 82.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 40.90ms. Allocated memory is still 159.4MB. Free memory was 82.8MB in the beginning and 81.8MB in the end (delta: 994.4kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 272.23ms. Allocated memory is still 159.4MB. Free memory was 81.8MB in the beginning and 70.6MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 12243.44ms. Allocated memory was 159.4MB in the beginning and 604.0MB in the end (delta: 444.6MB). Free memory was 70.4MB in the beginning and 205.5MB in the end (delta: -135.1MB). Peak memory consumption was 308.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.1s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 6.5s. Construction of modules took 0.2s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 1.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 20606 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 1.2s Buchi closure took 0.1s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 826 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 816 mSDsluCounter, 942 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 416 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 394 IncrementalHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 526 mSDtfsCounter, 394 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU1 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf100 lsp61 ukn98 mio100 lsp61 div100 bol113 ite100 ukn100 eq181 hnf91 smp100 dnf252 smp64 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 86ms VariablesStem: 9 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (5 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One nondeterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One nondeterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:23:39,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-26 16:23:39,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...