/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-comp.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:09,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:09,952 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,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:09,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:09,958 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,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:09,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:09,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:09,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:09,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:09,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:09,977 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:09,978 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:09,978 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:09,978 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:09,978 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:09,978 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:09,978 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:09,978 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:09,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:09,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:09,978 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:09,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:09,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:09,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:09,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:09,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:09,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:09,980 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:09,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:09,980 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:09,980 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:09,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:09,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:09,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:09,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:09,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:09,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:09,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:09,981 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:09,981 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:09,981 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:10,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:10,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:10,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:10,212 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:10,213 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:10,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-comp.bpl [2025-04-26 18:39:10,214 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-comp.bpl' [2025-04-26 18:39:10,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:10,230 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:10,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:10,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:10,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:10,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,266 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:10,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:10,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:10,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:10,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:10,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,277 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:10,290 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:10,290 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:10,290 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:10,291 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/1) ... [2025-04-26 18:39:10,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:10,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:10,317 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,322 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,338 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:39:10,338 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:39:10,338 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:39:10,339 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:39:10,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:39:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:39:10,340 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:39:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:39:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:39:10,340 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:10,340 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,374 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:10,375 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:10,454 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:10,454 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:10,461 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:10,461 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:39:10,461 INFO L201 PluginConnector]: Adding new model map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:10 BoogieIcfgContainer [2025-04-26 18:39:10,462 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:10,463 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:10,464 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:10,467 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:10,468 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:10,468 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:10" (1/2) ... [2025-04-26 18:39:10,469 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55a52ff4 and model type map-comp.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,469 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:10,469 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:10" (2/2) ... [2025-04-26 18:39:10,470 INFO L376 chiAutomizerObserver]: Analyzing ICFG map-comp.bpl [2025-04-26 18:39:10,527 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:39:10,574 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:10,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:10,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:10,579 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,581 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,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 91 flow [2025-04-26 18:39:10,651 INFO L116 PetriNetUnfolderBase]: 3/29 cut-off events. [2025-04-26 18:39:10,652 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:39:10,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-26 18:39:10,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 91 flow [2025-04-26 18:39:10,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2025-04-26 18:39:10,658 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 36 places, 29 transitions, 76 flow [2025-04-26 18:39:10,659 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 29 transitions, 76 flow [2025-04-26 18:39:10,695 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 307 states, 305 states have (on average 2.9344262295081966) internal successors, (in total 895), 306 states have internal predecessors, (895), 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,698 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 307 states, 305 states have (on average 2.9344262295081966) internal successors, (in total 895), 306 states have internal predecessors, (895), 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,700 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:10,786 WARN L140 AmpleReduction]: Number of pruned transitions: 230 [2025-04-26 18:39:10,786 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:10,786 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 52 [2025-04-26 18:39:10,786 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:23 [2025-04-26 18:39:10,786 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:127 [2025-04-26 18:39:10,786 WARN L145 AmpleReduction]: Times succ was already a loop node:17 [2025-04-26 18:39:10,786 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:89 [2025-04-26 18:39:10,787 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:10,787 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 203 states, 201 states have (on average 1.7611940298507462) internal successors, (in total 354), 202 states have internal predecessors, (354), 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,794 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:10,794 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:10,794 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:10,794 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:10,794 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:10,794 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:10,794 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:10,794 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:10,796 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 203 states, 201 states have (on average 1.7611940298507462) internal successors, (in total 354), 202 states have internal predecessors, (354), 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,809 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 165 [2025-04-26 18:39:10,809 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:10,809 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:10,812 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:39:10,812 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:10,812 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:10,812 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 203 states, 201 states have (on average 1.7611940298507462) internal successors, (in total 354), 202 states have internal predecessors, (354), 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,817 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 165 [2025-04-26 18:39:10,817 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:10,817 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:10,817 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:39:10,817 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:10,821 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[]" "[41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B]" "[90] L18-->$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]" "[70] $Ultimate##0-->L34-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,821 INFO L754 eck$LassoCheckResult]: Loop: "[72] L34-1-->L35: 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[]" "[74] L35-->L36: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 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]" "[75] L36-->L34-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,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2902197, now seen corresponding path program 1 times [2025-04-26 18:39:10,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:10,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806954877] [2025-04-26 18:39:10,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:10,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:10,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:10,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:10,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,878 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:10,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:10,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:10,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:10,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:10,902 INFO L85 PathProgramCache]: Analyzing trace with hash 101352, now seen corresponding path program 1 times [2025-04-26 18:39:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:10,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467777162] [2025-04-26 18:39:10,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:10,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:10,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:10,916 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,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,916 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:10,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:10,921 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,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:10,927 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:10,927 INFO L85 PathProgramCache]: Analyzing trace with hash 560076468, now seen corresponding path program 1 times [2025-04-26 18:39:10,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:10,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521285791] [2025-04-26 18:39:10,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:10,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:10,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:10,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:10,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,938 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:10,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:10,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:10,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:11,121 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:11,122 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:11,122 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:11,122 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:11,122 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:11,122 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,122 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:11,122 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:11,123 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:11,123 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:11,123 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:11,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,281 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:11,283 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:11,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:11,287 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,288 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,289 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,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:11,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:11,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:11,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:11,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:11,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:11,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:11,306 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:11,312 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,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:11,314 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,315 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,317 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,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:11,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:11,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:11,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:11,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:11,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:11,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:11,330 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:11,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:39:11,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:11,339 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,341 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,342 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,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:11,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:11,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:11,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:11,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:11,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:11,368 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:11,385 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:39:11,385 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:39:11,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:11,410 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:11,412 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:11,413 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:11,429 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:11,430 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:11,430 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:11,430 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,436 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,439 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:11,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:11,469 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,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:11,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:11,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:11,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:11,483 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,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:11,484 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:11,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:11,513 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,529 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,530 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 203 states, 201 states have (on average 1.7611940298507462) internal successors, (in total 354), 202 states have internal predecessors, (354), 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.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:11,629 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 203 states, 201 states have (on average 1.7611940298507462) internal successors, (in total 354), 202 states have internal predecessors, (354), 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.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 445 states and 795 transitions. Complement of second has 6 states. [2025-04-26 18:39:11,634 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,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-26 18:39:11,640 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 18:39:11,641 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:11,641 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 18:39:11,641 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:11,641 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 18:39:11,641 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:11,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 445 states and 795 transitions. [2025-04-26 18:39:11,647 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 18:39:11,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 445 states to 222 states and 387 transitions. [2025-04-26 18:39:11,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2025-04-26 18:39:11,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2025-04-26 18:39:11,655 INFO L74 IsDeterministic]: Start isDeterministic. Operand 222 states and 387 transitions. [2025-04-26 18:39:11,656 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:11,656 INFO L218 hiAutomatonCegarLoop]: Abstraction has 222 states and 387 transitions. [2025-04-26 18:39:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 387 transitions. [2025-04-26 18:39:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 194. [2025-04-26 18:39:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 194 states have (on average 1.7525773195876289) internal successors, (in total 340), 193 states have internal predecessors, (340), 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,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 340 transitions. [2025-04-26 18:39:11,681 INFO L240 hiAutomatonCegarLoop]: Abstraction has 194 states and 340 transitions. [2025-04-26 18:39:11,681 INFO L438 stractBuchiCegarLoop]: Abstraction has 194 states and 340 transitions. [2025-04-26 18:39:11,681 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:11,682 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 340 transitions. [2025-04-26 18:39:11,683 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 18:39:11,683 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:11,683 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:11,683 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:11,683 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:11,684 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[]" "[41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B]" "[90] L18-->$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]" "[70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[71] L34-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[]" "[73] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[93] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[76] $Ultimate##0-->L46-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" [2025-04-26 18:39:11,684 INFO L754 eck$LassoCheckResult]: Loop: "[78] L46-1-->L47: Formula: (< v_thread2Thread1of1ForFork1_i_5 v_N_4) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} AuxVars[] AssignedVars[]" "[80] L47-->L48: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ 2 (select v_A_4 v_thread2Thread1of1ForFork1_i_7))) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[81] L48-->L46-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" [2025-04-26 18:39:11,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash 182471206, now seen corresponding path program 1 times [2025-04-26 18:39:11,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:11,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337934009] [2025-04-26 18:39:11,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:11,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:11,690 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,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:11,735 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,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:11,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337934009] [2025-04-26 18:39:11,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337934009] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:11,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:11,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:39:11,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301126268] [2025-04-26 18:39:11,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:11,740 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:11,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,740 INFO L85 PathProgramCache]: Analyzing trace with hash 107310, now seen corresponding path program 1 times [2025-04-26 18:39:11,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:11,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009516807] [2025-04-26 18:39:11,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:11,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:11,746 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,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,747 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:11,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:11,751 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,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:11,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:11,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:11,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:11,776 INFO L87 Difference]: Start difference. First operand 194 states and 340 transitions. cyclomatic complexity: 173 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,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:11,825 INFO L93 Difference]: Finished difference Result 194 states and 339 transitions. [2025-04-26 18:39:11,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 339 transitions. [2025-04-26 18:39:11,828 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 18:39:11,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 339 transitions. [2025-04-26 18:39:11,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2025-04-26 18:39:11,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2025-04-26 18:39:11,830 INFO L74 IsDeterministic]: Start isDeterministic. Operand 194 states and 339 transitions. [2025-04-26 18:39:11,830 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:11,830 INFO L218 hiAutomatonCegarLoop]: Abstraction has 194 states and 339 transitions. [2025-04-26 18:39:11,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 339 transitions. [2025-04-26 18:39:11,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-04-26 18:39:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 194 states have (on average 1.7474226804123711) internal successors, (in total 339), 193 states have internal predecessors, (339), 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,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 339 transitions. [2025-04-26 18:39:11,838 INFO L240 hiAutomatonCegarLoop]: Abstraction has 194 states and 339 transitions. [2025-04-26 18:39:11,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:39:11,839 INFO L438 stractBuchiCegarLoop]: Abstraction has 194 states and 339 transitions. [2025-04-26 18:39:11,839 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:11,839 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 339 transitions. [2025-04-26 18:39:11,841 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 18:39:11,841 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:11,842 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:11,842 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:11,842 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:11,844 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[]" "[41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B]" "[90] L18-->$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]" "[70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[72] L34-1-->L35: 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[]" "[74] L35-->L36: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 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] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[76] $Ultimate##0-->L46-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" "[75] L36-->L34-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]" "[71] L34-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[]" [2025-04-26 18:39:11,845 INFO L754 eck$LassoCheckResult]: Loop: "[78] L46-1-->L47: Formula: (< v_thread2Thread1of1ForFork1_i_5 v_N_4) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} AuxVars[] AssignedVars[]" "[80] L47-->L48: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ 2 (select v_A_4 v_thread2Thread1of1ForFork1_i_7))) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[81] L48-->L46-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" [2025-04-26 18:39:11,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,845 INFO L85 PathProgramCache]: Analyzing trace with hash -709275102, now seen corresponding path program 1 times [2025-04-26 18:39:11,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:11,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347826826] [2025-04-26 18:39:11,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:11,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:11,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:11,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:11,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:11,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:11,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:11,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:11,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,864 INFO L85 PathProgramCache]: Analyzing trace with hash 107310, now seen corresponding path program 2 times [2025-04-26 18:39:11,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:11,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439295308] [2025-04-26 18:39:11,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:11,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:11,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:11,869 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:11,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:11,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,869 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:11,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:11,871 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,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:11,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1224610157, now seen corresponding path program 1 times [2025-04-26 18:39:11,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:11,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346492941] [2025-04-26 18:39:11,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:11,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:11,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:39:11,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:39:11,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:11,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:39:11,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:39:11,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:12,013 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:12,013 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:12,013 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:12,013 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:12,014 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:12,014 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,014 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:12,014 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:12,014 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:39:12,014 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:12,014 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:12,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:12,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:12,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:12,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:12,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:12,163 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:12,164 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:12,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,168 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,169 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,170 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,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,185 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:12,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:12,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,193 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,194 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,194 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,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,208 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:12,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:39:12,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,216 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,218 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,219 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,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,236 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:12,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:12,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,243 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:12,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:39:12,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:12,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,265 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:12,286 INFO L436 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-04-26 18:39:12,287 INFO L437 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 18:39:12,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,288 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:12,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:39:12,291 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:12,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:12,308 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:12,308 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:12,308 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_i, N) = -1*thread2Thread1of1ForFork1_i + 1*N Supporting invariants [] [2025-04-26 18:39:12,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:39:12,315 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:12,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:12,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:12,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:12,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:12,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:12,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:12,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:12,351 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,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:12,352 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:12,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:12,368 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,368 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,368 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 194 states and 339 transitions. cyclomatic complexity: 172 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:12,418 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 194 states and 339 transitions. cyclomatic complexity: 172. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 465 states and 847 transitions. Complement of second has 7 states. [2025-04-26 18:39:12,419 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,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-04-26 18:39:12,419 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 18:39:12,420 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:12,420 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 18:39:12,420 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:12,420 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 10 letters. Loop has 6 letters. [2025-04-26 18:39:12,420 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:12,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 465 states and 847 transitions. [2025-04-26 18:39:12,424 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 69 [2025-04-26 18:39:12,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 465 states to 307 states and 525 transitions. [2025-04-26 18:39:12,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2025-04-26 18:39:12,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2025-04-26 18:39:12,426 INFO L74 IsDeterministic]: Start isDeterministic. Operand 307 states and 525 transitions. [2025-04-26 18:39:12,426 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:12,426 INFO L218 hiAutomatonCegarLoop]: Abstraction has 307 states and 525 transitions. [2025-04-26 18:39:12,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 525 transitions. [2025-04-26 18:39:12,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 254. [2025-04-26 18:39:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 254 states have (on average 1.7755905511811023) internal successors, (in total 451), 253 states have internal predecessors, (451), 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,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 451 transitions. [2025-04-26 18:39:12,434 INFO L240 hiAutomatonCegarLoop]: Abstraction has 254 states and 451 transitions. [2025-04-26 18:39:12,434 INFO L438 stractBuchiCegarLoop]: Abstraction has 254 states and 451 transitions. [2025-04-26 18:39:12,434 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:39:12,434 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 254 states and 451 transitions. [2025-04-26 18:39:12,435 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 54 [2025-04-26 18:39:12,436 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:12,436 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:12,436 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:12,436 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:12,436 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[]" "[41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B]" "[90] L18-->$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]" "[70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[72] L34-1-->L35: 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[]" "[74] L35-->L36: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 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]" "[75] L36-->L34-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]" "[71] L34-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[]" "[73] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[93] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[76] $Ultimate##0-->L46-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" [2025-04-26 18:39:12,436 INFO L754 eck$LassoCheckResult]: Loop: "[78] L46-1-->L47: Formula: (< v_thread2Thread1of1ForFork1_i_5 v_N_4) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} AuxVars[] AssignedVars[]" "[80] L47-->L48: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ 2 (select v_A_4 v_thread2Thread1of1ForFork1_i_7))) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[81] L48-->L46-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" [2025-04-26 18:39:12,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:12,437 INFO L85 PathProgramCache]: Analyzing trace with hash -529465179, now seen corresponding path program 1 times [2025-04-26 18:39:12,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:12,437 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959549726] [2025-04-26 18:39:12,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:12,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:12,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:12,442 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,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,444 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:12,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:12,447 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,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:12,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:12,450 INFO L85 PathProgramCache]: Analyzing trace with hash 107310, now seen corresponding path program 3 times [2025-04-26 18:39:12,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:12,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714676248] [2025-04-26 18:39:12,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:12,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:12,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:12,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:12,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:39:12,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:12,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:12,456 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,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:12,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:12,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2117808138, now seen corresponding path program 1 times [2025-04-26 18:39:12,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:12,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987274890] [2025-04-26 18:39:12,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:12,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:12,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:39:12,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:39:12,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:12,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:39:12,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:39:12,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:12,552 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:12,552 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:12,552 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:12,553 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:12,553 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:12,553 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,553 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:12,553 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:12,553 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:39:12,553 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:12,553 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:12,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:12,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:12,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:12,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:12,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:12,682 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:12,683 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:12,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,686 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:12,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:39:12,688 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,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,707 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:12,717 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:39:12,717 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:39:12,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,719 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:12,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:39:12,721 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:12,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:39:12,737 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:12,738 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:12,738 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_i, N) = -1*thread2Thread1of1ForFork1_i + 1*N Supporting invariants [] [2025-04-26 18:39:12,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:39:12,744 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:12,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:12,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:12,762 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,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:12,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:12,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:12,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:12,777 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,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:12,777 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:12,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:12,794 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,794 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,795 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 254 states and 451 transitions. cyclomatic complexity: 223 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:12,849 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 254 states and 451 transitions. cyclomatic complexity: 223. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 530 states and 970 transitions. Complement of second has 6 states. [2025-04-26 18:39:12,851 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,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-04-26 18:39:12,853 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 18:39:12,853 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:12,853 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 18:39:12,853 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:12,853 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 11 letters. Loop has 6 letters. [2025-04-26 18:39:12,853 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:12,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 970 transitions. [2025-04-26 18:39:12,857 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:39:12,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 298 states and 533 transitions. [2025-04-26 18:39:12,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2025-04-26 18:39:12,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2025-04-26 18:39:12,862 INFO L74 IsDeterministic]: Start isDeterministic. Operand 298 states and 533 transitions. [2025-04-26 18:39:12,862 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:12,862 INFO L218 hiAutomatonCegarLoop]: Abstraction has 298 states and 533 transitions. [2025-04-26 18:39:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 533 transitions. [2025-04-26 18:39:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 245. [2025-04-26 18:39:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 245 states have (on average 1.8081632653061224) internal successors, (in total 443), 244 states have internal predecessors, (443), 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,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 443 transitions. [2025-04-26 18:39:12,875 INFO L240 hiAutomatonCegarLoop]: Abstraction has 245 states and 443 transitions. [2025-04-26 18:39:12,875 INFO L438 stractBuchiCegarLoop]: Abstraction has 245 states and 443 transitions. [2025-04-26 18:39:12,875 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:39:12,875 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 245 states and 443 transitions. [2025-04-26 18:39:12,876 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:39:12,876 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:12,876 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:12,877 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,877 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:12,878 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[]" "[41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B]" "[90] L18-->$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]" "[70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[72] L34-1-->L35: 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[]" "[74] L35-->L36: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 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]" "[75] L36-->L34-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]" "[71] L34-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[]" "[73] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[93] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[76] $Ultimate##0-->L46-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" "[77] L46-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork1_i_3) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_3, N=v_N_3} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_3, N=v_N_3} AuxVars[] AssignedVars[]" "[79] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[96] L19-->$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_i=v_thread3Thread1of1ForFork2_i_14, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_i, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[82] $Ultimate##0-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i]" [2025-04-26 18:39:12,878 INFO L754 eck$LassoCheckResult]: Loop: "[84] L58-1-->L59: Formula: (< v_thread3Thread1of1ForFork2_i_5 v_N_5) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} AuxVars[] AssignedVars[]" "[86] L59-->L60: Formula: (= v_B_1 (store v_B_2 v_thread3Thread1of1ForFork2_i_7 (+ 3 (select v_B_2 v_thread3Thread1of1ForFork2_i_7)))) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_2} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_1} AuxVars[] AssignedVars[B]" "[87] L60-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_10 (+ v_thread3Thread1of1ForFork2_i_9 1)) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_9} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i]" [2025-04-26 18:39:12,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:12,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1227512633, now seen corresponding path program 1 times [2025-04-26 18:39:12,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:12,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066337671] [2025-04-26 18:39:12,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:12,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:12,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:12,885 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,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 18:39:12,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:12,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066337671] [2025-04-26 18:39:12,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066337671] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:12,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:12,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:39:12,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493746647] [2025-04-26 18:39:12,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:12,919 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:12,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:12,919 INFO L85 PathProgramCache]: Analyzing trace with hash 113268, now seen corresponding path program 1 times [2025-04-26 18:39:12,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:12,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560668527] [2025-04-26 18:39:12,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:12,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:12,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:12,922 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,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,922 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:12,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:12,923 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,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:12,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:12,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:12,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:12,940 INFO L87 Difference]: Start difference. First operand 245 states and 443 transitions. cyclomatic complexity: 219 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,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:12,971 INFO L93 Difference]: Finished difference Result 292 states and 516 transitions. [2025-04-26 18:39:12,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 516 transitions. [2025-04-26 18:39:12,974 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:39:12,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 270 states and 487 transitions. [2025-04-26 18:39:12,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2025-04-26 18:39:12,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2025-04-26 18:39:12,976 INFO L74 IsDeterministic]: Start isDeterministic. Operand 270 states and 487 transitions. [2025-04-26 18:39:12,976 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:12,976 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 487 transitions. [2025-04-26 18:39:12,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 487 transitions. [2025-04-26 18:39:12,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 245. [2025-04-26 18:39:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 245 states have (on average 1.8040816326530613) internal successors, (in total 442), 244 states have internal predecessors, (442), 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,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 442 transitions. [2025-04-26 18:39:12,983 INFO L240 hiAutomatonCegarLoop]: Abstraction has 245 states and 442 transitions. [2025-04-26 18:39:12,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:39:12,986 INFO L438 stractBuchiCegarLoop]: Abstraction has 245 states and 442 transitions. [2025-04-26 18:39:12,986 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:39:12,986 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 245 states and 442 transitions. [2025-04-26 18:39:12,987 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:39:12,987 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:12,987 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:12,987 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:12,987 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:12,988 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[]" "[41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B]" "[90] L18-->$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]" "[70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[72] L34-1-->L35: 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[]" "[74] L35-->L36: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 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] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[76] $Ultimate##0-->L46-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" "[75] L36-->L34-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]" "[71] L34-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[]" "[78] L46-1-->L47: Formula: (< v_thread2Thread1of1ForFork1_i_5 v_N_4) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} AuxVars[] AssignedVars[]" "[80] L47-->L48: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ 2 (select v_A_4 v_thread2Thread1of1ForFork1_i_7))) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[96] L19-->$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_i=v_thread3Thread1of1ForFork2_i_14, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_i, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[82] $Ultimate##0-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i]" "[81] L48-->L46-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" "[77] L46-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork1_i_3) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_3, N=v_N_3} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_3, N=v_N_3} AuxVars[] AssignedVars[]" [2025-04-26 18:39:12,988 INFO L754 eck$LassoCheckResult]: Loop: "[84] L58-1-->L59: Formula: (< v_thread3Thread1of1ForFork2_i_5 v_N_5) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} AuxVars[] AssignedVars[]" "[86] L59-->L60: Formula: (= v_B_1 (store v_B_2 v_thread3Thread1of1ForFork2_i_7 (+ 3 (select v_B_2 v_thread3Thread1of1ForFork2_i_7)))) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_2} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_1} AuxVars[] AssignedVars[B]" "[87] L60-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_10 (+ v_thread3Thread1of1ForFork2_i_9 1)) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_9} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i]" [2025-04-26 18:39:12,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:12,988 INFO L85 PathProgramCache]: Analyzing trace with hash 909503218, now seen corresponding path program 1 times [2025-04-26 18:39:12,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:12,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628087233] [2025-04-26 18:39:12,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:12,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:12,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:39:12,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:39:12,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:12,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:39:12,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:39:12,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:12,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:12,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:12,999 INFO L85 PathProgramCache]: Analyzing trace with hash 113268, now seen corresponding path program 2 times [2025-04-26 18:39:12,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:12,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785895957] [2025-04-26 18:39:12,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:12,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:13,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:13,002 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:13,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:13,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:13,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:13,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:13,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:13,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:13,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1938219549, now seen corresponding path program 1 times [2025-04-26 18:39:13,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:13,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288524768] [2025-04-26 18:39:13,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:13,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:13,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:39:13,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:39:13,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:13,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:39:13,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:39:13,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:13,182 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:13,182 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:13,182 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:13,182 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:13,182 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:13,182 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:13,182 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:13,183 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:13,183 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:39:13,183 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:13,183 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:13,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,343 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:13,343 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:13,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:13,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:13,345 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:13,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:39:13,349 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:13,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:13,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:13,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:13,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:13,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:13,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:13,364 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:13,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:39:13,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:13,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:13,372 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:13,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:39:13,374 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:13,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:13,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:13,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:13,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:13,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:13,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:13,387 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:13,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:39:13,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:13,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:13,395 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:13,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:39:13,398 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:13,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:13,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:13,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:13,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:13,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:13,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:13,412 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:13,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:13,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:13,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:13,420 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:13,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:39:13,422 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:13,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:13,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:13,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:13,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:13,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:13,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:13,442 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:13,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:13,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:13,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:13,451 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:13,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:39:13,453 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:13,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:13,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:13,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:13,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:13,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:13,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:13,473 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:13,480 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:39:13,481 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:39:13,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:13,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:13,482 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:13,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:39:13,485 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:13,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:13,501 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:13,501 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:13,501 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_i, N) = -1*thread3Thread1of1ForFork2_i + 1*N Supporting invariants [] [2025-04-26 18:39:13,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:39:13,508 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:13,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:13,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:39:13,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:39:13,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:13,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:13,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:13,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:13,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:13,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:13,556 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:13,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:13,574 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:13,575 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:13,575 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 245 states and 442 transitions. cyclomatic complexity: 218 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:13,607 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 245 states and 442 transitions. cyclomatic complexity: 218. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 445 states and 774 transitions. Complement of second has 7 states. [2025-04-26 18:39:13,607 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:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2025-04-26 18:39:13,608 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 16 letters. Loop has 3 letters. [2025-04-26 18:39:13,608 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:13,608 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 19 letters. Loop has 3 letters. [2025-04-26 18:39:13,608 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:13,608 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 16 letters. Loop has 6 letters. [2025-04-26 18:39:13,608 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:13,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 445 states and 774 transitions. [2025-04-26 18:39:13,611 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:39:13,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 445 states to 110 states and 167 transitions. [2025-04-26 18:39:13,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-04-26 18:39:13,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2025-04-26 18:39:13,612 INFO L74 IsDeterministic]: Start isDeterministic. Operand 110 states and 167 transitions. [2025-04-26 18:39:13,612 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:13,612 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 167 transitions. [2025-04-26 18:39:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 167 transitions. [2025-04-26 18:39:13,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2025-04-26 18:39:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 105 states have (on average 1.542857142857143) internal successors, (in total 162), 104 states have internal predecessors, (162), 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:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 162 transitions. [2025-04-26 18:39:13,614 INFO L240 hiAutomatonCegarLoop]: Abstraction has 105 states and 162 transitions. [2025-04-26 18:39:13,614 INFO L438 stractBuchiCegarLoop]: Abstraction has 105 states and 162 transitions. [2025-04-26 18:39:13,614 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:39:13,614 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 162 transitions. [2025-04-26 18:39:13,614 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:39:13,614 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:13,614 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:13,615 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:13,615 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:13,615 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[]" "[41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B]" "[90] L18-->$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]" "[70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[72] L34-1-->L35: 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[]" "[74] L35-->L36: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 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]" "[75] L36-->L34-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]" "[71] L34-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[]" "[73] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[93] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[76] $Ultimate##0-->L46-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" "[78] L46-1-->L47: Formula: (< v_thread2Thread1of1ForFork1_i_5 v_N_4) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} AuxVars[] AssignedVars[]" "[80] L47-->L48: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ 2 (select v_A_4 v_thread2Thread1of1ForFork1_i_7))) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[81] L48-->L46-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" "[77] L46-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork1_i_3) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_3, N=v_N_3} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_3, N=v_N_3} AuxVars[] AssignedVars[]" "[79] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[96] L19-->$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_i=v_thread3Thread1of1ForFork2_i_14, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_i, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[82] $Ultimate##0-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i]" [2025-04-26 18:39:13,615 INFO L754 eck$LassoCheckResult]: Loop: "[84] L58-1-->L59: Formula: (< v_thread3Thread1of1ForFork2_i_5 v_N_5) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} AuxVars[] AssignedVars[]" "[86] L59-->L60: Formula: (= v_B_1 (store v_B_2 v_thread3Thread1of1ForFork2_i_7 (+ 3 (select v_B_2 v_thread3Thread1of1ForFork2_i_7)))) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_2} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_1} AuxVars[] AssignedVars[B]" "[87] L60-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_10 (+ v_thread3Thread1of1ForFork2_i_9 1)) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_9} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i]" [2025-04-26 18:39:13,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:13,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1915465698, now seen corresponding path program 1 times [2025-04-26 18:39:13,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:13,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340088648] [2025-04-26 18:39:13,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:13,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:13,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:13,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:13,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,623 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:13,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:13,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:13,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:13,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:13,629 INFO L85 PathProgramCache]: Analyzing trace with hash 113268, now seen corresponding path program 3 times [2025-04-26 18:39:13,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:13,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473526446] [2025-04-26 18:39:13,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:13,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:13,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:13,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:13,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:39:13,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,631 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:13,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:13,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:13,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:13,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:13,633 INFO L85 PathProgramCache]: Analyzing trace with hash -703030985, now seen corresponding path program 1 times [2025-04-26 18:39:13,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:13,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903903947] [2025-04-26 18:39:13,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:13,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:13,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:39:13,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:39:13,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,642 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:13,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:39:13,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:39:13,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:13,768 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:13,768 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:13,768 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:13,768 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:13,768 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:13,768 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:13,768 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:13,768 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:13,768 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_petrified1_Iteration7_Lasso [2025-04-26 18:39:13,768 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:13,768 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:13,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:13,919 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:13,920 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:13,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:13,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:13,921 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:13,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:39:13,923 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:13,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:13,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:13,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:13,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:13,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:13,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:13,937 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:13,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:39:13,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:13,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:13,944 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:13,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:39:13,947 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:13,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:13,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:13,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:13,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:13,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:13,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:13,960 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:13,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:13,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:13,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:13,967 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:13,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:39:13,969 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:13,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:13,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:13,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:13,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:13,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:13,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:13,983 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:13,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:13,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:13,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:13,992 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:13,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:39:13,993 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:14,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:14,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:14,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:14,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:14,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:14,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:14,007 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:14,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:14,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,015 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:14,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:39:14,018 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:14,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:14,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:14,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:14,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:14,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:14,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:14,032 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:14,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:39:14,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,040 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:14,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:39:14,043 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:14,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:14,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:14,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:14,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:14,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:14,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:14,055 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:14,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:14,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,064 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:14,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:39:14,066 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:14,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:14,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:14,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:14,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:14,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:14,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:14,079 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:14,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:14,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,087 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:14,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 18:39:14,097 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:14,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:14,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:14,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:14,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:14,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:14,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:14,111 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:14,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 18:39:14,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,118 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:14,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 18:39:14,121 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:14,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:14,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:14,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:14,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:14,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:14,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:14,136 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:14,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 18:39:14,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,143 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:14,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 18:39:14,145 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:14,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:14,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:14,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:14,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:14,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:14,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:14,161 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:14,168 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:39:14,168 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:39:14,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,170 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:14,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 18:39:14,171 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:14,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:14,187 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:14,187 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:14,187 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_i, N) = -1*thread3Thread1of1ForFork2_i + 1*N Supporting invariants [] [2025-04-26 18:39:14,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 18:39:14,193 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:14,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:14,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:14,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:14,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:14,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:14,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:14,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:14,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:14,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:14,226 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:14,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:14,242 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:14,243 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:14,243 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 105 states and 162 transitions. cyclomatic complexity: 73 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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:14,272 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 105 states and 162 transitions. cyclomatic complexity: 73. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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 156 states and 245 transitions. Complement of second has 6 states. [2025-04-26 18:39:14,272 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:14,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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:14,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2025-04-26 18:39:14,273 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 18 letters. Loop has 3 letters. [2025-04-26 18:39:14,273 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:14,273 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 21 letters. Loop has 3 letters. [2025-04-26 18:39:14,273 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:14,273 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 18 letters. Loop has 6 letters. [2025-04-26 18:39:14,273 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:14,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 245 transitions. [2025-04-26 18:39:14,274 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:14,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 0 states and 0 transitions. [2025-04-26 18:39:14,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:39:14,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:39:14,274 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:39:14,274 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:14,274 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:14,274 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:14,274 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:14,274 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:39:14,275 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:39:14,275 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:14,275 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:39:14,287 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:14,288 INFO L201 PluginConnector]: Adding new model map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:14 BoogieIcfgContainer [2025-04-26 18:39:14,288 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:14,289 INFO L158 Benchmark]: Toolchain (without parser) took 4058.73ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 86.7MB in the beginning and 91.8MB in the end (delta: -5.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:14,290 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory was 87.9MB in the beginning and 87.7MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:14,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.98ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 84.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:14,290 INFO L158 Benchmark]: Boogie Preprocessor took 21.20ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:14,291 INFO L158 Benchmark]: RCFGBuilder took 171.54ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 74.6MB in the end (delta: 9.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:39:14,291 INFO L158 Benchmark]: BuchiAutomizer took 3824.69ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 74.6MB in the beginning and 91.8MB in the end (delta: -17.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:14,293 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.17ms. Allocated memory is still 159.4MB. Free memory was 87.9MB in the beginning and 87.7MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.98ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 84.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.20ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 171.54ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 74.6MB in the end (delta: 9.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3824.69ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 74.6MB in the beginning and 91.8MB in the end (delta: -17.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 164 StatesRemovedByMinimization, 5 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 [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 284 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 279 mSDsluCounter, 268 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 156 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital61 mio100 ax100 hnf100 lsp77 ukn79 mio100 lsp70 div100 bol100 ite100 ukn100 eq142 hnf92 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 94ms 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]: 222, Number of transitions in reduction automaton: 354, Number of states in reduction automaton: 203, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (2 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:39:14,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...