/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/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/inc-subseq.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:08,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:08,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:08,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:08,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:08,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:08,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:08,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:08,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:08,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:08,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:08,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:08,770 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:08,770 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:08,770 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:08,770 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:08,770 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:08,770 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:08,771 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:08,771 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:08,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:08,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:08,771 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:08,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:08,771 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:08,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:08,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:08,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:08,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:08,771 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:08,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:08,771 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:08,771 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:08,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:08,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:08,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:08,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:08,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:08,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:08,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:08,772 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:08,772 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:08,772 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:08,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:08,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:08,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:08,996 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:08,996 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:08,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/inc-subseq.wvr.bpl [2025-04-26 18:41:08,997 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/inc-subseq.wvr.bpl' [2025-04-26 18:41:09,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:09,015 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:09,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:09,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:09,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:09,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:09" (1/1) ... [2025-04-26 18:41:09,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:09" (1/1) ... [2025-04-26 18:41:09,049 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:09,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:09,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:09,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:09,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:09,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:09" (1/1) ... [2025-04-26 18:41:09,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:09" (1/1) ... [2025-04-26 18:41:09,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:09" (1/1) ... [2025-04-26 18:41:09,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:09" (1/1) ... [2025-04-26 18:41:09,061 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:09" (1/1) ... [2025-04-26 18:41:09,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:09" (1/1) ... [2025-04-26 18:41:09,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:09" (1/1) ... [2025-04-26 18:41:09,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:09" (1/1) ... [2025-04-26 18:41:09,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:09" (1/1) ... [2025-04-26 18:41:09,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:09,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:09,076 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:09,077 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:09,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:09" (1/1) ... [2025-04-26 18:41:09,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:09,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:09,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:09,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:41:09,126 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:09,126 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:09,126 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:09,126 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:09,126 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:09,126 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:09,126 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:09,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:09,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:09,127 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 18:41:09,163 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:09,164 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:09,227 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:09,227 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:09,243 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:09,243 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:09,244 INFO L201 PluginConnector]: Adding new model inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:09 BoogieIcfgContainer [2025-04-26 18:41:09,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:09,244 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:09,245 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:09,249 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:09,249 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:09,249 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:09" (1/2) ... [2025-04-26 18:41:09,250 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3df0fd96 and model type inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:09, skipping insertion in model container [2025-04-26 18:41:09,250 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:09,250 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:09" (2/2) ... [2025-04-26 18:41:09,251 INFO L376 chiAutomizerObserver]: Analyzing ICFG inc-subseq.wvr.bpl [2025-04-26 18:41:09,288 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:41:09,324 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:09,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:09,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:09,326 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:09,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:41:09,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 74 flow [2025-04-26 18:41:09,387 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-26 18:41:09,388 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:41:09,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 3/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-26 18:41:09,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 74 flow [2025-04-26 18:41:09,393 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 64 flow [2025-04-26 18:41:09,393 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 26 transitions, 64 flow [2025-04-26 18:41:09,394 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 26 transitions, 64 flow [2025-04-26 18:41:09,405 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 65 states, 63 states have (on average 2.015873015873016) internal successors, (in total 127), 64 states have internal predecessors, (127), 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 18:41:09,406 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 65 states, 63 states have (on average 2.015873015873016) internal successors, (in total 127), 64 states have internal predecessors, (127), 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 18:41:09,407 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:09,463 WARN L140 AmpleReduction]: Number of pruned transitions: 29 [2025-04-26 18:41:09,463 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:09,463 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3 [2025-04-26 18:41:09,463 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:29 [2025-04-26 18:41:09,463 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:26 [2025-04-26 18:41:09,463 WARN L145 AmpleReduction]: Times succ was already a loop node:8 [2025-04-26 18:41:09,463 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:6 [2025-04-26 18:41:09,463 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:09,464 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 59 states, 57 states have (on average 1.4385964912280702) internal successors, (in total 82), 58 states have internal predecessors, (82), 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 18:41:09,469 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:09,469 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:09,469 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:09,469 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:09,469 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:09,469 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:09,469 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:09,469 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:09,470 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 59 states, 57 states have (on average 1.4385964912280702) internal successors, (in total 82), 58 states have internal predecessors, (82), 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 18:41:09,480 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 41 [2025-04-26 18:41:09,480 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:09,480 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:09,484 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:09,484 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:09,484 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:09,485 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 59 states, 57 states have (on average 1.4385964912280702) internal successors, (in total 82), 58 states have internal predecessors, (82), 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 18:41:09,486 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 41 [2025-04-26 18:41:09,486 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:09,486 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:09,487 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:09,487 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:09,490 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" [2025-04-26 18:41:09,490 INFO L754 eck$LassoCheckResult]: Loop: "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[72] L24-->L24-2: Formula: (< (select v_A_4 v_i_5) v_last_3) InVars {A=v_A_4, last=v_last_3, i=v_i_5} OutVars{A=v_A_4, last=v_last_3, i=v_i_5} AuxVars[] AssignedVars[]" "[74] L24-2-->L23: Formula: (= v_i_6 (+ v_i_7 1)) InVars {i=v_i_7} OutVars{i=v_i_6} AuxVars[] AssignedVars[i]" [2025-04-26 18:41:09,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,498 INFO L85 PathProgramCache]: Analyzing trace with hash 88116564, now seen corresponding path program 1 times [2025-04-26 18:41:09,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:09,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662009781] [2025-04-26 18:41:09,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:09,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:09,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:09,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:09,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,547 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:09,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:09,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:09,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:09,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,566 INFO L85 PathProgramCache]: Analyzing trace with hash 98406, now seen corresponding path program 1 times [2025-04-26 18:41:09,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:09,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52776443] [2025-04-26 18:41:09,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:09,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:09,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:09,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:09,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,573 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:09,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:09,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:09,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:09,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,578 INFO L85 PathProgramCache]: Analyzing trace with hash 855608883, now seen corresponding path program 1 times [2025-04-26 18:41:09,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:09,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84903714] [2025-04-26 18:41:09,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:09,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:09,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:09,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:09,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:09,752 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 18:41:09,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:09,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84903714] [2025-04-26 18:41:09,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84903714] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:09,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:09,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:41:09,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342316752] [2025-04-26 18:41:09,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:09,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:09,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:41:09,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:41:09,822 INFO L87 Difference]: Start difference. First operand has 59 states, 57 states have (on average 1.4385964912280702) internal successors, (in total 82), 58 states have internal predecessors, (82), 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) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 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 18:41:09,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:09,917 INFO L93 Difference]: Finished difference Result 150 states and 211 transitions. [2025-04-26 18:41:09,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 211 transitions. [2025-04-26 18:41:09,923 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 97 [2025-04-26 18:41:09,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 126 states and 178 transitions. [2025-04-26 18:41:09,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2025-04-26 18:41:09,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2025-04-26 18:41:09,934 INFO L74 IsDeterministic]: Start isDeterministic. Operand 126 states and 178 transitions. [2025-04-26 18:41:09,935 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:09,935 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 178 transitions. [2025-04-26 18:41:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 178 transitions. [2025-04-26 18:41:09,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 50. [2025-04-26 18:41:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.4) internal successors, (in total 70), 49 states have internal predecessors, (70), 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 18:41:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2025-04-26 18:41:09,958 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 70 transitions. [2025-04-26 18:41:09,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:41:09,961 INFO L438 stractBuchiCegarLoop]: Abstraction has 50 states and 70 transitions. [2025-04-26 18:41:09,962 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:09,962 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 70 transitions. [2025-04-26 18:41:09,965 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 41 [2025-04-26 18:41:09,965 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:09,965 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:09,966 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:09,966 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:09,966 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:09,966 INFO L754 eck$LassoCheckResult]: Loop: "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[75] L25-1-->L24-2: Formula: (= (select v_A_3 v_i_4) v_last_2) InVars {A=v_A_3, i=v_i_4} OutVars{A=v_A_3, last=v_last_2, i=v_i_4} AuxVars[] AssignedVars[last]" "[74] L24-2-->L23: Formula: (= v_i_6 (+ v_i_7 1)) InVars {i=v_i_7} OutVars{i=v_i_6} AuxVars[] AssignedVars[i]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:09,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1219325706, now seen corresponding path program 1 times [2025-04-26 18:41:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:09,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810381134] [2025-04-26 18:41:09,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:09,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:09,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:09,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:09,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:09,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:09,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:09,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:09,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash 98353833, now seen corresponding path program 1 times [2025-04-26 18:41:09,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:09,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319982794] [2025-04-26 18:41:09,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:09,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:09,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:10,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:10,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,001 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:10,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:10,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:10,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1840743124, now seen corresponding path program 1 times [2025-04-26 18:41:10,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,009 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951981205] [2025-04-26 18:41:10,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:10,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:10,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,022 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:10,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:10,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:10,157 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:10,158 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:10,158 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:10,158 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:10,158 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:10,158 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,159 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:10,159 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:10,159 INFO L132 ssoRankerPreferences]: Filename of dumped script: inc-subseq.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:41:10,159 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:10,159 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:10,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:10,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:10,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:10,312 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:10,314 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:10,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:10,317 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 18:41:10,319 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 18:41:10,320 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 18:41:10,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:10,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:10,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:10,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:10,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:10,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:10,341 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:10,347 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 18:41:10,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:10,350 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 18:41:10,352 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 18:41:10,353 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 18:41:10,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:10,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:10,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:10,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:10,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:10,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:10,368 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:10,374 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 18:41:10,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:10,376 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 18:41:10,378 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 18:41:10,379 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 18:41:10,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:10,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:10,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:10,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:10,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:10,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:10,400 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:10,406 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 18:41:10,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:10,408 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 18:41:10,409 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 18:41:10,411 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 18:41:10,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:10,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:10,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:10,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:10,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:10,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:10,430 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:10,440 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:41:10,440 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:10,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:10,456 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 18:41:10,458 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 18:41:10,459 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:10,476 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 18:41:10,477 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:10,477 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:10,477 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 18:41:10,484 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 18:41:10,485 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:10,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:10,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:10,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:10,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:10,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:10,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:10,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:10,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:10,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:10,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:10,580 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 18:41:10,582 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:41:10,583 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 70 transitions. cyclomatic complexity: 27 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (in total 12), 5 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 18:41:10,656 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 70 transitions. cyclomatic complexity: 27. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (in total 12), 5 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) Result 111 states and 163 transitions. Complement of second has 6 states. [2025-04-26 18:41:10,656 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 18:41:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (in total 12), 5 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 18:41:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-26 18:41:10,660 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 7 letters. Loop has 5 letters. [2025-04-26 18:41:10,660 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:10,660 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 12 letters. Loop has 5 letters. [2025-04-26 18:41:10,660 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:10,660 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 7 letters. Loop has 10 letters. [2025-04-26 18:41:10,663 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:10,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 163 transitions. [2025-04-26 18:41:10,665 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:41:10,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 73 states and 106 transitions. [2025-04-26 18:41:10,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2025-04-26 18:41:10,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-04-26 18:41:10,666 INFO L74 IsDeterministic]: Start isDeterministic. Operand 73 states and 106 transitions. [2025-04-26 18:41:10,667 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:10,667 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 106 transitions. [2025-04-26 18:41:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 106 transitions. [2025-04-26 18:41:10,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2025-04-26 18:41:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.4736842105263157) internal successors, (in total 84), 56 states have internal predecessors, (84), 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 18:41:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2025-04-26 18:41:10,671 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-04-26 18:41:10,671 INFO L438 stractBuchiCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-04-26 18:41:10,671 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:10,671 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 84 transitions. [2025-04-26 18:41:10,672 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-04-26 18:41:10,672 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:10,672 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:10,673 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:10,673 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:10,674 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[68] L23-->thread1FINAL: Formula: (<= v_N_2 v_i_8) InVars {i=v_i_8, N=v_N_2} OutVars{i=v_i_8, N=v_N_2} AuxVars[] AssignedVars[]" "[70] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 18:41:10,674 INFO L754 eck$LassoCheckResult]: Loop: "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (<= v_v_old_1 v_new_2) v_ok_2 v_ok_1) (and (or (not v_ok_2) (< v_new_2 v_v_old_1)) (not v_ok_1))) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" [2025-04-26 18:41:10,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,674 INFO L85 PathProgramCache]: Analyzing trace with hash 855607870, now seen corresponding path program 1 times [2025-04-26 18:41:10,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230837590] [2025-04-26 18:41:10,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:10,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:10,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,684 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:10,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:10,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:10,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,691 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 1 times [2025-04-26 18:41:10,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017801711] [2025-04-26 18:41:10,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:10,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:10,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:10,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:10,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:10,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,702 INFO L85 PathProgramCache]: Analyzing trace with hash 934833761, now seen corresponding path program 1 times [2025-04-26 18:41:10,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14921267] [2025-04-26 18:41:10,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:10,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:10,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:10,760 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 18:41:10,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:10,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14921267] [2025-04-26 18:41:10,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14921267] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:10,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:10,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:10,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855628494] [2025-04-26 18:41:10,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:10,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:10,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:41:10,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:41:10,857 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 3.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 18:41:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:10,891 INFO L93 Difference]: Finished difference Result 64 states and 92 transitions. [2025-04-26 18:41:10,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 92 transitions. [2025-04-26 18:41:10,892 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-04-26 18:41:10,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 61 states and 89 transitions. [2025-04-26 18:41:10,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-04-26 18:41:10,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-04-26 18:41:10,893 INFO L74 IsDeterministic]: Start isDeterministic. Operand 61 states and 89 transitions. [2025-04-26 18:41:10,893 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:10,893 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 89 transitions. [2025-04-26 18:41:10,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 89 transitions. [2025-04-26 18:41:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-04-26 18:41:10,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.459016393442623) internal successors, (in total 89), 60 states have internal predecessors, (89), 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 18:41:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2025-04-26 18:41:10,898 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 89 transitions. [2025-04-26 18:41:10,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:41:10,900 INFO L438 stractBuchiCegarLoop]: Abstraction has 61 states and 89 transitions. [2025-04-26 18:41:10,900 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:10,901 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 89 transitions. [2025-04-26 18:41:10,901 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-04-26 18:41:10,901 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:10,901 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:10,901 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:10,902 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:10,902 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[75] L25-1-->L24-2: Formula: (= (select v_A_3 v_i_4) v_last_2) InVars {A=v_A_3, i=v_i_4} OutVars{A=v_A_3, last=v_last_2, i=v_i_4} AuxVars[] AssignedVars[last]" [2025-04-26 18:41:10,902 INFO L754 eck$LassoCheckResult]: Loop: "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (<= v_v_old_1 v_new_2) v_ok_2 v_ok_1) (and (or (not v_ok_2) (< v_new_2 v_v_old_1)) (not v_ok_1))) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" [2025-04-26 18:41:10,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1901365184, now seen corresponding path program 1 times [2025-04-26 18:41:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988849572] [2025-04-26 18:41:10,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:10,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:10,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,914 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:10,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:10,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:10,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,924 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 2 times [2025-04-26 18:41:10,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651011200] [2025-04-26 18:41:10,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:10,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,929 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:10,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:10,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:10,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:10,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:10,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:10,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,938 INFO L85 PathProgramCache]: Analyzing trace with hash 544135907, now seen corresponding path program 1 times [2025-04-26 18:41:10,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,939 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442280749] [2025-04-26 18:41:10,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:10,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:10,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,946 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:10,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:10,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:11,154 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:11,155 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:11,155 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:11,155 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:11,155 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:11,155 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,155 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:11,155 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:11,155 INFO L132 ssoRankerPreferences]: Filename of dumped script: inc-subseq.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:41:11,155 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:11,155 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:11,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,367 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:11,367 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:11,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,369 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 18:41:11,371 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 18:41:11,372 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 18:41:11,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,387 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,393 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 18:41:11,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,395 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 18:41:11,395 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 18:41:11,396 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 18:41:11,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,410 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,416 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 18:41:11,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,419 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 18:41:11,420 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 18:41:11,421 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 18:41:11,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,437 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:11,447 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:41:11,447 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:11,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,449 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 18:41:11,451 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 18:41:11,452 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:11,467 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 18:41:11,468 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:11,468 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:11,468 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2025-04-26 18:41:11,473 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 18:41:11,474 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:11,489 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:11,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:11,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:11,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:11,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:11,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:11,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:11,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:11,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:11,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:11,539 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 18:41:11,539 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 18:41:11,539 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 89 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 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 18:41:11,555 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 89 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 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 163 states and 251 transitions. Complement of second has 5 states. [2025-04-26 18:41:11,556 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 18:41:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 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 18:41:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-04-26 18:41:11,556 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 18:41:11,557 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:11,557 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 18:41:11,557 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:11,557 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 10 letters. Loop has 8 letters. [2025-04-26 18:41:11,557 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:11,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 251 transitions. [2025-04-26 18:41:11,559 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-04-26 18:41:11,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 106 states and 163 transitions. [2025-04-26 18:41:11,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2025-04-26 18:41:11,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2025-04-26 18:41:11,560 INFO L74 IsDeterministic]: Start isDeterministic. Operand 106 states and 163 transitions. [2025-04-26 18:41:11,560 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:11,560 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106 states and 163 transitions. [2025-04-26 18:41:11,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 163 transitions. [2025-04-26 18:41:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-04-26 18:41:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.5377358490566038) internal successors, (in total 163), 105 states have internal predecessors, (163), 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 18:41:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 163 transitions. [2025-04-26 18:41:11,564 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 163 transitions. [2025-04-26 18:41:11,564 INFO L438 stractBuchiCegarLoop]: Abstraction has 106 states and 163 transitions. [2025-04-26 18:41:11,564 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:11,564 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 163 transitions. [2025-04-26 18:41:11,564 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-04-26 18:41:11,564 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:11,564 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:11,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:11,565 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:11,565 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[75] L25-1-->L24-2: Formula: (= (select v_A_3 v_i_4) v_last_2) InVars {A=v_A_3, i=v_i_4} OutVars{A=v_A_3, last=v_last_2, i=v_i_4} AuxVars[] AssignedVars[last]" "[74] L24-2-->L23: Formula: (= v_i_6 (+ v_i_7 1)) InVars {i=v_i_7} OutVars{i=v_i_6} AuxVars[] AssignedVars[i]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[75] L25-1-->L24-2: Formula: (= (select v_A_3 v_i_4) v_last_2) InVars {A=v_A_3, i=v_i_4} OutVars{A=v_A_3, last=v_last_2, i=v_i_4} AuxVars[] AssignedVars[last]" [2025-04-26 18:41:11,565 INFO L754 eck$LassoCheckResult]: Loop: "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (<= v_v_old_1 v_new_2) v_ok_2 v_ok_1) (and (or (not v_ok_2) (< v_new_2 v_v_old_1)) (not v_ok_1))) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" [2025-04-26 18:41:11,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,566 INFO L85 PathProgramCache]: Analyzing trace with hash -314733362, now seen corresponding path program 1 times [2025-04-26 18:41:11,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:11,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518439110] [2025-04-26 18:41:11,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:11,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:11,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:11,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:11,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,573 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:11,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:11,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:11,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:11,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,586 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 3 times [2025-04-26 18:41:11,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:11,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750917001] [2025-04-26 18:41:11,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:11,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:11,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:11,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:11,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:41:11,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,590 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:11,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:11,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:11,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:11,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,593 INFO L85 PathProgramCache]: Analyzing trace with hash -955078415, now seen corresponding path program 1 times [2025-04-26 18:41:11,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:11,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813068011] [2025-04-26 18:41:11,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:11,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:11,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:41:11,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:41:11,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,602 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:11,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:41:11,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:41:11,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:11,800 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:11,800 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:11,800 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:11,800 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:11,800 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:11,800 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,800 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:11,800 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:11,800 INFO L132 ssoRankerPreferences]: Filename of dumped script: inc-subseq.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:41:11,800 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:11,800 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:11,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:12,042 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:12,042 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:12,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:12,045 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 18:41:12,046 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 18:41:12,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:12,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:12,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:12,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:12,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:12,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:12,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:12,061 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:12,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:41:12,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:12,068 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 18:41:12,069 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 18:41:12,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:12,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:12,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:12,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:12,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:12,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:12,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:12,085 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:12,090 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 18:41:12,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:12,092 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:12,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:41:12,094 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 18:41:12,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:12,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:12,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:12,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:12,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:12,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:12,110 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:12,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:41:12,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:12,123 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 18:41:12,125 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 18:41:12,126 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 18:41:12,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:12,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:12,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:12,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:12,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:12,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:12,141 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:12,147 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 18:41:12,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:12,149 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 18:41:12,150 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 18:41:12,151 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 18:41:12,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:12,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:12,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:12,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:12,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:12,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:12,164 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:12,170 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 18:41:12,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:12,171 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 18:41:12,172 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 18:41:12,173 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 18:41:12,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:12,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:12,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:12,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:12,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:12,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:12,193 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:12,198 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:41:12,199 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:12,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:12,201 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 18:41:12,201 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 18:41:12,202 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:12,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:41:12,218 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:12,218 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:12,218 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(start, end) = -1*start + 1*end Supporting invariants [] [2025-04-26 18:41:12,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:12,226 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:12,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:12,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:12,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:12,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:12,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:12,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:12,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:12,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:12,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:12,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:12,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:12,281 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 18:41:12,282 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 18:41:12,282 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 163 transitions. cyclomatic complexity: 71 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 18:41:12,302 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 163 transitions. cyclomatic complexity: 71. 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 146 states and 229 transitions. Complement of second has 5 states. [2025-04-26 18:41:12,303 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 18:41:12,304 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 18:41:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2025-04-26 18:41:12,304 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 18:41:12,304 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:12,304 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:12,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:12,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:12,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:12,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:12,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:12,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:12,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:12,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:12,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:12,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:12,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:12,366 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 18:41:12,367 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 18:41:12,367 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 163 transitions. cyclomatic complexity: 71 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 18:41:12,397 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 163 transitions. cyclomatic complexity: 71. 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 158 states and 249 transitions. Complement of second has 7 states. [2025-04-26 18:41:12,400 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 18:41:12,400 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 18:41:12,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2025-04-26 18:41:12,400 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 18:41:12,400 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:12,400 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:12,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:12,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:12,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:12,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:12,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:12,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:12,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:12,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:12,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:12,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:12,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:12,450 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 18:41:12,451 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 18:41:12,451 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 163 transitions. cyclomatic complexity: 71 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 18:41:12,467 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 163 transitions. cyclomatic complexity: 71. 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 199 states and 319 transitions. Complement of second has 4 states. [2025-04-26 18:41:12,467 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 18:41:12,467 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 18:41:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-26 18:41:12,468 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 18:41:12,468 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:12,468 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 18:41:12,468 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:12,468 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 15 letters. Loop has 8 letters. [2025-04-26 18:41:12,468 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:12,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 199 states and 319 transitions. [2025-04-26 18:41:12,471 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:12,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 199 states to 0 states and 0 transitions. [2025-04-26 18:41:12,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:12,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:12,471 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:12,471 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:12,471 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:12,471 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:12,471 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:12,471 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:41:12,471 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:12,471 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:12,471 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:12,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:41:12,484 INFO L201 PluginConnector]: Adding new model inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:12 BoogieIcfgContainer [2025-04-26 18:41:12,484 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:12,486 INFO L158 Benchmark]: Toolchain (without parser) took 3468.82ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 83.9MB in the beginning and 65.8MB in the end (delta: 18.1MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2025-04-26 18:41:12,487 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:12,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.68ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 82.1MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:41:12,488 INFO L158 Benchmark]: Boogie Preprocessor took 24.84ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 81.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:12,488 INFO L158 Benchmark]: RCFGBuilder took 167.45ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 71.4MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:12,488 INFO L158 Benchmark]: BuchiAutomizer took 3239.32ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.4MB in the beginning and 65.8MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:12,489 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.16ms. Allocated memory is still 155.2MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.68ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 82.1MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.84ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 81.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 167.45ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 71.4MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3239.32ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.4MB in the beginning and 65.8MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 92 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 194 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 171 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 154 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 106 mSDtfsCounter, 154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital78 mio100 ax100 hnf100 lsp92 ukn78 mio100 lsp62 div100 bol113 ite100 ukn100 eq171 hnf89 smp100 dnf177 smp74 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 144, Number of transitions in reduction automaton: 82, Number of states in reduction automaton: 59, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function end + -1 * start and consists of 3 locations. One nondeterministic module has affine ranking function end + -1 * start and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:12,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...