/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/prod-cons3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:49,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:49,062 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:49,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:49,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:49,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:49,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:49,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:49,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:49,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:49,093 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:49,093 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:49,094 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:49,094 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:49,094 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:49,094 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:49,094 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:49,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:49,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:49,094 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:49,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:49,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:49,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:49,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:49,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:49,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:49,095 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:49,095 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:49,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:49,095 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:49,095 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:49,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:49,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:49,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:49,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:49,096 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:49,096 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:49,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:49,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:49,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:49,363 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:49,364 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:49,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl [2025-04-26 16:23:49,367 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl' [2025-04-26 16:23:49,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:49,394 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:49,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:49,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:49,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:49,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:49" (1/1) ... [2025-04-26 16:23:49,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:49" (1/1) ... [2025-04-26 16:23:49,431 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:49,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:49,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:49,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:49,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:49,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:49" (1/1) ... [2025-04-26 16:23:49,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:49" (1/1) ... [2025-04-26 16:23:49,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:49" (1/1) ... [2025-04-26 16:23:49,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:49" (1/1) ... [2025-04-26 16:23:49,445 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:49" (1/1) ... [2025-04-26 16:23:49,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:49" (1/1) ... [2025-04-26 16:23:49,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:49" (1/1) ... [2025-04-26 16:23:49,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:49" (1/1) ... [2025-04-26 16:23:49,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:49" (1/1) ... [2025-04-26 16:23:49,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:49,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:49,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:49,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:49,460 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:49" (1/1) ... [2025-04-26 16:23:49,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:49,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:49,484 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:49,487 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:49,509 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:49,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:49,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:49,509 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:49,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:49,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:49,510 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:49,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:49,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:49,510 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:23:49,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:23:49,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:23:49,510 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:23:49,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:23:49,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:23:49,511 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:49,553 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:49,554 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:49,664 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:49,664 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:49,687 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:49,688 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:49,688 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:49 BoogieIcfgContainer [2025-04-26 16:23:49,688 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:49,689 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:49,689 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:49,694 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:49,695 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:49,695 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:49" (1/2) ... [2025-04-26 16:23:49,696 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fc00f0f and model type prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:23:49, skipping insertion in model container [2025-04-26 16:23:49,696 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:49,696 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:49" (2/2) ... [2025-04-26 16:23:49,697 INFO L376 chiAutomizerObserver]: Analyzing ICFG prod-cons3.wvr.bpl [2025-04-26 16:23:49,755 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:23:49,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 116 flow [2025-04-26 16:23:49,811 INFO L116 PetriNetUnfolderBase]: 3/36 cut-off events. [2025-04-26 16:23:49,814 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:23:49,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 3/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-04-26 16:23:49,818 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 44 transitions, 116 flow [2025-04-26 16:23:49,821 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 36 transitions, 96 flow [2025-04-26 16:23:49,821 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 46 places, 36 transitions, 96 flow [2025-04-26 16:23:49,829 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:49,830 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:49,830 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:49,830 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:49,830 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:49,830 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:49,830 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:49,830 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:49,831 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:50,003 INFO L131 ngComponentsAnalysis]: Automaton has 100 accepting balls. 684 [2025-04-26 16:23:50,004 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:50,004 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:50,010 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:50,010 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:50,010 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:50,011 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 754 states, but on-demand construction may add more states [2025-04-26 16:23:50,030 INFO L131 ngComponentsAnalysis]: Automaton has 100 accepting balls. 684 [2025-04-26 16:23:50,030 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:50,030 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:50,031 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:50,031 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:50,036 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:23:50,036 INFO L754 eck$LassoCheckResult]: Loop: "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" [2025-04-26 16:23:50,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:50,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1102579250, now seen corresponding path program 1 times [2025-04-26 16:23:50,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:50,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098266531] [2025-04-26 16:23:50,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:50,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:50,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:50,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:50,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,108 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:50,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:50,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:50,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:50,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:50,127 INFO L85 PathProgramCache]: Analyzing trace with hash 123198, now seen corresponding path program 1 times [2025-04-26 16:23:50,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:50,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387801071] [2025-04-26 16:23:50,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:50,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:50,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:50,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:50,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,134 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:50,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:50,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:50,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:50,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:50,139 INFO L85 PathProgramCache]: Analyzing trace with hash 971536465, now seen corresponding path program 1 times [2025-04-26 16:23:50,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:50,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994940813] [2025-04-26 16:23:50,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:50,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:50,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:50,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:50,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,146 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:50,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:50,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:50,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:50,316 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:50,317 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:50,317 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:50,317 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:50,317 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:50,317 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:50,317 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:50,317 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:50,317 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:23:50,317 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:50,318 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:50,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:50,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:50,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:50,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:50,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:50,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:50,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:50,499 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:50,512 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:50,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:50,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:50,519 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:50,521 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:50,522 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:50,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:50,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:50,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:50,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:50,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:50,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:50,566 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:50,572 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:50,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:50,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:50,575 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:50,576 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:50,577 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:50,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:50,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:50,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:50,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:50,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:50,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:50,592 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:50,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:23:50,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:50,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:50,601 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:50,601 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:50,604 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:50,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:50,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:50,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:50,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:50,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:50,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:50,622 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:50,628 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:50,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:50,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:50,630 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:50,630 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:50,631 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:50,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:50,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:50,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:50,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:50,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:50,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:50,649 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:50,655 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:50,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:50,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:50,657 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:50,658 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:50,659 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:50,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:50,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:50,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:50,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:50,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:50,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:50,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:50,672 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:50,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:50,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:50,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:50,680 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:50,682 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:50,683 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:50,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:50,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:50,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:50,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:50,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:50,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:50,700 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:50,711 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:50,712 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:23:50,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:50,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:50,716 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:50,717 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:50,718 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:50,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:23:50,736 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:50,736 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:50,736 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w) = 1*w Supporting invariants [] [2025-04-26 16:23:50,742 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:50,745 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:50,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:50,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:50,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:50,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:50,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:50,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:50,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:50,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:50,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:50,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:50,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:50,812 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:50,838 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:50,840 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 754 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 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:50,974 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 754 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 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) Result 2005 states and 8062 transitions. Complement of second has 7 states. [2025-04-26 16:23:50,976 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:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 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:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2025-04-26 16:23:50,986 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:23:50,987 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:50,987 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 16:23:50,987 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:50,987 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 7 letters. Loop has 6 letters. [2025-04-26 16:23:50,987 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:50,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2005 states and 8062 transitions. [2025-04-26 16:23:51,018 INFO L131 ngComponentsAnalysis]: Automaton has 123 accepting balls. 627 [2025-04-26 16:23:51,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2005 states to 1422 states and 5751 transitions. [2025-04-26 16:23:51,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 647 [2025-04-26 16:23:51,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 979 [2025-04-26 16:23:51,053 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1422 states and 5751 transitions. [2025-04-26 16:23:51,054 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:51,054 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1422 states and 5751 transitions. [2025-04-26 16:23:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states and 5751 transitions. [2025-04-26 16:23:51,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1092. [2025-04-26 16:23:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1092 states have (on average 4.044871794871795) internal successors, (in total 4417), 1091 states have internal predecessors, (4417), 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:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 4417 transitions. [2025-04-26 16:23:51,131 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1092 states and 4417 transitions. [2025-04-26 16:23:51,131 INFO L438 stractBuchiCegarLoop]: Abstraction has 1092 states and 4417 transitions. [2025-04-26 16:23:51,131 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:51,131 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1092 states and 4417 transitions. [2025-04-26 16:23:51,145 INFO L131 ngComponentsAnalysis]: Automaton has 123 accepting balls. 627 [2025-04-26 16:23:51,145 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:51,145 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:51,146 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:51,146 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:51,147 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:23:51,147 INFO L754 eck$LassoCheckResult]: Loop: "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" [2025-04-26 16:23:51,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,148 INFO L85 PathProgramCache]: Analyzing trace with hash 179781734, now seen corresponding path program 1 times [2025-04-26 16:23:51,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476774843] [2025-04-26 16:23:51,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:51,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:51,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:51,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,156 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:51,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:51,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:51,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:51,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,163 INFO L85 PathProgramCache]: Analyzing trace with hash 3973156, now seen corresponding path program 1 times [2025-04-26 16:23:51,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383473018] [2025-04-26 16:23:51,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:51,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:51,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:51,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,168 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:51,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:51,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:51,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:51,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1659053577, now seen corresponding path program 1 times [2025-04-26 16:23:51,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848145697] [2025-04-26 16:23:51,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:51,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:51,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:51,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:51,232 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:51,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:51,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848145697] [2025-04-26 16:23:51,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848145697] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:51,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:51,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:23:51,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913971678] [2025-04-26 16:23:51,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:51,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:51,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:23:51,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:23:51,289 INFO L87 Difference]: Start difference. First operand 1092 states and 4417 transitions. cyclomatic complexity: 3472 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:51,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:51,328 INFO L93 Difference]: Finished difference Result 1561 states and 5995 transitions. [2025-04-26 16:23:51,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1561 states and 5995 transitions. [2025-04-26 16:23:51,340 INFO L131 ngComponentsAnalysis]: Automaton has 202 accepting balls. 864 [2025-04-26 16:23:51,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1561 states to 1517 states and 5853 transitions. [2025-04-26 16:23:51,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 937 [2025-04-26 16:23:51,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 937 [2025-04-26 16:23:51,373 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1517 states and 5853 transitions. [2025-04-26 16:23:51,373 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:51,373 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1517 states and 5853 transitions. [2025-04-26 16:23:51,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states and 5853 transitions. [2025-04-26 16:23:51,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1334. [2025-04-26 16:23:51,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1334 states have (on average 3.9535232383808094) internal successors, (in total 5274), 1333 states have internal predecessors, (5274), 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:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 5274 transitions. [2025-04-26 16:23:51,406 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1334 states and 5274 transitions. [2025-04-26 16:23:51,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:23:51,407 INFO L438 stractBuchiCegarLoop]: Abstraction has 1334 states and 5274 transitions. [2025-04-26 16:23:51,407 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:51,407 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1334 states and 5274 transitions. [2025-04-26 16:23:51,414 INFO L131 ngComponentsAnalysis]: Automaton has 161 accepting balls. 741 [2025-04-26 16:23:51,415 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:51,415 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:51,415 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:51,415 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:51,416 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:23:51,416 INFO L754 eck$LassoCheckResult]: Loop: "[105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[]" "[107] L56-->L56-1: Formula: (and (= (+ v_front2_11 1) v_front2_10) (< v_front2_11 v_back2_10) (= v_temp2_5 (select v_queue2_7 v_front2_11))) InVars {front2=v_front2_11, queue2=v_queue2_7, back2=v_back2_10} OutVars{front2=v_front2_10, queue2=v_queue2_7, back2=v_back2_10, temp2=v_temp2_5} AuxVars[] AssignedVars[temp2, front2]" "[108] L56-1-->L55: Formula: (= v_d2_2 (+ v_temp2_2 v_d2_3)) InVars {d2=v_d2_3, temp2=v_temp2_2} OutVars{d2=v_d2_2, temp2=v_temp2_2} AuxVars[] AssignedVars[d2]" [2025-04-26 16:23:51,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1278266577, now seen corresponding path program 1 times [2025-04-26 16:23:51,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926912780] [2025-04-26 16:23:51,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:51,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:51,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:51,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,420 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:51,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:51,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:51,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:51,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,424 INFO L85 PathProgramCache]: Analyzing trace with hash 134121, now seen corresponding path program 1 times [2025-04-26 16:23:51,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707487724] [2025-04-26 16:23:51,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:51,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:51,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:51,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,427 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:51,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:51,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:51,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:51,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1659653401, now seen corresponding path program 1 times [2025-04-26 16:23:51,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525145580] [2025-04-26 16:23:51,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:51,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:51,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:51,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:51,474 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:51,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:51,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525145580] [2025-04-26 16:23:51,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525145580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:51,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:51,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:23:51,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764085168] [2025-04-26 16:23:51,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:51,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:51,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:23:51,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:23:51,506 INFO L87 Difference]: Start difference. First operand 1334 states and 5274 transitions. cyclomatic complexity: 4141 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:51,541 INFO L93 Difference]: Finished difference Result 1955 states and 7542 transitions. [2025-04-26 16:23:51,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1955 states and 7542 transitions. [2025-04-26 16:23:51,560 INFO L131 ngComponentsAnalysis]: Automaton has 123 accepting balls. 627 [2025-04-26 16:23:51,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1955 states to 1725 states and 6717 transitions. [2025-04-26 16:23:51,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1009 [2025-04-26 16:23:51,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1009 [2025-04-26 16:23:51,577 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1725 states and 6717 transitions. [2025-04-26 16:23:51,578 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:51,578 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1725 states and 6717 transitions. [2025-04-26 16:23:51,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states and 6717 transitions. [2025-04-26 16:23:51,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1491. [2025-04-26 16:23:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1491 states have (on average 3.943661971830986) internal successors, (in total 5880), 1490 states have internal predecessors, (5880), 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:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 5880 transitions. [2025-04-26 16:23:51,618 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1491 states and 5880 transitions. [2025-04-26 16:23:51,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:23:51,619 INFO L438 stractBuchiCegarLoop]: Abstraction has 1491 states and 5880 transitions. [2025-04-26 16:23:51,620 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:23:51,620 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1491 states and 5880 transitions. [2025-04-26 16:23:51,626 INFO L131 ngComponentsAnalysis]: Automaton has 123 accepting balls. 627 [2025-04-26 16:23:51,627 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:51,627 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:51,627 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:51,627 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:51,628 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[104] L55-->thread3FINAL: Formula: (not v_v_assert_8) InVars {v_assert=v_v_assert_8} OutVars{v_assert=v_v_assert_8} AuxVars[] AssignedVars[]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" [2025-04-26 16:23:51,628 INFO L754 eck$LassoCheckResult]: Loop: "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" [2025-04-26 16:23:51,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1659652025, now seen corresponding path program 1 times [2025-04-26 16:23:51,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892601104] [2025-04-26 16:23:51,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:51,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:51,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:51,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:51,658 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:51,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:51,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892601104] [2025-04-26 16:23:51,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892601104] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:51,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:51,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:23:51,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895747086] [2025-04-26 16:23:51,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:51,659 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:23:51,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,659 INFO L85 PathProgramCache]: Analyzing trace with hash 3973156, now seen corresponding path program 2 times [2025-04-26 16:23:51,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847794052] [2025-04-26 16:23:51,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:51,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:51,663 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:51,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:51,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,663 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:51,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:51,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:51,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:51,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:51,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:23:51,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:23:51,723 INFO L87 Difference]: Start difference. First operand 1491 states and 5880 transitions. cyclomatic complexity: 4563 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:51,765 INFO L93 Difference]: Finished difference Result 1868 states and 6832 transitions. [2025-04-26 16:23:51,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1868 states and 6832 transitions. [2025-04-26 16:23:51,779 INFO L131 ngComponentsAnalysis]: Automaton has 78 accepting balls. 470 [2025-04-26 16:23:51,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1868 states to 1868 states and 6832 transitions. [2025-04-26 16:23:51,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1103 [2025-04-26 16:23:51,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1103 [2025-04-26 16:23:51,795 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1868 states and 6832 transitions. [2025-04-26 16:23:51,796 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:51,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1868 states and 6832 transitions. [2025-04-26 16:23:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states and 6832 transitions. [2025-04-26 16:23:51,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1526. [2025-04-26 16:23:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1526 states have (on average 3.7719528178243773) internal successors, (in total 5756), 1525 states have internal predecessors, (5756), 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:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 5756 transitions. [2025-04-26 16:23:51,829 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1526 states and 5756 transitions. [2025-04-26 16:23:51,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:23:51,831 INFO L438 stractBuchiCegarLoop]: Abstraction has 1526 states and 5756 transitions. [2025-04-26 16:23:51,831 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:23:51,831 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1526 states and 5756 transitions. [2025-04-26 16:23:51,839 INFO L131 ngComponentsAnalysis]: Automaton has 78 accepting balls. 470 [2025-04-26 16:23:51,839 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:51,839 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:51,839 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:51,839 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:51,840 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" [2025-04-26 16:23:51,840 INFO L754 eck$LassoCheckResult]: Loop: "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" [2025-04-26 16:23:51,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash -109160928, now seen corresponding path program 1 times [2025-04-26 16:23:51,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907411793] [2025-04-26 16:23:51,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:51,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:51,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,850 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:51,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:51,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:51,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:51,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,855 INFO L85 PathProgramCache]: Analyzing trace with hash 4090366, now seen corresponding path program 3 times [2025-04-26 16:23:51,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900520350] [2025-04-26 16:23:51,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:51,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:51,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:51,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:51,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,858 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:51,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:51,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:51,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:51,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,861 INFO L85 PathProgramCache]: Analyzing trace with hash -933848931, now seen corresponding path program 1 times [2025-04-26 16:23:51,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095334492] [2025-04-26 16:23:51,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:51,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:51,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:51,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:51,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:51,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095334492] [2025-04-26 16:23:51,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095334492] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:51,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:51,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:23:51,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818461513] [2025-04-26 16:23:51,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:51,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:51,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:23:51,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:23:51,945 INFO L87 Difference]: Start difference. First operand 1526 states and 5756 transitions. cyclomatic complexity: 4349 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (in total 17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:52,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:52,005 INFO L93 Difference]: Finished difference Result 4073 states and 15425 transitions. [2025-04-26 16:23:52,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4073 states and 15425 transitions. [2025-04-26 16:23:52,037 INFO L131 ngComponentsAnalysis]: Automaton has 314 accepting balls. 1178 [2025-04-26 16:23:52,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4073 states to 3897 states and 14739 transitions. [2025-04-26 16:23:52,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2239 [2025-04-26 16:23:52,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2239 [2025-04-26 16:23:52,107 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3897 states and 14739 transitions. [2025-04-26 16:23:52,107 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:52,107 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3897 states and 14739 transitions. [2025-04-26 16:23:52,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3897 states and 14739 transitions. [2025-04-26 16:23:52,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3897 to 3571. [2025-04-26 16:23:52,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3571 states, 3571 states have (on average 3.844301316157939) internal successors, (in total 13728), 3570 states have internal predecessors, (13728), 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:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 13728 transitions. [2025-04-26 16:23:52,196 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3571 states and 13728 transitions. [2025-04-26 16:23:52,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:23:52,198 INFO L438 stractBuchiCegarLoop]: Abstraction has 3571 states and 13728 transitions. [2025-04-26 16:23:52,198 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:23:52,198 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3571 states and 13728 transitions. [2025-04-26 16:23:52,218 INFO L131 ngComponentsAnalysis]: Automaton has 262 accepting balls. 1022 [2025-04-26 16:23:52,218 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:52,218 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:52,218 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:52,219 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:52,220 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" [2025-04-26 16:23:52,220 INFO L754 eck$LassoCheckResult]: Loop: "[105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[]" "[107] L56-->L56-1: Formula: (and (= (+ v_front2_11 1) v_front2_10) (< v_front2_11 v_back2_10) (= v_temp2_5 (select v_queue2_7 v_front2_11))) InVars {front2=v_front2_11, queue2=v_queue2_7, back2=v_back2_10} OutVars{front2=v_front2_10, queue2=v_queue2_7, back2=v_back2_10, temp2=v_temp2_5} AuxVars[] AssignedVars[temp2, front2]" "[108] L56-1-->L55: Formula: (= v_d2_2 (+ v_temp2_2 v_d2_3)) InVars {d2=v_d2_3, temp2=v_temp2_2} OutVars{d2=v_d2_2, temp2=v_temp2_2} AuxVars[] AssignedVars[d2]" [2025-04-26 16:23:52,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:52,220 INFO L85 PathProgramCache]: Analyzing trace with hash 934002237, now seen corresponding path program 1 times [2025-04-26 16:23:52,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:52,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519611397] [2025-04-26 16:23:52,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:52,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:52,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:52,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:52,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:52,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:52,232 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:52,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:52,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:52,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:52,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:52,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:52,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash 134121, now seen corresponding path program 2 times [2025-04-26 16:23:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:52,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113411966] [2025-04-26 16:23:52,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:52,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:52,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:52,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:52,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:52,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:52,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:52,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:52,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:52,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:52,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:52,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:52,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:52,245 INFO L85 PathProgramCache]: Analyzing trace with hash 2062603309, now seen corresponding path program 1 times [2025-04-26 16:23:52,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:52,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344191052] [2025-04-26 16:23:52,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:52,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:52,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:52,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:52,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:52,255 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:52,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:52,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:52,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:52,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:52,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:52,508 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:52,508 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:52,508 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:52,508 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:52,508 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:52,508 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,508 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:52,508 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:52,508 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:23:52,508 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:52,508 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:52,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,767 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:52,768 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:52,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:52,770 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:52,770 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:52,771 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:52,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:52,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:52,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:52,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:52,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:52,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:52,786 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:52,791 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:52,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:52,793 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:52,794 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:52,795 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:52,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:52,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:52,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:52,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:52,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:52,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:52,821 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:52,827 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:52,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:52,829 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:52,830 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:52,832 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:52,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:52,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:52,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:52,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:52,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:52,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:52,851 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:52,857 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:52,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:52,859 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:52,861 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:52,862 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:52,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:52,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:52,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:52,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:52,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:52,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:52,879 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:52,887 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:23:52,887 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:23:52,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:52,889 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:52,894 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:52,894 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:52,910 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:52,910 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:52,911 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:52,911 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(front2, back2) = -1*front2 + 1*back2 Supporting invariants [] [2025-04-26 16:23:52,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:52,920 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:23:52,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:52,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:52,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:52,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:52,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:52,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:52,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:52,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:52,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:52,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:52,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:52,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:52,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:52,997 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:52,997 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:52,997 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3571 states and 13728 transitions. cyclomatic complexity: 10469 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:53,157 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3571 states and 13728 transitions. cyclomatic complexity: 10469. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 12105 states and 48219 transitions. Complement of second has 5 states. [2025-04-26 16:23:53,158 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:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-26 16:23:53,160 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 16:23:53,160 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:53,160 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 17 letters. Loop has 3 letters. [2025-04-26 16:23:53,160 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:53,160 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 14 letters. Loop has 6 letters. [2025-04-26 16:23:53,160 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:53,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12105 states and 48219 transitions. [2025-04-26 16:23:53,329 INFO L131 ngComponentsAnalysis]: Automaton has 262 accepting balls. 1022 [2025-04-26 16:23:53,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12105 states to 10461 states and 41516 transitions. [2025-04-26 16:23:53,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3991 [2025-04-26 16:23:53,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5035 [2025-04-26 16:23:53,435 INFO L74 IsDeterministic]: Start isDeterministic. Operand 10461 states and 41516 transitions. [2025-04-26 16:23:53,436 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:53,436 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10461 states and 41516 transitions. [2025-04-26 16:23:53,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10461 states and 41516 transitions. [2025-04-26 16:23:53,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10461 to 8063. [2025-04-26 16:23:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8063 states, 8063 states have (on average 4.149696142874861) internal successors, (in total 33459), 8062 states have internal predecessors, (33459), 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:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 33459 transitions. [2025-04-26 16:23:53,754 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8063 states and 33459 transitions. [2025-04-26 16:23:53,754 INFO L438 stractBuchiCegarLoop]: Abstraction has 8063 states and 33459 transitions. [2025-04-26 16:23:53,754 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:23:53,754 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8063 states and 33459 transitions. [2025-04-26 16:23:53,844 INFO L131 ngComponentsAnalysis]: Automaton has 262 accepting balls. 1022 [2025-04-26 16:23:53,844 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:53,844 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:53,845 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:53,845 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:53,846 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[122] L82-->$Ultimate##0: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[109] $Ultimate##0-->thread4FINAL: Formula: (let ((.cse0 (* 2 v_W_3))) (or (and (not v_v_assert_9) (< .cse0 v_d2_4)) (and (<= v_d2_4 .cse0) v_v_assert_9))) InVars {d2=v_d2_4, W=v_W_3} OutVars{d2=v_d2_4, v_assert=v_v_assert_9, W=v_W_3} AuxVars[] AssignedVars[v_assert]" "[104] L55-->thread3FINAL: Formula: (not v_v_assert_8) InVars {v_assert=v_v_assert_8} OutVars{v_assert=v_v_assert_8} AuxVars[] AssignedVars[]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" [2025-04-26 16:23:53,846 INFO L754 eck$LassoCheckResult]: Loop: "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" [2025-04-26 16:23:53,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1856751165, now seen corresponding path program 1 times [2025-04-26 16:23:53,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:53,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619406131] [2025-04-26 16:23:53,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:53,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:53,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:53,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:53,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:23:53,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:53,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619406131] [2025-04-26 16:23:53,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619406131] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:53,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:53,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:23:53,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936898724] [2025-04-26 16:23:53,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:53,890 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:23:53,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:53,891 INFO L85 PathProgramCache]: Analyzing trace with hash 3973156, now seen corresponding path program 4 times [2025-04-26 16:23:53,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:53,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223389803] [2025-04-26 16:23:53,891 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:53,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:53,898 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-04-26 16:23:53,899 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:53,899 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:53,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:53,899 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:53,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:53,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:53,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:53,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:54,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:54,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:23:54,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:23:54,025 INFO L87 Difference]: Start difference. First operand 8063 states and 33459 transitions. cyclomatic complexity: 26107 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:54,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:54,137 INFO L93 Difference]: Finished difference Result 8063 states and 33137 transitions. [2025-04-26 16:23:54,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8063 states and 33137 transitions. [2025-04-26 16:23:54,241 INFO L131 ngComponentsAnalysis]: Automaton has 212 accepting balls. 848 [2025-04-26 16:23:54,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8063 states to 7633 states and 31356 transitions. [2025-04-26 16:23:54,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3288 [2025-04-26 16:23:54,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3288 [2025-04-26 16:23:54,316 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7633 states and 31356 transitions. [2025-04-26 16:23:54,316 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:54,316 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7633 states and 31356 transitions. [2025-04-26 16:23:54,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7633 states and 31356 transitions. [2025-04-26 16:23:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7633 to 5817. [2025-04-26 16:23:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5817 states, 5817 states have (on average 4.10881897885508) internal successors, (in total 23901), 5816 states have internal predecessors, (23901), 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:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5817 states to 5817 states and 23901 transitions. [2025-04-26 16:23:54,495 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5817 states and 23901 transitions. [2025-04-26 16:23:54,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:23:54,495 INFO L438 stractBuchiCegarLoop]: Abstraction has 5817 states and 23901 transitions. [2025-04-26 16:23:54,495 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:23:54,496 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5817 states and 23901 transitions. [2025-04-26 16:23:54,525 INFO L131 ngComponentsAnalysis]: Automaton has 212 accepting balls. 848 [2025-04-26 16:23:54,525 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:54,525 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:54,526 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:54,526 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:54,526 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" [2025-04-26 16:23:54,526 INFO L754 eck$LassoCheckResult]: Loop: "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" [2025-04-26 16:23:54,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1772305950, now seen corresponding path program 1 times [2025-04-26 16:23:54,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,527 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965340186] [2025-04-26 16:23:54,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:54,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:23:54,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:23:54,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,534 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:23:54,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:23:54,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:54,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,541 INFO L85 PathProgramCache]: Analyzing trace with hash 4090366, now seen corresponding path program 5 times [2025-04-26 16:23:54,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848354250] [2025-04-26 16:23:54,541 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:23:54,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,545 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:54,546 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:54,546 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:54,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:54,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:54,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:54,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1263185057, now seen corresponding path program 2 times [2025-04-26 16:23:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,551 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361549855] [2025-04-26 16:23:54,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:54,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-26 16:23:54,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:54,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:54,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:23:54,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:54,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361549855] [2025-04-26 16:23:54,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361549855] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:23:54,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883959551] [2025-04-26 16:23:54,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:54,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:23:54,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:54,637 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:23:54,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-26 16:23:54,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-26 16:23:54,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:54,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:54,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:54,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:23:54,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:54,701 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:23:54,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:23:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:23:54,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883959551] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:23:54,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:23:54,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2025-04-26 16:23:54,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599820402] [2025-04-26 16:23:54,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:23:54,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:54,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:23:54,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:23:54,787 INFO L87 Difference]: Start difference. First operand 5817 states and 23901 transitions. cyclomatic complexity: 18733 Second operand has 6 states, 6 states have (on average 5.0) internal successors, (in total 30), 6 states have internal predecessors, (30), 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:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:54,918 INFO L93 Difference]: Finished difference Result 10766 states and 44285 transitions. [2025-04-26 16:23:54,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10766 states and 44285 transitions. [2025-04-26 16:23:55,029 INFO L131 ngComponentsAnalysis]: Automaton has 488 accepting balls. 1676 [2025-04-26 16:23:55,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10766 states to 10766 states and 44285 transitions. [2025-04-26 16:23:55,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4717 [2025-04-26 16:23:55,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4717 [2025-04-26 16:23:55,232 INFO L74 IsDeterministic]: Start isDeterministic. Operand 10766 states and 44285 transitions. [2025-04-26 16:23:55,232 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:55,232 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10766 states and 44285 transitions. [2025-04-26 16:23:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10766 states and 44285 transitions. [2025-04-26 16:23:55,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10766 to 7977. [2025-04-26 16:23:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7977 states, 7977 states have (on average 4.1223517613137775) internal successors, (in total 32884), 7976 states have internal predecessors, (32884), 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:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7977 states to 7977 states and 32884 transitions. [2025-04-26 16:23:55,524 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7977 states and 32884 transitions. [2025-04-26 16:23:55,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:23:55,525 INFO L438 stractBuchiCegarLoop]: Abstraction has 7977 states and 32884 transitions. [2025-04-26 16:23:55,525 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:23:55,525 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7977 states and 32884 transitions. [2025-04-26 16:23:55,562 INFO L131 ngComponentsAnalysis]: Automaton has 304 accepting balls. 1124 [2025-04-26 16:23:55,562 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:55,562 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:55,563 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:55,563 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:55,563 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" [2025-04-26 16:23:55,563 INFO L754 eck$LassoCheckResult]: Loop: "[105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[]" "[107] L56-->L56-1: Formula: (and (= (+ v_front2_11 1) v_front2_10) (< v_front2_11 v_back2_10) (= v_temp2_5 (select v_queue2_7 v_front2_11))) InVars {front2=v_front2_11, queue2=v_queue2_7, back2=v_back2_10} OutVars{front2=v_front2_10, queue2=v_queue2_7, back2=v_back2_10, temp2=v_temp2_5} AuxVars[] AssignedVars[temp2, front2]" "[108] L56-1-->L55: Formula: (= v_d2_2 (+ v_temp2_2 v_d2_3)) InVars {d2=v_d2_3, temp2=v_temp2_2} OutVars{d2=v_d2_2, temp2=v_temp2_2} AuxVars[] AssignedVars[d2]" [2025-04-26 16:23:55,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash -770353947, now seen corresponding path program 1 times [2025-04-26 16:23:55,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:55,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335466708] [2025-04-26 16:23:55,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:55,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:55,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:55,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:55,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,570 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:55,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:55,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:55,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:55,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:55,575 INFO L85 PathProgramCache]: Analyzing trace with hash 134121, now seen corresponding path program 3 times [2025-04-26 16:23:55,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:55,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269520776] [2025-04-26 16:23:55,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:55,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:55,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:55,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:55,578 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:55,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,578 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:55,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:55,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:55,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:55,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:55,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1604068219, now seen corresponding path program 1 times [2025-04-26 16:23:55,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:55,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378425010] [2025-04-26 16:23:55,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:55,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:55,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:23:55,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:55,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,585 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:55,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:23:55,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:55,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:55,828 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:55,828 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:55,828 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:55,828 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:55,828 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:55,828 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:55,828 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:55,829 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:55,829 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration9_Lasso [2025-04-26 16:23:55,829 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:55,829 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:55,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:55,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:55,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:55,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:55,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:55,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:55,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:55,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:55,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:56,089 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:56,089 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:56,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,097 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:56,098 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:56,099 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:56,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:56,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:56,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:56,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:56,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:56,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:56,114 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:56,121 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:56,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,123 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:56,124 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:56,125 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:56,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:56,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:56,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:56,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:56,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:56,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:56,143 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:56,149 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:56,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,152 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:56,153 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:56,153 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:56,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:56,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:56,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:56,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:56,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:56,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:56,169 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:56,175 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:56,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,177 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:56,179 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:56,180 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:56,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:56,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:56,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:56,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:56,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:56,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:56,197 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:56,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:56,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,206 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:56,209 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:56,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:56,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:56,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:56,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:56,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:56,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:56,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:56,227 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:56,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:23:56,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,236 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:56,237 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:56,239 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:56,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:56,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:56,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:56,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:56,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:56,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:56,252 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:56,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:23:56,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,260 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:56,261 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:56,262 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:56,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:56,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:56,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:56,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:56,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:56,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:56,277 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:56,282 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:56,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,284 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:56,285 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:56,286 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:56,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:56,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:56,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:56,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:56,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:56,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:56,302 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:56,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:23:56,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,309 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:56,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:23:56,311 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:56,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:56,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:56,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:56,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:56,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:56,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:56,328 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:56,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:23:56,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,335 INFO L229 MonitoredProcess]: Starting monitored process 24 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:56,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:23:56,337 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:56,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:56,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:56,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:56,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:56,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:56,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:56,352 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:56,358 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:23:56,358 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:56,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,360 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:56,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:23:56,363 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:56,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:56,378 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:56,379 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:56,379 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(front2, back2) = -1*front2 + 1*back2 Supporting invariants [] [2025-04-26 16:23:56,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:23:56,393 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-04-26 16:23:56,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:56,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:56,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:56,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:56,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:56,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:56,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:56,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:56,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:56,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:56,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:56,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:56,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:56,449 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:56,450 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:56,450 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7977 states and 32884 transitions. cyclomatic complexity: 25788 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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:56,652 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7977 states and 32884 transitions. cyclomatic complexity: 25788. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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 14531 states and 60570 transitions. Complement of second has 5 states. [2025-04-26 16:23:56,653 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:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-04-26 16:23:56,654 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 21 letters. Loop has 3 letters. [2025-04-26 16:23:56,654 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:56,654 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:56,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:56,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:56,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:56,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:56,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:56,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:56,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:56,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:56,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:56,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:56,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:56,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:56,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:56,806 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:56,807 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:56,807 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7977 states and 32884 transitions. cyclomatic complexity: 25788 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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:57,005 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7977 states and 32884 transitions. cyclomatic complexity: 25788. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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 23166 states and 95745 transitions. Complement of second has 7 states. [2025-04-26 16:23:57,006 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:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-04-26 16:23:57,007 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 21 letters. Loop has 3 letters. [2025-04-26 16:23:57,008 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:57,008 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:57,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:57,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:57,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:57,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:57,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:57,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:57,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:57,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:57,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:57,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:57,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:57,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:57,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:57,062 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:57,062 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:57,062 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7977 states and 32884 transitions. cyclomatic complexity: 25788 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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:57,185 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7977 states and 32884 transitions. cyclomatic complexity: 25788. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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 19252 states and 80705 transitions. Complement of second has 5 states. [2025-04-26 16:23:57,186 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:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-04-26 16:23:57,186 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 21 letters. Loop has 3 letters. [2025-04-26 16:23:57,186 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:57,186 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 24 letters. Loop has 3 letters. [2025-04-26 16:23:57,187 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:57,187 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 21 letters. Loop has 6 letters. [2025-04-26 16:23:57,187 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:57,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19252 states and 80705 transitions. [2025-04-26 16:23:57,331 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 963 [2025-04-26 16:23:57,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19252 states to 7809 states and 31834 transitions. [2025-04-26 16:23:57,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1773 [2025-04-26 16:23:57,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2442 [2025-04-26 16:23:57,384 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7809 states and 31834 transitions. [2025-04-26 16:23:57,384 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:57,384 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7809 states and 31834 transitions. [2025-04-26 16:23:57,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7809 states and 31834 transitions. [2025-04-26 16:23:57,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7809 to 3116. [2025-04-26 16:23:57,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3116 states, 3116 states have (on average 4.251283697047497) internal successors, (in total 13247), 3115 states have internal predecessors, (13247), 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:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 13247 transitions. [2025-04-26 16:23:57,572 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3116 states and 13247 transitions. [2025-04-26 16:23:57,572 INFO L438 stractBuchiCegarLoop]: Abstraction has 3116 states and 13247 transitions. [2025-04-26 16:23:57,572 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:23:57,573 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3116 states and 13247 transitions. [2025-04-26 16:23:57,586 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 756 [2025-04-26 16:23:57,587 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:57,587 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:57,587 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:57,587 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:57,588 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" [2025-04-26 16:23:57,588 INFO L754 eck$LassoCheckResult]: Loop: "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" [2025-04-26 16:23:57,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash 950009288, now seen corresponding path program 1 times [2025-04-26 16:23:57,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:57,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146539375] [2025-04-26 16:23:57,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:57,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:57,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:57,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:57,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:57,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:57,593 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:57,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:57,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:57,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:57,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:57,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:57,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:57,597 INFO L85 PathProgramCache]: Analyzing trace with hash 3973156, now seen corresponding path program 6 times [2025-04-26 16:23:57,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:57,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408251652] [2025-04-26 16:23:57,597 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:23:57,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:57,600 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:57,601 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:57,601 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:23:57,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:57,601 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:57,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:57,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:57,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:57,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:57,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:57,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:57,603 INFO L85 PathProgramCache]: Analyzing trace with hash -913677717, now seen corresponding path program 3 times [2025-04-26 16:23:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:57,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959710475] [2025-04-26 16:23:57,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:57,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:57,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-26 16:23:57,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:23:57,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 16:23:57,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:57,608 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:57,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:23:57,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:23:57,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:57,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:57,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:57,764 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:57,764 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:57,764 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:57,764 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:57,764 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:57,764 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:57,764 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:57,764 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:57,764 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration10_Lasso [2025-04-26 16:23:57,765 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:57,765 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:57,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:57,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:57,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:57,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:57,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:57,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:57,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:57,944 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:57,944 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:57,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:57,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:57,946 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:57,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:23:57,949 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:57,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:57,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:57,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:57,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:57,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:57,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:57,964 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:57,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:23:57,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:57,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:57,972 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:57,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:23:57,974 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:57,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:57,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:57,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:57,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:57,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:57,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:57,988 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:57,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:23:57,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:57,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:57,995 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:57,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:23:57,997 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:58,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:58,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:58,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:58,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:58,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:58,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:58,013 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:58,019 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:23:58,020 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:58,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:58,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:58,021 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:58,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:23:58,024 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:58,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:23:58,040 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:58,040 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:58,040 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(front1, back1) = -1*front1 + 1*back1 Supporting invariants [] [2025-04-26 16:23:58,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:23:58,050 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:23:58,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:58,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:58,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:58,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:58,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:58,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:58,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:58,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:58,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:58,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:58,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:58,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:58,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:58,108 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:58,108 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:58,108 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3116 states and 13247 transitions. cyclomatic complexity: 10206 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:58,147 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3116 states and 13247 transitions. cyclomatic complexity: 10206. 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 3945 states and 16300 transitions. Complement of second has 5 states. [2025-04-26 16:23:58,147 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:58,147 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:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-26 16:23:58,148 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 41 transitions. Stem has 16 letters. Loop has 4 letters. [2025-04-26 16:23:58,148 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:58,148 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:58,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:58,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:58,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:58,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:58,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:58,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:58,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:58,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:58,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:58,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:58,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:58,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:58,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:58,208 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:58,208 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:58,208 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3116 states and 13247 transitions. cyclomatic complexity: 10206 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:58,275 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3116 states and 13247 transitions. cyclomatic complexity: 10206. 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 4782 states and 19754 transitions. Complement of second has 7 states. [2025-04-26 16:23:58,275 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:58,275 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:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-04-26 16:23:58,276 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 16 letters. Loop has 4 letters. [2025-04-26 16:23:58,276 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:58,276 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:58,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:58,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:58,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:58,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:58,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:58,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:58,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:58,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:58,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:58,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:58,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:58,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:58,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:58,324 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:58,325 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:58,325 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3116 states and 13247 transitions. cyclomatic complexity: 10206 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:58,397 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3116 states and 13247 transitions. cyclomatic complexity: 10206. 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 7772 states and 32474 transitions. Complement of second has 5 states. [2025-04-26 16:23:58,398 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:58,398 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:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-04-26 16:23:58,398 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 16 letters. Loop has 4 letters. [2025-04-26 16:23:58,399 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:58,399 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 20 letters. Loop has 4 letters. [2025-04-26 16:23:58,399 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:58,399 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 16 letters. Loop has 8 letters. [2025-04-26 16:23:58,399 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:58,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7772 states and 32474 transitions. [2025-04-26 16:23:58,459 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:58,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7772 states to 0 states and 0 transitions. [2025-04-26 16:23:58,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:23:58,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:23:58,460 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:23:58,460 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:58,460 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:58,460 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:58,460 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:58,460 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:23:58,460 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:23:58,460 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:58,460 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:23:58,465 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:58 BoogieIcfgContainer [2025-04-26 16:23:58,465 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:58,466 INFO L158 Benchmark]: Toolchain (without parser) took 9071.56ms. Allocated memory was 159.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 85.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 372.1MB. Max. memory is 8.0GB. [2025-04-26 16:23:58,466 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.69ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:58,466 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.12ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 83.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:58,466 INFO L158 Benchmark]: Boogie Preprocessor took 22.57ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 82.5MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:23:58,466 INFO L158 Benchmark]: RCFGBuilder took 229.24ms. Allocated memory is still 159.4MB. Free memory was 82.5MB in the beginning and 71.9MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:23:58,466 INFO L158 Benchmark]: BuchiAutomizer took 8776.27ms. Allocated memory was 159.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 71.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 359.5MB. Max. memory is 8.0GB. [2025-04-26 16:23:58,467 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.69ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.12ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 83.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.57ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 82.5MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 229.24ms. Allocated memory is still 159.4MB. Free memory was 82.5MB in the beginning and 71.9MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 8776.27ms. Allocated memory was 159.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 71.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 359.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.6s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 3.5s. Construction of modules took 0.3s. Büchi inclusion checks took 3.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 1.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 13111 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 1.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 538 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 530 mSDsluCounter, 573 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 235 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 372 IncrementalHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 338 mSDtfsCounter, 372 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital86 mio100 ax100 hnf100 lsp63 ukn99 mio100 lsp59 div100 bol100 ite100 ukn100 eq206 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 52ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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 10 terminating modules (6 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function w and consists of 5 locations. One deterministic module has affine ranking function back2 + -1 * front2 and consists of 3 locations. One nondeterministic module has affine ranking function back2 + -1 * front2 and consists of 3 locations. One nondeterministic module has affine ranking function -1 * front1 + back1 and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:23:58,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-26 16:23:58,682 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...