/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/POPL2023/map-aggr-update3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:09,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:09,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:09,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:09,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:09,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:39:09,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:09,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:09,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:09,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:09,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:09,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:09,806 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:09,806 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:09,806 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:09,806 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:09,806 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:09,806 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:09,807 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:09,807 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:09,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:09,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:09,807 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:09,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:09,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:09,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:09,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:09,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:09,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:09,807 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:09,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:09,807 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:09,810 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:09,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:09,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:09,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:09,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:09,810 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:09,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:09,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:09,810 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:09,811 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:09,811 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:10,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:10,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:10,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:10,051 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:10,051 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:10,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update3.bpl [2025-04-26 18:39:10,054 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update3.bpl' [2025-04-26 18:39:10,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:10,075 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:10,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:10,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:10,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:10,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,112 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:10,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:10,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:10,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:10,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:10,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,129 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:10,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:10,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:10,151 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:10,152 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:10,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:10,200 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:39:10,202 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:39:10,223 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:39:10,223 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:39:10,223 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:39:10,223 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:39:10,223 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:39:10,224 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:39:10,224 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:39:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:39:10,224 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:39:10,224 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:10,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:10,224 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:39:10,261 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:10,262 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:10,344 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:10,344 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:10,357 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:10,357 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:39:10,357 INFO L201 PluginConnector]: Adding new model map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:10 BoogieIcfgContainer [2025-04-26 18:39:10,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:10,358 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:10,358 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:10,363 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:10,364 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:10,364 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/2) ... [2025-04-26 18:39:10,365 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@441cc952 and model type map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:10, skipping insertion in model container [2025-04-26 18:39:10,365 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:10,365 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:10" (2/2) ... [2025-04-26 18:39:10,366 INFO L376 chiAutomizerObserver]: Analyzing ICFG map-aggr-update3.bpl [2025-04-26 18:39:10,422 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:39:10,458 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:10,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:10,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:10,460 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:39:10,462 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:39:10,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 101 flow [2025-04-26 18:39:10,536 INFO L116 PetriNetUnfolderBase]: 5/34 cut-off events. [2025-04-26 18:39:10,539 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:39:10,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 5/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-04-26 18:39:10,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 40 transitions, 101 flow [2025-04-26 18:39:10,548 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 86 flow [2025-04-26 18:39:10,548 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 39 places, 34 transitions, 86 flow [2025-04-26 18:39:10,549 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 34 transitions, 86 flow [2025-04-26 18:39:10,617 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 498 states, 496 states have (on average 3.157258064516129) internal successors, (in total 1566), 497 states have internal predecessors, (1566), 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:39:10,622 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 498 states, 496 states have (on average 3.157258064516129) internal successors, (in total 1566), 497 states have internal predecessors, (1566), 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:39:10,624 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:10,748 WARN L140 AmpleReduction]: Number of pruned transitions: 425 [2025-04-26 18:39:10,749 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:10,749 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 66 [2025-04-26 18:39:10,749 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:27 [2025-04-26 18:39:10,749 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:215 [2025-04-26 18:39:10,749 WARN L145 AmpleReduction]: Times succ was already a loop node:31 [2025-04-26 18:39:10,749 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:128 [2025-04-26 18:39:10,749 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:10,750 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 309 states, 307 states have (on average 1.778501628664495) internal successors, (in total 546), 308 states have internal predecessors, (546), 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:39:10,756 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:10,756 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:10,756 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:10,757 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:10,757 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:10,757 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:10,757 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:10,757 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:10,759 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 309 states, 307 states have (on average 1.778501628664495) internal successors, (in total 546), 308 states have internal predecessors, (546), 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:39:10,773 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 242 [2025-04-26 18:39:10,773 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:10,773 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:10,777 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:10,777 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:10,777 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:10,778 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 309 states, 307 states have (on average 1.778501628664495) internal successors, (in total 546), 308 states have internal predecessors, (546), 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:39:10,786 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 242 [2025-04-26 18:39:10,786 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:10,786 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:10,786 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:10,786 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:10,790 INFO L752 eck$LassoCheckResult]: Stem: "[83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" [2025-04-26 18:39:10,790 INFO L754 eck$LassoCheckResult]: Loop: "[90] L51-1-->L52: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[92] L52-->L53: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork0_i_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A]" "[93] L53-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" [2025-04-26 18:39:10,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:10,794 INFO L85 PathProgramCache]: Analyzing trace with hash 113176, now seen corresponding path program 1 times [2025-04-26 18:39:10,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:10,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169466915] [2025-04-26 18:39:10,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:10,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:10,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:10,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:10,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,845 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:10,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:10,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:10,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:10,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:10,865 INFO L85 PathProgramCache]: Analyzing trace with hash 119226, now seen corresponding path program 1 times [2025-04-26 18:39:10,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:10,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065378841] [2025-04-26 18:39:10,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:10,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:10,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:10,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:10,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,881 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:10,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:10,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:10,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:10,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash -923251645, now seen corresponding path program 1 times [2025-04-26 18:39:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:10,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495466241] [2025-04-26 18:39:10,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:10,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:10,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:10,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:10,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,899 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:10,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:10,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:10,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:11,045 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:11,046 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:11,046 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:11,046 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:11,046 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:11,046 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,046 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:11,046 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:11,046 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update3.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:11,046 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:11,046 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:11,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,156 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:11,159 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:11,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:11,163 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:39:11,165 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:39:11,166 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:39:11,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:11,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:11,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:11,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:11,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:11,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:11,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:11,191 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:11,198 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:39:11,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:11,200 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:39:11,202 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:39:11,203 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:39:11,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:11,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:11,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:11,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:11,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:11,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:11,235 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:11,253 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 18:39:11,253 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:39:11,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:11,311 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:39:11,313 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:39:11,313 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:11,330 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:39:11,331 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:11,331 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:11,331 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2025-04-26 18:39:11,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:11,339 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:11,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:11,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:11,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:11,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:11,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:11,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:11,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:11,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:11,378 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:11,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:11,398 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:39:11,414 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:39:11,416 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 309 states, 307 states have (on average 1.778501628664495) internal successors, (in total 546), 308 states have internal predecessors, (546), 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 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:39:11,524 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 309 states, 307 states have (on average 1.778501628664495) internal successors, (in total 546), 308 states have internal predecessors, (546), 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 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 698 states and 1262 transitions. Complement of second has 6 states. [2025-04-26 18:39:11,526 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:39:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:39:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-04-26 18:39:11,534 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:39:11,536 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:11,536 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:39:11,536 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:11,536 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:39:11,537 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:11,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 698 states and 1262 transitions. [2025-04-26 18:39:11,549 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 77 [2025-04-26 18:39:11,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 698 states to 372 states and 645 transitions. [2025-04-26 18:39:11,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2025-04-26 18:39:11,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 [2025-04-26 18:39:11,563 INFO L74 IsDeterministic]: Start isDeterministic. Operand 372 states and 645 transitions. [2025-04-26 18:39:11,564 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:11,564 INFO L218 hiAutomatonCegarLoop]: Abstraction has 372 states and 645 transitions. [2025-04-26 18:39:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 645 transitions. [2025-04-26 18:39:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 326. [2025-04-26 18:39:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 326 states have (on average 1.7699386503067485) internal successors, (in total 577), 325 states have internal predecessors, (577), 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:39:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 577 transitions. [2025-04-26 18:39:11,603 INFO L240 hiAutomatonCegarLoop]: Abstraction has 326 states and 577 transitions. [2025-04-26 18:39:11,603 INFO L438 stractBuchiCegarLoop]: Abstraction has 326 states and 577 transitions. [2025-04-26 18:39:11,603 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:11,603 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 326 states and 577 transitions. [2025-04-26 18:39:11,605 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 77 [2025-04-26 18:39:11,606 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:11,606 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:11,606 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:11,606 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:39:11,606 INFO L752 eck$LassoCheckResult]: Stem: "[83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[89] L51-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[91] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1]" "[94] $Ultimate##0-->L64: Formula: (= (+ v_thread2Thread1of1ForFork1_cnt_1 1) 0) InVars {} OutVars{thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_cnt]" "[95] L64-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j]" [2025-04-26 18:39:11,606 INFO L754 eck$LassoCheckResult]: Loop: "[97] L65-1-->L66: Formula: (< v_thread2Thread1of1ForFork1_j_5 v_N_4) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[100] L66-->L66-2: Formula: (not (= (select v_A_4 v_thread2Thread1of1ForFork1_j_9) 0)) InVars {A=v_A_4, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} AuxVars[] AssignedVars[]" "[103] L66-2-->L69-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork1_j_13) 0) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[105] L69-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_16 (+ v_thread2Thread1of1ForFork1_j_15 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_15} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j]" [2025-04-26 18:39:11,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1812472188, now seen corresponding path program 1 times [2025-04-26 18:39:11,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:11,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378882467] [2025-04-26 18:39:11,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:11,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:11,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:11,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:11,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:11,663 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:39:11,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:11,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378882467] [2025-04-26 18:39:11,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378882467] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:11,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:11,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:39:11,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727531413] [2025-04-26 18:39:11,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:11,668 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:11,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,668 INFO L85 PathProgramCache]: Analyzing trace with hash 3912646, now seen corresponding path program 1 times [2025-04-26 18:39:11,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:11,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146165496] [2025-04-26 18:39:11,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:11,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:11,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:11,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:11,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,672 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:11,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:11,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:11,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:11,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:11,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:11,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:11,706 INFO L87 Difference]: Start difference. First operand 326 states and 577 transitions. cyclomatic complexity: 280 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 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:39:11,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:11,745 INFO L93 Difference]: Finished difference Result 326 states and 576 transitions. [2025-04-26 18:39:11,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 326 states and 576 transitions. [2025-04-26 18:39:11,747 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 77 [2025-04-26 18:39:11,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 326 states to 326 states and 576 transitions. [2025-04-26 18:39:11,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2025-04-26 18:39:11,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2025-04-26 18:39:11,749 INFO L74 IsDeterministic]: Start isDeterministic. Operand 326 states and 576 transitions. [2025-04-26 18:39:11,750 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:11,750 INFO L218 hiAutomatonCegarLoop]: Abstraction has 326 states and 576 transitions. [2025-04-26 18:39:11,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states and 576 transitions. [2025-04-26 18:39:11,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-04-26 18:39:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 326 states have (on average 1.7668711656441718) internal successors, (in total 576), 325 states have internal predecessors, (576), 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:39:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 576 transitions. [2025-04-26 18:39:11,758 INFO L240 hiAutomatonCegarLoop]: Abstraction has 326 states and 576 transitions. [2025-04-26 18:39:11,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:39:11,759 INFO L438 stractBuchiCegarLoop]: Abstraction has 326 states and 576 transitions. [2025-04-26 18:39:11,759 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:11,759 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 326 states and 576 transitions. [2025-04-26 18:39:11,761 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 77 [2025-04-26 18:39:11,761 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:11,761 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:11,761 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:11,761 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:39:11,761 INFO L752 eck$LassoCheckResult]: Stem: "[83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[90] L51-1-->L52: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[92] L52-->L53: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork0_i_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A]" "[93] L53-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[89] L51-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[91] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1]" "[94] $Ultimate##0-->L64: Formula: (= (+ v_thread2Thread1of1ForFork1_cnt_1 1) 0) InVars {} OutVars{thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_cnt]" "[95] L64-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j]" [2025-04-26 18:39:11,762 INFO L754 eck$LassoCheckResult]: Loop: "[97] L65-1-->L66: Formula: (< v_thread2Thread1of1ForFork1_j_5 v_N_4) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[100] L66-->L66-2: Formula: (not (= (select v_A_4 v_thread2Thread1of1ForFork1_j_9) 0)) InVars {A=v_A_4, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} AuxVars[] AssignedVars[]" "[103] L66-2-->L69-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork1_j_13) 0) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[105] L69-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_16 (+ v_thread2Thread1of1ForFork1_j_15 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_15} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j]" [2025-04-26 18:39:11,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,762 INFO L85 PathProgramCache]: Analyzing trace with hash 968700465, now seen corresponding path program 1 times [2025-04-26 18:39:11,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:11,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851960539] [2025-04-26 18:39:11,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:11,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:11,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:11,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:11,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,769 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:11,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:11,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:11,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:11,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,775 INFO L85 PathProgramCache]: Analyzing trace with hash 3912646, now seen corresponding path program 2 times [2025-04-26 18:39:11,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:11,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609437302] [2025-04-26 18:39:11,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:11,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:11,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:11,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:11,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:11,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,779 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:11,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:11,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:11,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:11,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,782 INFO L85 PathProgramCache]: Analyzing trace with hash -692826634, now seen corresponding path program 1 times [2025-04-26 18:39:11,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:11,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281278565] [2025-04-26 18:39:11,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:11,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:11,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:11,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:11,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,799 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:11,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:11,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:11,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:11,962 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:11,962 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:11,962 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:11,962 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:11,962 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:11,962 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,962 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:11,962 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:11,962 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update3.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:39:11,962 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:11,962 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:11,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:12,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:12,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:12,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:12,196 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:12,196 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:12,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,199 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:39:12,200 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:39:12,201 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:39:12,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,217 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:12,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:39:12,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,225 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:39:12,226 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:39:12,227 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:39:12,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,248 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:12,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:39:12,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,269 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:39:12,270 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:39:12,273 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:39:12,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,327 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:12,336 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:39:12,337 INFO L437 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 18:39:12,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,339 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:39:12,340 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:39:12,341 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:12,363 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:39:12,363 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:12,363 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:12,363 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, N) = -1*thread2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2025-04-26 18:39:12,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:12,369 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:12,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:12,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:12,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:12,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:12,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:12,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:12,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:12,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:12,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:12,406 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:12,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:12,422 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:39:12,423 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:39:12,423 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 326 states and 576 transitions. cyclomatic complexity: 279 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:39:12,480 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 326 states and 576 transitions. cyclomatic complexity: 279. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 687 states and 1231 transitions. Complement of second has 6 states. [2025-04-26 18:39:12,482 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:39:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:39:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-26 18:39:12,484 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:39:12,484 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:12,484 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 18:39:12,484 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:12,484 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 11 letters. Loop has 8 letters. [2025-04-26 18:39:12,484 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:12,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 687 states and 1231 transitions. [2025-04-26 18:39:12,491 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2025-04-26 18:39:12,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 687 states to 372 states and 648 transitions. [2025-04-26 18:39:12,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2025-04-26 18:39:12,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2025-04-26 18:39:12,495 INFO L74 IsDeterministic]: Start isDeterministic. Operand 372 states and 648 transitions. [2025-04-26 18:39:12,495 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:12,496 INFO L218 hiAutomatonCegarLoop]: Abstraction has 372 states and 648 transitions. [2025-04-26 18:39:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 648 transitions. [2025-04-26 18:39:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 361. [2025-04-26 18:39:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 361 states have (on average 1.745152354570637) internal successors, (in total 630), 360 states have internal predecessors, (630), 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:39:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 630 transitions. [2025-04-26 18:39:12,509 INFO L240 hiAutomatonCegarLoop]: Abstraction has 361 states and 630 transitions. [2025-04-26 18:39:12,509 INFO L438 stractBuchiCegarLoop]: Abstraction has 361 states and 630 transitions. [2025-04-26 18:39:12,509 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:39:12,509 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 361 states and 630 transitions. [2025-04-26 18:39:12,510 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2025-04-26 18:39:12,510 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:12,510 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:12,510 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:12,510 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:12,511 INFO L752 eck$LassoCheckResult]: Stem: "[83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[90] L51-1-->L52: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[92] L52-->L53: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork0_i_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A]" "[117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1]" "[94] $Ultimate##0-->L64: Formula: (= (+ v_thread2Thread1of1ForFork1_cnt_1 1) 0) InVars {} OutVars{thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_cnt]" "[93] L53-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[89] L51-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[95] L64-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j]" "[96] L65-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork1_j_3) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_3, N=v_N_3} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_3, N=v_N_3} AuxVars[] AssignedVars[]" "[91] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[98] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[120] L35-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_12} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k]" "[106] $Ultimate##0-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k]" [2025-04-26 18:39:12,511 INFO L754 eck$LassoCheckResult]: Loop: "[108] L83-1-->L84: Formula: (< v_thread3Thread1of1ForFork2_k_5 v_N_5) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[110] L84-->L85: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork2_k_7 v_thread3Thread1of1ForFork2_k_7)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[111] L85-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_9 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k]" [2025-04-26 18:39:12,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:12,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1421794567, now seen corresponding path program 1 times [2025-04-26 18:39:12,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:12,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737340352] [2025-04-26 18:39:12,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:12,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:12,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:12,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:12,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:12,563 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:39:12,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:12,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737340352] [2025-04-26 18:39:12,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737340352] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:12,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:12,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:39:12,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69567254] [2025-04-26 18:39:12,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:12,563 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:12,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:12,564 INFO L85 PathProgramCache]: Analyzing trace with hash 137100, now seen corresponding path program 1 times [2025-04-26 18:39:12,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:12,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910624299] [2025-04-26 18:39:12,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:12,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:12,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:12,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:12,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,567 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:12,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:12,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:12,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:12,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:12,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:12,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:12,587 INFO L87 Difference]: Start difference. First operand 361 states and 630 transitions. cyclomatic complexity: 297 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:39:12,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:12,632 INFO L93 Difference]: Finished difference Result 408 states and 709 transitions. [2025-04-26 18:39:12,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 408 states and 709 transitions. [2025-04-26 18:39:12,634 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2025-04-26 18:39:12,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 408 states to 408 states and 709 transitions. [2025-04-26 18:39:12,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2025-04-26 18:39:12,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2025-04-26 18:39:12,639 INFO L74 IsDeterministic]: Start isDeterministic. Operand 408 states and 709 transitions. [2025-04-26 18:39:12,639 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:12,639 INFO L218 hiAutomatonCegarLoop]: Abstraction has 408 states and 709 transitions. [2025-04-26 18:39:12,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states and 709 transitions. [2025-04-26 18:39:12,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 386. [2025-04-26 18:39:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 386 states have (on average 1.738341968911917) internal successors, (in total 671), 385 states have internal predecessors, (671), 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:39:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 671 transitions. [2025-04-26 18:39:12,650 INFO L240 hiAutomatonCegarLoop]: Abstraction has 386 states and 671 transitions. [2025-04-26 18:39:12,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:39:12,652 INFO L438 stractBuchiCegarLoop]: Abstraction has 386 states and 671 transitions. [2025-04-26 18:39:12,652 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:39:12,652 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 671 transitions. [2025-04-26 18:39:12,653 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2025-04-26 18:39:12,653 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:12,653 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:12,654 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:12,654 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:12,654 INFO L752 eck$LassoCheckResult]: Stem: "[83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[90] L51-1-->L52: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[92] L52-->L53: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork0_i_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A]" "[117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1]" "[94] $Ultimate##0-->L64: Formula: (= (+ v_thread2Thread1of1ForFork1_cnt_1 1) 0) InVars {} OutVars{thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_cnt]" "[93] L53-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[89] L51-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[95] L64-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j]" "[97] L65-1-->L66: Formula: (< v_thread2Thread1of1ForFork1_j_5 v_N_4) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[100] L66-->L66-2: Formula: (not (= (select v_A_4 v_thread2Thread1of1ForFork1_j_9) 0)) InVars {A=v_A_4, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} AuxVars[] AssignedVars[]" "[91] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[120] L35-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_12} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k]" "[106] $Ultimate##0-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k]" "[108] L83-1-->L84: Formula: (< v_thread3Thread1of1ForFork2_k_5 v_N_5) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[121] thread1EXIT-->L37: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" [2025-04-26 18:39:12,654 INFO L754 eck$LassoCheckResult]: Loop: "[110] L84-->L85: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork2_k_7 v_thread3Thread1of1ForFork2_k_7)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[111] L85-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_9 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k]" "[108] L83-1-->L84: Formula: (< v_thread3Thread1of1ForFork2_k_5 v_N_5) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} AuxVars[] AssignedVars[]" [2025-04-26 18:39:12,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:12,654 INFO L85 PathProgramCache]: Analyzing trace with hash 593726103, now seen corresponding path program 1 times [2025-04-26 18:39:12,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:12,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248498780] [2025-04-26 18:39:12,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:12,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:12,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:39:12,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:39:12,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,667 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:12,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:39:12,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:39:12,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:12,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:12,681 INFO L85 PathProgramCache]: Analyzing trace with hash 139050, now seen corresponding path program 2 times [2025-04-26 18:39:12,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:12,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681769246] [2025-04-26 18:39:12,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:12,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:12,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:12,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:12,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:12,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,686 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:12,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:12,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:12,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:12,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:12,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1019118804, now seen corresponding path program 1 times [2025-04-26 18:39:12,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:12,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077367763] [2025-04-26 18:39:12,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:12,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:12,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:39:12,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:39:12,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,695 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:12,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:39:12,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:39:12,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:12,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:39:12,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:39:12,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:12,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:39:12,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:39:12,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,891 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:39:12,901 INFO L201 PluginConnector]: Adding new model map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:12 BoogieIcfgContainer [2025-04-26 18:39:12,901 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:12,901 INFO L158 Benchmark]: Toolchain (without parser) took 2826.89ms. Allocated memory was 184.5MB in the beginning and 142.6MB in the end (delta: -41.9MB). Free memory was 106.5MB in the beginning and 43.6MB in the end (delta: 62.9MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2025-04-26 18:39:12,902 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.92ms. Allocated memory is still 184.5MB. Free memory is still 107.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:12,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.62ms. Allocated memory is still 184.5MB. Free memory was 106.5MB in the beginning and 104.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:12,902 INFO L158 Benchmark]: Boogie Preprocessor took 30.04ms. Allocated memory is still 184.5MB. Free memory was 104.6MB in the beginning and 103.6MB in the end (delta: 994.9kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:12,902 INFO L158 Benchmark]: RCFGBuilder took 209.39ms. Allocated memory is still 184.5MB. Free memory was 103.4MB in the beginning and 93.5MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:39:12,906 INFO L158 Benchmark]: BuchiAutomizer took 2542.76ms. Allocated memory was 184.5MB in the beginning and 142.6MB in the end (delta: -41.9MB). Free memory was 93.3MB in the beginning and 43.6MB in the end (delta: 49.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2025-04-26 18:39:12,907 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.92ms. Allocated memory is still 184.5MB. Free memory is still 107.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.62ms. Allocated memory is still 184.5MB. Free memory was 106.5MB in the beginning and 104.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 30.04ms. Allocated memory is still 184.5MB. Free memory was 104.6MB in the beginning and 103.6MB in the end (delta: 994.9kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 209.39ms. Allocated memory is still 184.5MB. Free memory was 103.4MB in the beginning and 93.5MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2542.76ms. Allocated memory was 184.5MB in the beginning and 142.6MB in the end (delta: -41.9MB). Free memory was 93.3MB in the beginning and 43.6MB in the end (delta: 49.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 79 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 151 IncrementalHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 110 mSDtfsCounter, 151 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital72 mio100 ax100 hnf100 lsp130 ukn44 mio100 lsp83 div100 bol100 ite100 ukn100 eq151 hnf96 smp100 dnf120 smp77 tf100 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 132ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 295, Number of transitions in reduction automaton: 546, Number of states in reduction automaton: 309, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 386 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 84]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L32] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L34] FORK 0 fork 1 thread1(); VAL [N=1, m=0] [L50] 1 i := 0; VAL [N=1, i=0, m=0] [L51] COND TRUE 1 i < N VAL [N=1, i=0, m=0] [L52] 1 A := A[i := (if A[i] < 0 then -A[i] else A[i])]; VAL [N=1, i=0, m=0] [L35] FORK 0 fork 2, 2 thread2(); VAL [N=1, i=0, m=0] [L62] 2 cnt := -1; VAL [N=1, cnt=-1, i=0, m=0] [L53] 1 i := i + 1; VAL [N=1, cnt=-1, i=1, m=0] [L51] COND FALSE 1 !(i < N) VAL [N=1, cnt=-1, i=1, m=0] [L64] 2 j := 0; VAL [N=1, cnt=-1, i=1, j=0, m=0] [L65] COND TRUE 2 j < N VAL [N=1, cnt=-1, i=1, j=0, m=0] [L66] COND FALSE 2 !(A[j] == 0) VAL [N=1, cnt=-1, i=1, j=0, m=0] [L36] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, cnt=-1, i=1, j=0, m=0] [L82] 3 k := 0; VAL [N=1, cnt=-1, i=1, j=0, k=0, m=0] [L83] COND TRUE 3 k < N VAL [N=1, cnt=-1, i=1, j=0, k=0, m=0] [L37] JOIN 1 join 1; VAL [N=1, cnt=-1, i=1, j=0, k=0, m=0] Loop: [L84] B[k] := k; [L85] k := 0; [L83] COND TRUE k < N End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 84]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L32] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L34] FORK 0 fork 1 thread1(); VAL [N=1, m=0] [L50] 1 i := 0; VAL [N=1, i=0, m=0] [L51] COND TRUE 1 i < N VAL [N=1, i=0, m=0] [L52] 1 A := A[i := (if A[i] < 0 then -A[i] else A[i])]; VAL [N=1, i=0, m=0] [L35] FORK 0 fork 2, 2 thread2(); VAL [N=1, i=0, m=0] [L62] 2 cnt := -1; VAL [N=1, cnt=-1, i=0, m=0] [L53] 1 i := i + 1; VAL [N=1, cnt=-1, i=1, m=0] [L51] COND FALSE 1 !(i < N) VAL [N=1, cnt=-1, i=1, m=0] [L64] 2 j := 0; VAL [N=1, cnt=-1, i=1, j=0, m=0] [L65] COND TRUE 2 j < N VAL [N=1, cnt=-1, i=1, j=0, m=0] [L66] COND FALSE 2 !(A[j] == 0) VAL [N=1, cnt=-1, i=1, j=0, m=0] [L36] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, cnt=-1, i=1, j=0, m=0] [L82] 3 k := 0; VAL [N=1, cnt=-1, i=1, j=0, k=0, m=0] [L83] COND TRUE 3 k < N VAL [N=1, cnt=-1, i=1, j=0, k=0, m=0] [L37] JOIN 1 join 1; VAL [N=1, cnt=-1, i=1, j=0, k=0, m=0] Loop: [L84] B[k] := k; [L85] k := 0; [L83] COND TRUE k < N End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:39:12,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...