/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-2-nl.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:26,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:26,706 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,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:26,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:26,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:26,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:26,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:26,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:26,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:26,726 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:26,726 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:26,726 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:26,726 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:26,726 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:26,726 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:26,726 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:26,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:26,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:26,727 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:26,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:26,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:26,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:26,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:26,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:26,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:26,727 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:26,727 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:26,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:26,727 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:26,727 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:26,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:26,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:26,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:26,727 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:26,728 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:26,728 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:26,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:26,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:26,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:26,964 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:26,965 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:26,966 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-2-nl.wvr.bpl [2025-04-26 16:23:26,967 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-2-nl.wvr.bpl' [2025-04-26 16:23:26,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:26,986 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:26,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:26,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:26,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:26,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,021 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:27,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:27,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:27,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:27,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:27,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,031 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:27,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:27,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:27,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:27,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:27,040 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-2-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 L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:27,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:27,064 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,066 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,085 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:27,085 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:27,085 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:27,085 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:27,086 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:27,086 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:27,086 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:27,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:27,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:27,087 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,121 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:27,122 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:27,199 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:27,200 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:27,214 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:27,214 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:27,214 INFO L201 PluginConnector]: Adding new model queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:27 BoogieIcfgContainer [2025-04-26 16:23:27,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:27,215 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:27,215 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:27,221 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:27,222 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:27,222 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/2) ... [2025-04-26 16:23:27,223 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50490883 and model type queue-add-2-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,223 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:27,224 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2-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,225 INFO L376 chiAutomizerObserver]: Analyzing ICFG queue-add-2-nl.wvr.bpl [2025-04-26 16:23:27,265 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:23:27,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 31 transitions, 76 flow [2025-04-26 16:23:27,323 INFO L116 PetriNetUnfolderBase]: 2/27 cut-off events. [2025-04-26 16:23:27,325 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:23:27,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 2/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 16:23:27,328 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 31 transitions, 76 flow [2025-04-26 16:23:27,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 27 transitions, 66 flow [2025-04-26 16:23:27,333 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 32 places, 27 transitions, 66 flow [2025-04-26 16:23:27,342 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:27,342 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:27,342 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:27,342 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:27,342 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:27,342 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:27,342 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:27,342 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:27,344 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:27,380 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 70 [2025-04-26 16:23:27,380 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:27,380 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:27,384 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:23:27,384 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:27,384 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:27,384 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 105 states, but on-demand construction may add more states [2025-04-26 16:23:27,388 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 70 [2025-04-26 16:23:27,388 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:27,388 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:27,388 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:23:27,388 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:27,392 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[]" "[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" [2025-04-26 16:23:27,392 INFO L754 eck$LassoCheckResult]: Loop: "[72] L25-1-->L26: 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[]" "[74] L26-->L26-1: Formula: (and (= 1 (select v_q_4 v_q_back_10)) (= (+ v_q_back_10 1) v_q_back_9)) InVars {q=v_q_4, q_back=v_q_back_10} OutVars{q=v_q_4, q_back=v_q_back_9} AuxVars[] AssignedVars[q_back]" "[76] L26-1-->L31: 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]" "[78] L31-->L25-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,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:27,396 INFO L85 PathProgramCache]: Analyzing trace with hash 98092, now seen corresponding path program 1 times [2025-04-26 16:23:27,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:27,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755029418] [2025-04-26 16:23:27,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:27,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:27,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:27,448 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,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:27,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:27,453 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,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:27,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:27,465 INFO L85 PathProgramCache]: Analyzing trace with hash 3142021, now seen corresponding path program 1 times [2025-04-26 16:23:27,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:27,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803696516] [2025-04-26 16:23:27,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:27,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:27,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:27,473 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,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,473 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:27,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:27,477 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,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:27,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:27,480 INFO L85 PathProgramCache]: Analyzing trace with hash 397927216, now seen corresponding path program 1 times [2025-04-26 16:23:27,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:27,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792740019] [2025-04-26 16:23:27,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:27,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:27,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:27,487 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,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,487 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:27,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:27,493 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,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:27,624 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:27,625 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:27,625 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:27,625 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:27,625 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:27,625 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:27,625 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:27,625 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:27,625 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:23:27,625 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:27,625 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:27,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:27,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:27,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:27,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:27,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:27,774 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:27,777 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:27,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:27,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:27,781 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:27,783 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:27,784 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:27,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:27,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:27,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:27,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:27,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:27,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:27,810 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:27,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:23:27,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:27,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:27,819 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:27,822 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:27,823 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:27,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:27,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:27,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:27,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:27,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:27,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:27,870 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:27,887 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:23:27,887 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:27,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:27,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:27,891 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:27,892 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:27,893 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:27,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:23:27,911 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:27,911 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:27,911 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:23:27,918 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:27,920 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:27,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:27,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:27,969 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,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:27,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:27,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:27,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:27,984 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,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:27,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:27,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:28,020 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,071 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,073 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 105 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,152 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 105 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 242 states and 550 transitions. Complement of second has 7 states. [2025-04-26 16:23:28,154 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,158 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,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2025-04-26 16:23:28,166 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:23:28,167 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:28,167 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:23:28,167 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:28,167 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 3 letters. Loop has 8 letters. [2025-04-26 16:23:28,167 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:28,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 242 states and 550 transitions. [2025-04-26 16:23:28,174 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 50 [2025-04-26 16:23:28,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 242 states to 147 states and 337 transitions. [2025-04-26 16:23:28,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2025-04-26 16:23:28,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2025-04-26 16:23:28,179 INFO L74 IsDeterministic]: Start isDeterministic. Operand 147 states and 337 transitions. [2025-04-26 16:23:28,179 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:28,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 337 transitions. [2025-04-26 16:23:28,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 337 transitions. [2025-04-26 16:23:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 127. [2025-04-26 16:23:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 127 states have (on average 2.2913385826771653) internal successors, (in total 291), 126 states have internal predecessors, (291), 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,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 291 transitions. [2025-04-26 16:23:28,201 INFO L240 hiAutomatonCegarLoop]: Abstraction has 127 states and 291 transitions. [2025-04-26 16:23:28,201 INFO L438 stractBuchiCegarLoop]: Abstraction has 127 states and 291 transitions. [2025-04-26 16:23:28,202 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:28,202 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 291 transitions. [2025-04-26 16:23:28,203 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 50 [2025-04-26 16:23:28,203 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:28,203 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:28,203 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:28,203 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:28,204 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[]" "[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L44: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[80] L44-->L45-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" [2025-04-26 16:23:28,204 INFO L754 eck$LassoCheckResult]: Loop: "[82] L45-1-->L46: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[84] L46-->L46-1: Formula: (and (= v_q_front_10 (+ v_q_front_11 1)) (< v_q_front_11 v_q_back_17) (= (select v_q_10 v_q_front_11) v_j_6)) InVars {q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_11} OutVars{q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_10, j=v_j_6} AuxVars[] AssignedVars[j, q_front]" "[85] L46-1-->L52: Formula: (= (+ v_j_2 v_s_2) v_s_1) InVars {s=v_s_2, j=v_j_2} OutVars{s=v_s_1, j=v_j_2} AuxVars[] AssignedVars[s]" "[86] L52-->L53: 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]" "[87] L53-->L45-1: Formula: (let ((.cse0 (= v_j_3 0))) (or (and (not v_f_3) .cse0) (and (not .cse0) v_f_3))) InVars {j=v_j_3} OutVars{j=v_j_3, f=v_f_3} AuxVars[] AssignedVars[f]" [2025-04-26 16:23:28,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,205 INFO L85 PathProgramCache]: Analyzing trace with hash 94288161, now seen corresponding path program 1 times [2025-04-26 16:23:28,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:28,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470771637] [2025-04-26 16:23:28,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:28,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:28,209 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,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,209 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:28,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:28,211 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,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:28,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,212 INFO L85 PathProgramCache]: Analyzing trace with hash 106944755, now seen corresponding path program 1 times [2025-04-26 16:23:28,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:28,212 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194947072] [2025-04-26 16:23:28,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:28,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:28,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:28,218 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,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,218 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:28,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:28,221 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,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:28,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1163406381, now seen corresponding path program 1 times [2025-04-26 16:23:28,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:28,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140109385] [2025-04-26 16:23:28,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:28,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:28,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:28,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:28,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:28,274 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,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:28,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140109385] [2025-04-26 16:23:28,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140109385] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:28,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:28,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:23:28,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858226089] [2025-04-26 16:23:28,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:28,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:28,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:23:28,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:23:28,378 INFO L87 Difference]: Start difference. First operand 127 states and 291 transitions. cyclomatic complexity: 178 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 2 states have internal predecessors, (10), 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,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:28,396 INFO L93 Difference]: Finished difference Result 144 states and 312 transitions. [2025-04-26 16:23:28,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 312 transitions. [2025-04-26 16:23:28,398 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 45 [2025-04-26 16:23:28,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 144 states and 312 transitions. [2025-04-26 16:23:28,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2025-04-26 16:23:28,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2025-04-26 16:23:28,401 INFO L74 IsDeterministic]: Start isDeterministic. Operand 144 states and 312 transitions. [2025-04-26 16:23:28,401 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:28,401 INFO L218 hiAutomatonCegarLoop]: Abstraction has 144 states and 312 transitions. [2025-04-26 16:23:28,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 312 transitions. [2025-04-26 16:23:28,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-04-26 16:23:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 144 states have (on average 2.1666666666666665) internal successors, (in total 312), 143 states have internal predecessors, (312), 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,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 312 transitions. [2025-04-26 16:23:28,406 INFO L240 hiAutomatonCegarLoop]: Abstraction has 144 states and 312 transitions. [2025-04-26 16:23:28,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:23:28,408 INFO L438 stractBuchiCegarLoop]: Abstraction has 144 states and 312 transitions. [2025-04-26 16:23:28,408 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:28,408 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 144 states and 312 transitions. [2025-04-26 16:23:28,409 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 45 [2025-04-26 16:23:28,409 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:28,409 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:28,410 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:28,410 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:28,410 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[]" "[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[71] L25-1-->L33: 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[]" "[73] L33-->L33-1: Formula: (and (= (+ v_q_back_14 1) v_q_back_13) (= (select v_q_6 v_q_back_14) 0)) InVars {q=v_q_6, q_back=v_q_back_14} OutVars{q=v_q_6, q_back=v_q_back_13} AuxVars[] AssignedVars[q_back]" "[90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L44: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[80] L44-->L45-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" [2025-04-26 16:23:28,410 INFO L754 eck$LassoCheckResult]: Loop: "[82] L45-1-->L46: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[84] L46-->L46-1: Formula: (and (= v_q_front_10 (+ v_q_front_11 1)) (< v_q_front_11 v_q_back_17) (= (select v_q_10 v_q_front_11) v_j_6)) InVars {q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_11} OutVars{q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_10, j=v_j_6} AuxVars[] AssignedVars[j, q_front]" "[85] L46-1-->L52: Formula: (= (+ v_j_2 v_s_2) v_s_1) InVars {s=v_s_2, j=v_j_2} OutVars{s=v_s_1, j=v_j_2} AuxVars[] AssignedVars[s]" "[86] L52-->L53: 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]" "[87] L53-->L45-1: Formula: (let ((.cse0 (= v_j_3 0))) (or (and (not v_f_3) .cse0) (and (not .cse0) v_f_3))) InVars {j=v_j_3} OutVars{j=v_j_3, f=v_f_3} AuxVars[] AssignedVars[f]" [2025-04-26 16:23:28,410 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,410 INFO L85 PathProgramCache]: Analyzing trace with hash -550097939, now seen corresponding path program 1 times [2025-04-26 16:23:28,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:28,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555147119] [2025-04-26 16:23:28,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:28,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:28,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:28,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:28,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,416 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:28,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:28,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:28,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:28,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,422 INFO L85 PathProgramCache]: Analyzing trace with hash 106944755, now seen corresponding path program 2 times [2025-04-26 16:23:28,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:28,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036989302] [2025-04-26 16:23:28,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:28,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:28,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:28,432 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:28,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:28,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,432 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:28,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:28,436 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,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:28,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,438 INFO L85 PathProgramCache]: Analyzing trace with hash 738476167, now seen corresponding path program 1 times [2025-04-26 16:23:28,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:28,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791984928] [2025-04-26 16:23:28,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:28,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:28,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:28,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:28,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:28,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:28,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:28,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:28,594 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:28,594 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:28,594 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:28,594 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:28,594 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:28,594 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,594 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:28,594 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:28,594 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:23:28,594 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:28,594 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:28,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,835 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:28,836 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:28,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:28,839 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:28,841 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:28,842 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,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:28,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:28,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:28,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:28,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:28,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:28,856 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:28,861 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:28,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:28,863 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:28,864 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:28,865 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,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:28,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:28,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:28,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:28,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:28,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:28,881 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:28,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:23:28,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:28,889 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:28,890 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:28,892 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,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:28,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:28,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:28,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:28,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:28,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:28,909 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:28,915 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:23:28,916 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:28,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:28,918 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:28,919 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:28,921 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:28,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:28,937 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:28,937 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:28,937 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2025-04-26 16:23:28,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:28,943 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:28,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:28,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:28,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:28,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:28,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:28,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:28,984 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,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:28,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:28,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:29,024 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,025 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:29,025 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 144 states and 312 transitions. cyclomatic complexity: 181 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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,046 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 144 states and 312 transitions. cyclomatic complexity: 181. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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 367 states and 769 transitions. Complement of second has 5 states. [2025-04-26 16:23:29,046 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:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-26 16:23:29,047 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 8 letters. Loop has 5 letters. [2025-04-26 16:23:29,047 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:29,047 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 13 letters. Loop has 5 letters. [2025-04-26 16:23:29,047 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:29,047 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 8 letters. Loop has 10 letters. [2025-04-26 16:23:29,047 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:29,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 367 states and 769 transitions. [2025-04-26 16:23:29,051 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 45 [2025-04-26 16:23:29,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 367 states to 252 states and 557 transitions. [2025-04-26 16:23:29,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2025-04-26 16:23:29,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2025-04-26 16:23:29,054 INFO L74 IsDeterministic]: Start isDeterministic. Operand 252 states and 557 transitions. [2025-04-26 16:23:29,054 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:29,054 INFO L218 hiAutomatonCegarLoop]: Abstraction has 252 states and 557 transitions. [2025-04-26 16:23:29,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states and 557 transitions. [2025-04-26 16:23:29,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 219. [2025-04-26 16:23:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 219 states have (on average 2.2557077625570776) internal successors, (in total 494), 218 states have internal predecessors, (494), 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,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 494 transitions. [2025-04-26 16:23:29,069 INFO L240 hiAutomatonCegarLoop]: Abstraction has 219 states and 494 transitions. [2025-04-26 16:23:29,069 INFO L438 stractBuchiCegarLoop]: Abstraction has 219 states and 494 transitions. [2025-04-26 16:23:29,069 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:23:29,070 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 219 states and 494 transitions. [2025-04-26 16:23:29,071 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 45 [2025-04-26 16:23:29,071 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:29,071 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:29,071 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:29,071 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:29,073 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[]" "[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[71] L25-1-->L33: 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[]" "[90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L44: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[80] L44-->L45-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[73] L33-->L33-1: Formula: (and (= (+ v_q_back_14 1) v_q_back_13) (= (select v_q_6 v_q_back_14) 0)) InVars {q=v_q_6, q_back=v_q_back_14} OutVars{q=v_q_6, q_back=v_q_back_13} AuxVars[] AssignedVars[q_back]" [2025-04-26 16:23:29,074 INFO L754 eck$LassoCheckResult]: Loop: "[82] L45-1-->L46: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[84] L46-->L46-1: Formula: (and (= v_q_front_10 (+ v_q_front_11 1)) (< v_q_front_11 v_q_back_17) (= (select v_q_10 v_q_front_11) v_j_6)) InVars {q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_11} OutVars{q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_10, j=v_j_6} AuxVars[] AssignedVars[j, q_front]" "[85] L46-1-->L52: Formula: (= (+ v_j_2 v_s_2) v_s_1) InVars {s=v_s_2, j=v_j_2} OutVars{s=v_s_1, j=v_j_2} AuxVars[] AssignedVars[s]" "[86] L52-->L53: 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]" "[87] L53-->L45-1: Formula: (let ((.cse0 (= v_j_3 0))) (or (and (not v_f_3) .cse0) (and (not .cse0) v_f_3))) InVars {j=v_j_3} OutVars{j=v_j_3, f=v_f_3} AuxVars[] AssignedVars[f]" [2025-04-26 16:23:29,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:29,074 INFO L85 PathProgramCache]: Analyzing trace with hash -549602039, now seen corresponding path program 2 times [2025-04-26 16:23:29,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:29,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874569185] [2025-04-26 16:23:29,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:29,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:29,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:29,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:29,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:29,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,079 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:29,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:29,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:29,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:29,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash 106944755, now seen corresponding path program 3 times [2025-04-26 16:23:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:29,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511735125] [2025-04-26 16:23:29,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:29,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:29,088 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:29,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:29,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:29,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:29,090 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,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:29,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:29,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1227423509, now seen corresponding path program 2 times [2025-04-26 16:23:29,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:29,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716847516] [2025-04-26 16:23:29,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:29,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:29,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:29,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:29,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:29,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:29,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:29,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:29,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:29,236 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:29,236 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:29,236 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:29,236 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:29,236 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:29,236 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,236 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:29,236 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:29,236 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:23:29,236 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:29,236 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:29,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,436 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:29,436 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:29,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:29,438 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:29,439 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:29,440 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:29,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:29,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:29,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:29,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:29,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:29,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:29,454 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:29,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:23:29,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:29,461 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:29,462 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:29,463 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:29,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:29,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:29,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:29,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:29,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:29,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:29,477 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:29,482 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:29,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:29,484 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:29,485 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:29,486 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:29,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:29,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:29,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:29,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:29,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:29,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:29,502 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:29,509 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:29,509 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:23:29,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:29,511 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:29,513 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:29,514 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:29,530 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:29,530 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:29,530 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:29,530 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2025-04-26 16:23:29,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:23:29,538 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:29,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:29,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:29,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:29,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:29,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:29,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:29,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:29,570 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,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:29,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:29,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:29,592 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,592 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:29,593 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 219 states and 494 transitions. cyclomatic complexity: 295 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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,605 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 219 states and 494 transitions. cyclomatic complexity: 295. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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 257 states and 572 transitions. Complement of second has 4 states. [2025-04-26 16:23:29,606 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:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2025-04-26 16:23:29,606 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 8 letters. Loop has 5 letters. [2025-04-26 16:23:29,606 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:29,607 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 13 letters. Loop has 5 letters. [2025-04-26 16:23:29,607 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:29,607 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 8 letters. Loop has 10 letters. [2025-04-26 16:23:29,607 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:29,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 257 states and 572 transitions. [2025-04-26 16:23:29,609 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2025-04-26 16:23:29,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 257 states to 176 states and 384 transitions. [2025-04-26 16:23:29,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-04-26 16:23:29,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2025-04-26 16:23:29,611 INFO L74 IsDeterministic]: Start isDeterministic. Operand 176 states and 384 transitions. [2025-04-26 16:23:29,611 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:29,611 INFO L218 hiAutomatonCegarLoop]: Abstraction has 176 states and 384 transitions. [2025-04-26 16:23:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states and 384 transitions. [2025-04-26 16:23:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-04-26 16:23:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 176 states have (on average 2.1818181818181817) internal successors, (in total 384), 175 states have internal predecessors, (384), 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,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 384 transitions. [2025-04-26 16:23:29,617 INFO L240 hiAutomatonCegarLoop]: Abstraction has 176 states and 384 transitions. [2025-04-26 16:23:29,617 INFO L438 stractBuchiCegarLoop]: Abstraction has 176 states and 384 transitions. [2025-04-26 16:23:29,617 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:23:29,617 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 384 transitions. [2025-04-26 16:23:29,618 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2025-04-26 16:23:29,621 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:29,621 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:29,621 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:29,621 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:29,622 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[]" "[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[72] L25-1-->L26: 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[]" "[90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L44: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[80] L44-->L45-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[74] L26-->L26-1: Formula: (and (= 1 (select v_q_4 v_q_back_10)) (= (+ v_q_back_10 1) v_q_back_9)) InVars {q=v_q_4, q_back=v_q_back_10} OutVars{q=v_q_4, q_back=v_q_back_9} AuxVars[] AssignedVars[q_back]" [2025-04-26 16:23:29,622 INFO L754 eck$LassoCheckResult]: Loop: "[82] L45-1-->L46: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[84] L46-->L46-1: Formula: (and (= v_q_front_10 (+ v_q_front_11 1)) (< v_q_front_11 v_q_back_17) (= (select v_q_10 v_q_front_11) v_j_6)) InVars {q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_11} OutVars{q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_10, j=v_j_6} AuxVars[] AssignedVars[j, q_front]" "[85] L46-1-->L52: Formula: (= (+ v_j_2 v_s_2) v_s_1) InVars {s=v_s_2, j=v_j_2} OutVars{s=v_s_1, j=v_j_2} AuxVars[] AssignedVars[s]" "[86] L52-->L53: 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]" "[87] L53-->L45-1: Formula: (let ((.cse0 (= v_j_3 0))) (or (and (not v_f_3) .cse0) (and (not .cse0) v_f_3))) InVars {j=v_j_3} OutVars{j=v_j_3, f=v_f_3} AuxVars[] AssignedVars[f]" [2025-04-26 16:23:29,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:29,622 INFO L85 PathProgramCache]: Analyzing trace with hash -548678517, now seen corresponding path program 1 times [2025-04-26 16:23:29,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:29,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923697481] [2025-04-26 16:23:29,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:29,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:29,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:29,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:29,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,631 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:29,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:29,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:29,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:29,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:29,637 INFO L85 PathProgramCache]: Analyzing trace with hash 106944755, now seen corresponding path program 4 times [2025-04-26 16:23:29,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:29,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939232500] [2025-04-26 16:23:29,637 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:29,641 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-04-26 16:23:29,645 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:29,645 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:29,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,645 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:29,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:29,647 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,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:29,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:29,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1395307863, now seen corresponding path program 1 times [2025-04-26 16:23:29,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:29,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57911232] [2025-04-26 16:23:29,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:29,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:29,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:29,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:29,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,665 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:29,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:29,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:29,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:29,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:29,815 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:29,815 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:29,815 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:29,815 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:29,815 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:29,815 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,815 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:29,815 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:29,815 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:23:29,815 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:29,815 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:29,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,040 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:30,040 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:30,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,043 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,044 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,047 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,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,061 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:23:30,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,069 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,069 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,070 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,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,084 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:23:30,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,092 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,092 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,093 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,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,109 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:30,119 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:30,119 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:23:30,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,121 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,123 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,124 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:30,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:23:30,140 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:30,140 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:30,140 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2025-04-26 16:23:30,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:23:30,147 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:30,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:30,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:30,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:30,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:30,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:30,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:30,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:30,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:30,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:30,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:30,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:30,211 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:30,211 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:30,212 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 176 states and 384 transitions. cyclomatic complexity: 223 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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:30,233 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 176 states and 384 transitions. cyclomatic complexity: 223. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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 536 states and 1140 transitions. Complement of second has 5 states. [2025-04-26 16:23:30,234 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:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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:30,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2025-04-26 16:23:30,237 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 8 letters. Loop has 5 letters. [2025-04-26 16:23:30,237 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:30,237 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 13 letters. Loop has 5 letters. [2025-04-26 16:23:30,237 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:30,237 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 8 letters. Loop has 10 letters. [2025-04-26 16:23:30,238 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:30,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 536 states and 1140 transitions. [2025-04-26 16:23:30,253 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2025-04-26 16:23:30,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 536 states to 400 states and 852 transitions. [2025-04-26 16:23:30,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2025-04-26 16:23:30,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2025-04-26 16:23:30,258 INFO L74 IsDeterministic]: Start isDeterministic. Operand 400 states and 852 transitions. [2025-04-26 16:23:30,258 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:30,258 INFO L218 hiAutomatonCegarLoop]: Abstraction has 400 states and 852 transitions. [2025-04-26 16:23:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states and 852 transitions. [2025-04-26 16:23:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 218. [2025-04-26 16:23:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 218 states have (on average 2.1559633027522938) internal successors, (in total 470), 217 states have internal predecessors, (470), 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:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 470 transitions. [2025-04-26 16:23:30,270 INFO L240 hiAutomatonCegarLoop]: Abstraction has 218 states and 470 transitions. [2025-04-26 16:23:30,270 INFO L438 stractBuchiCegarLoop]: Abstraction has 218 states and 470 transitions. [2025-04-26 16:23:30,270 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:23:30,270 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 218 states and 470 transitions. [2025-04-26 16:23:30,272 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2025-04-26 16:23:30,272 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:30,272 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:30,272 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:30,272 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:30,272 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[]" "[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[72] L25-1-->L26: 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[]" "[90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[74] L26-->L26-1: Formula: (and (= 1 (select v_q_4 v_q_back_10)) (= (+ v_q_back_10 1) v_q_back_9)) InVars {q=v_q_4, q_back=v_q_back_10} OutVars{q=v_q_4, q_back=v_q_back_9} AuxVars[] AssignedVars[q_back]" "[76] L26-1-->L31: 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]" "[78] L31-->L25-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[72] L25-1-->L26: 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[]" "[79] $Ultimate##0-->L44: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[80] L44-->L45-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[74] L26-->L26-1: Formula: (and (= 1 (select v_q_4 v_q_back_10)) (= (+ v_q_back_10 1) v_q_back_9)) InVars {q=v_q_4, q_back=v_q_back_10} OutVars{q=v_q_4, q_back=v_q_back_9} AuxVars[] AssignedVars[q_back]" [2025-04-26 16:23:30,273 INFO L754 eck$LassoCheckResult]: Loop: "[82] L45-1-->L46: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[84] L46-->L46-1: Formula: (and (= v_q_front_10 (+ v_q_front_11 1)) (< v_q_front_11 v_q_back_17) (= (select v_q_10 v_q_front_11) v_j_6)) InVars {q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_11} OutVars{q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_10, j=v_j_6} AuxVars[] AssignedVars[j, q_front]" "[85] L46-1-->L52: Formula: (= (+ v_j_2 v_s_2) v_s_1) InVars {s=v_s_2, j=v_j_2} OutVars{s=v_s_1, j=v_j_2} AuxVars[] AssignedVars[s]" "[86] L52-->L53: 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]" "[87] L53-->L45-1: Formula: (let ((.cse0 (= v_j_3 0))) (or (and (not v_f_3) .cse0) (and (not .cse0) v_f_3))) InVars {j=v_j_3} OutVars{j=v_j_3, f=v_f_3} AuxVars[] AssignedVars[f]" [2025-04-26 16:23:30,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:30,273 INFO L85 PathProgramCache]: Analyzing trace with hash -437233777, now seen corresponding path program 1 times [2025-04-26 16:23:30,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:30,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876899591] [2025-04-26 16:23:30,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:30,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:30,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:30,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:30,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,286 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:30,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:30,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:30,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:30,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:30,292 INFO L85 PathProgramCache]: Analyzing trace with hash 106944755, now seen corresponding path program 5 times [2025-04-26 16:23:30,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:30,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350074271] [2025-04-26 16:23:30,292 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:23:30,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:30,294 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:30,296 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:30,296 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:30,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,296 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:30,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:30,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:30,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:30,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:30,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1101133275, now seen corresponding path program 1 times [2025-04-26 16:23:30,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:30,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420002798] [2025-04-26 16:23:30,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:30,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:30,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:30,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:30,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,311 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:30,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:30,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:30,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:30,473 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:30,473 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:30,473 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:30,473 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:30,473 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:30,473 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,473 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:30,473 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:30,473 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:23:30,473 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:30,474 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:30,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,683 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:30,683 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:30,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,687 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,691 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,692 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,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,706 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,712 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,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,714 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:30,716 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:30,718 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,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,733 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,739 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:30,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,741 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:30,743 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:30,744 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,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,757 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:30,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,765 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:30,765 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:30,766 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,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,776 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:23:30,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,796 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:23:30,796 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:23:30,822 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,830 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:30,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,833 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:30,834 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:30,836 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,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,852 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:30,862 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:30,862 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:30,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,864 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:30,865 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:30,866 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:30,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:30,882 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:30,882 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:30,882 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2025-04-26 16:23:30,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:23:30,892 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:23:30,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:30,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:30,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:30,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:30,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:30,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:30,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:30,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:30,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:30,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:30,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:30,959 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:30,959 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:30,959 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 218 states and 470 transitions. cyclomatic complexity: 267 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 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:30,974 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 218 states and 470 transitions. cyclomatic complexity: 267. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 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) Result 428 states and 908 transitions. Complement of second has 5 states. [2025-04-26 16:23:30,974 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:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 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:30,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-26 16:23:30,975 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 12 letters. Loop has 5 letters. [2025-04-26 16:23:30,975 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:30,975 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:30,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:30,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:30,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:30,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:30,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:30,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:31,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:31,012 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,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:31,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:31,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:31,033 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,033 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:31,034 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 218 states and 470 transitions. cyclomatic complexity: 267 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 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:31,062 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 218 states and 470 transitions. cyclomatic complexity: 267. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 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) Result 645 states and 1370 transitions. Complement of second has 7 states. [2025-04-26 16:23:31,064 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:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 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:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2025-04-26 16:23:31,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 12 letters. Loop has 5 letters. [2025-04-26 16:23:31,067 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:31,067 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:31,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:31,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:31,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:31,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:31,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:31,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:31,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:31,099 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,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:31,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:31,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:31,123 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,125 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:31,125 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 218 states and 470 transitions. cyclomatic complexity: 267 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 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:31,142 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 218 states and 470 transitions. cyclomatic complexity: 267. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 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) Result 470 states and 1007 transitions. Complement of second has 5 states. [2025-04-26 16:23:31,143 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,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 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:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-26 16:23:31,146 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 41 transitions. Stem has 12 letters. Loop has 5 letters. [2025-04-26 16:23:31,146 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:31,146 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 41 transitions. Stem has 17 letters. Loop has 5 letters. [2025-04-26 16:23:31,147 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:31,147 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 41 transitions. Stem has 12 letters. Loop has 10 letters. [2025-04-26 16:23:31,147 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:31,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 470 states and 1007 transitions. [2025-04-26 16:23:31,165 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:31,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 470 states to 0 states and 0 transitions. [2025-04-26 16:23:31,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:23:31,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:23:31,165 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:23:31,165 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:31,165 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:31,165 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:31,165 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:31,165 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:23:31,165 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:23:31,165 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:31,165 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:23:31,173 INFO L201 PluginConnector]: Adding new model queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:31 BoogieIcfgContainer [2025-04-26 16:23:31,173 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:31,173 INFO L158 Benchmark]: Toolchain (without parser) took 4187.53ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 84.5MB in the beginning and 131.8MB in the end (delta: -47.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:31,173 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.66ms. Allocated memory is still 159.4MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:31,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.44ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 82.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:31,174 INFO L158 Benchmark]: Boogie Preprocessor took 15.90ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 81.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:31,175 INFO L158 Benchmark]: RCFGBuilder took 174.96ms. Allocated memory is still 159.4MB. Free memory was 81.6MB in the beginning and 71.5MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:23:31,175 INFO L158 Benchmark]: BuchiAutomizer took 3957.57ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 71.4MB in the beginning and 131.8MB in the end (delta: -60.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:31,176 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.66ms. Allocated memory is still 159.4MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.44ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 82.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 15.90ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 81.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 174.96ms. Allocated memory is still 159.4MB. Free memory was 81.6MB in the beginning and 71.5MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3957.57ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 71.4MB in the beginning and 131.8MB in the end (delta: -60.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 235 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 184 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 156 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital74 mio100 ax100 hnf100 lsp60 ukn97 mio100 lsp71 div100 bol116 ite100 ukn100 eq171 hnf92 smp100 dnf251 smp64 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 59ms VariablesStem: 4 VariablesLoop: 6 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 6 terminating modules (1 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 3 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 3 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 3 locations. One nondeterministic module has affine ranking function q_back + -1 * q_front and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 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:31,188 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...