/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/motivating-slowitp.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:27,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:27,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:27,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:27,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:27,990 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:27,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:28,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:28,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:28,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:28,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:28,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:28,010 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:28,010 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:28,010 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:28,010 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:28,010 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:28,010 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:28,010 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:28,010 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:28,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:28,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:28,010 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:28,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:28,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:28,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:28,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:28,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:28,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:28,011 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:28,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:28,011 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:28,011 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:28,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:28,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:28,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:28,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:28,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:28,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:28,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:28,012 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:28,012 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:28,012 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:28,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:28,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:28,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:28,252 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:28,254 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:28,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/motivating-slowitp.bpl [2025-04-26 18:39:28,256 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/motivating-slowitp.bpl' [2025-04-26 18:39:28,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:28,272 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:28,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:28,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:28,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:28,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:28" (1/1) ... [2025-04-26 18:39:28,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:28" (1/1) ... [2025-04-26 18:39:28,305 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:28,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:28,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:28,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:28,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:28,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:28" (1/1) ... [2025-04-26 18:39:28,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:28" (1/1) ... [2025-04-26 18:39:28,315 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:28" (1/1) ... [2025-04-26 18:39:28,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:28" (1/1) ... [2025-04-26 18:39:28,317 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:28" (1/1) ... [2025-04-26 18:39:28,318 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:28" (1/1) ... [2025-04-26 18:39:28,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:28" (1/1) ... [2025-04-26 18:39:28,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:28" (1/1) ... [2025-04-26 18:39:28,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:28" (1/1) ... [2025-04-26 18:39:28,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:28,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:28,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:28,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:28,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:28" (1/1) ... [2025-04-26 18:39:28,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:28,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:28,361 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:28,367 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:28,382 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:39:28,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:39:28,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:39:28,383 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:39:28,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:39:28,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:39:28,383 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:39:28,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:39:28,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:39:28,383 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:28,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:28,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:28,384 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:28,424 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:28,426 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:28,528 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:28,529 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:28,568 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:28,569 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:39:28,569 INFO L201 PluginConnector]: Adding new model motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:28 BoogieIcfgContainer [2025-04-26 18:39:28,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:28,570 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:28,570 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:28,573 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:28,574 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:28,575 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:28" (1/2) ... [2025-04-26 18:39:28,575 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59d994c6 and model type motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:28, skipping insertion in model container [2025-04-26 18:39:28,576 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:28,576 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:28" (2/2) ... [2025-04-26 18:39:28,576 INFO L376 chiAutomizerObserver]: Analyzing ICFG motivating-slowitp.bpl [2025-04-26 18:39:28,633 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:39:28,671 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:28,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:28,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:28,673 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:28,674 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:28,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 18:39:28,738 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-26 18:39:28,743 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:39:28,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-04-26 18:39:28,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 18:39:28,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2025-04-26 18:39:28,752 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 33 places, 26 transitions, 70 flow [2025-04-26 18:39:28,753 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 26 transitions, 70 flow [2025-04-26 18:39:28,778 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 226 states, 224 states have (on average 2.9285714285714284) internal successors, (in total 656), 225 states have internal predecessors, (656), 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:28,779 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 226 states, 224 states have (on average 2.9285714285714284) internal successors, (in total 656), 225 states have internal predecessors, (656), 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:28,782 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:28,892 WARN L140 AmpleReduction]: Number of pruned transitions: 130 [2025-04-26 18:39:28,893 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:28,893 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 40 [2025-04-26 18:39:28,893 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:20 [2025-04-26 18:39:28,893 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:74 [2025-04-26 18:39:28,893 WARN L145 AmpleReduction]: Times succ was already a loop node:67 [2025-04-26 18:39:28,893 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:10 [2025-04-26 18:39:28,893 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:28,894 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 135 states, 133 states have (on average 1.9248120300751879) internal successors, (in total 256), 134 states have internal predecessors, (256), 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:28,899 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:28,900 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:28,900 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:28,900 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:28,900 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:28,900 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:28,900 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:28,900 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:28,902 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 135 states, 133 states have (on average 1.9248120300751879) internal successors, (in total 256), 134 states have internal predecessors, (256), 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:28,912 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 91 [2025-04-26 18:39:28,913 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:28,913 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:28,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:28,918 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:28,918 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:28,918 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 135 states, 133 states have (on average 1.9248120300751879) internal successors, (in total 256), 134 states have internal predecessors, (256), 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:28,923 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 91 [2025-04-26 18:39:28,923 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:28,923 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:28,923 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:28,923 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:28,928 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[111] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_12, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[90] $Ultimate##0-->L36-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" [2025-04-26 18:39:28,928 INFO L754 eck$LassoCheckResult]: Loop: "[92] L36-1-->L36: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[94] L36-->L36-1: Formula: (and (= (store v_A_8 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_8 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_7) (= (+ v_thread1Thread1of1ForFork1_i_7 1) v_thread1Thread1of1ForFork1_i_8)) InVars {A=v_A_8, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_7, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_8} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork1_i]" [2025-04-26 18:39:28,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:28,932 INFO L85 PathProgramCache]: Analyzing trace with hash 116929, now seen corresponding path program 1 times [2025-04-26 18:39:28,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:28,936 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77611003] [2025-04-26 18:39:28,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:28,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:28,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:28,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:28,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:28,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:28,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:28,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:28,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:28,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:28,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:28,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:28,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:28,996 INFO L85 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 1 times [2025-04-26 18:39:28,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:28,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516706426] [2025-04-26 18:39:28,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:28,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:28,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:29,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:29,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,005 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:29,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:29,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:29,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:29,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:29,011 INFO L85 PathProgramCache]: Analyzing trace with hash 112371715, now seen corresponding path program 1 times [2025-04-26 18:39:29,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:29,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213659524] [2025-04-26 18:39:29,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:29,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:29,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:29,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:29,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,017 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:29,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:29,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:29,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:29,150 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:29,151 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:29,151 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:29,151 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:29,151 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:29,151 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:29,151 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:29,151 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:29,152 INFO L132 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:29,152 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:29,152 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:29,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:29,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:29,320 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:29,323 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:29,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:29,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:29,327 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:29,327 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:29,328 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:29,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:29,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:29,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:29,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:29,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:29,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:29,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:29,345 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:29,351 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:29,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:29,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:29,353 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:29,354 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:29,356 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:29,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:29,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:29,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:29,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:29,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:29,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:29,379 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:29,392 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:39:29,393 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:39:29,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:29,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:29,397 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:29,398 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:29,400 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:29,417 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:29,418 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:29,418 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:29,418 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_i, N) = -1*thread1Thread1of1ForFork1_i + 1*N Supporting invariants [] [2025-04-26 18:39:29,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:29,429 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:29,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:29,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:29,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:29,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:29,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:29,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:29,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:29,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:29,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:29,476 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:29,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:29,492 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:29,507 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:29,508 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 135 states, 133 states have (on average 1.9248120300751879) internal successors, (in total 256), 134 states have internal predecessors, (256), 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 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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:29,594 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 135 states, 133 states have (on average 1.9248120300751879) internal successors, (in total 256), 134 states have internal predecessors, (256), 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 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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 315 states and 604 transitions. Complement of second has 6 states. [2025-04-26 18:39:29,594 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:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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:29,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2025-04-26 18:39:29,600 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:39:29,601 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:29,601 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:39:29,601 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:29,601 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 18:39:29,601 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:29,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 604 transitions. [2025-04-26 18:39:29,609 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 39 [2025-04-26 18:39:29,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 154 states and 288 transitions. [2025-04-26 18:39:29,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2025-04-26 18:39:29,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2025-04-26 18:39:29,619 INFO L74 IsDeterministic]: Start isDeterministic. Operand 154 states and 288 transitions. [2025-04-26 18:39:29,619 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:29,620 INFO L218 hiAutomatonCegarLoop]: Abstraction has 154 states and 288 transitions. [2025-04-26 18:39:29,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 288 transitions. [2025-04-26 18:39:29,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 133. [2025-04-26 18:39:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 133 states have (on average 1.9022556390977443) internal successors, (in total 253), 132 states have internal predecessors, (253), 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:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 253 transitions. [2025-04-26 18:39:29,649 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 253 transitions. [2025-04-26 18:39:29,649 INFO L438 stractBuchiCegarLoop]: Abstraction has 133 states and 253 transitions. [2025-04-26 18:39:29,649 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:29,649 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 253 transitions. [2025-04-26 18:39:29,651 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 39 [2025-04-26 18:39:29,651 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:29,651 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:29,651 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:29,651 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:29,651 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[111] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_12, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[90] $Ultimate##0-->L36-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[91] L36-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[93] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[114] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[95] $Ultimate##0-->L50: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[96] L50-->L52-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" [2025-04-26 18:39:29,652 INFO L754 eck$LassoCheckResult]: Loop: "[98] L52-1-->L52: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[100] L52-->L52-1: Formula: (and (let ((.cse0 (select v_A_15 v_thread2Thread1of1ForFork2_j_7))) (or (and (= v_thread2_cnt_30 (+ v_thread2Thread1of1ForFork2_cnt_3 1)) (< 0 .cse0)) (and (<= .cse0 0) (= v_thread2_cnt_30 v_thread2Thread1of1ForFork2_cnt_3)))) (let ((.cse1 (select v_B_13 v_thread2Thread1of1ForFork2_j_7))) (or (and (<= .cse1 0) (= v_thread2_cnt_30 v_thread2Thread1of1ForFork2_cnt_4)) (and (< 0 .cse1) (= v_thread2Thread1of1ForFork2_cnt_4 (+ v_thread2_cnt_30 1))))) (= (+ v_thread2Thread1of1ForFork2_j_7 1) v_thread2Thread1of1ForFork2_j_8)) InVars {A=v_A_15, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_7, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_3, B=v_B_13} OutVars{A=v_A_15, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_8, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_4, B=v_B_13} AuxVars[v_thread2_cnt_30] AssignedVars[thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_cnt]" [2025-04-26 18:39:29,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:29,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1885397264, now seen corresponding path program 1 times [2025-04-26 18:39:29,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:29,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515008266] [2025-04-26 18:39:29,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:29,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:29,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:29,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:29,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:29,695 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:29,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:29,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515008266] [2025-04-26 18:39:29,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515008266] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:29,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:29,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:39:29,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508060788] [2025-04-26 18:39:29,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:29,698 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:29,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:29,699 INFO L85 PathProgramCache]: Analyzing trace with hash 4099, now seen corresponding path program 1 times [2025-04-26 18:39:29,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:29,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104659616] [2025-04-26 18:39:29,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:29,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:29,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:29,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:29,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,704 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:29,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:29,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:29,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:29,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:29,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:29,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:29,828 INFO L87 Difference]: Start difference. First operand 133 states and 253 transitions. cyclomatic complexity: 151 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:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:29,880 INFO L93 Difference]: Finished difference Result 133 states and 252 transitions. [2025-04-26 18:39:29,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 252 transitions. [2025-04-26 18:39:29,882 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 39 [2025-04-26 18:39:29,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 133 states and 252 transitions. [2025-04-26 18:39:29,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2025-04-26 18:39:29,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2025-04-26 18:39:29,883 INFO L74 IsDeterministic]: Start isDeterministic. Operand 133 states and 252 transitions. [2025-04-26 18:39:29,883 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:29,883 INFO L218 hiAutomatonCegarLoop]: Abstraction has 133 states and 252 transitions. [2025-04-26 18:39:29,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 252 transitions. [2025-04-26 18:39:29,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-04-26 18:39:29,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 133 states have (on average 1.894736842105263) internal successors, (in total 252), 132 states have internal predecessors, (252), 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:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 252 transitions. [2025-04-26 18:39:29,893 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 252 transitions. [2025-04-26 18:39:29,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:39:29,894 INFO L438 stractBuchiCegarLoop]: Abstraction has 133 states and 252 transitions. [2025-04-26 18:39:29,894 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:29,894 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 252 transitions. [2025-04-26 18:39:29,895 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 39 [2025-04-26 18:39:29,895 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:29,895 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:29,896 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:29,896 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:29,897 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[111] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_12, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[90] $Ultimate##0-->L36-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[92] L36-1-->L36: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[114] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[95] $Ultimate##0-->L50: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[94] L36-->L36-1: Formula: (and (= (store v_A_8 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_8 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_7) (= (+ v_thread1Thread1of1ForFork1_i_7 1) v_thread1Thread1of1ForFork1_i_8)) InVars {A=v_A_8, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_7, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_8} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork1_i]" "[96] L50-->L52-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[91] L36-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 18:39:29,897 INFO L754 eck$LassoCheckResult]: Loop: "[98] L52-1-->L52: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[100] L52-->L52-1: Formula: (and (let ((.cse0 (select v_A_15 v_thread2Thread1of1ForFork2_j_7))) (or (and (= v_thread2_cnt_30 (+ v_thread2Thread1of1ForFork2_cnt_3 1)) (< 0 .cse0)) (and (<= .cse0 0) (= v_thread2_cnt_30 v_thread2Thread1of1ForFork2_cnt_3)))) (let ((.cse1 (select v_B_13 v_thread2Thread1of1ForFork2_j_7))) (or (and (<= .cse1 0) (= v_thread2_cnt_30 v_thread2Thread1of1ForFork2_cnt_4)) (and (< 0 .cse1) (= v_thread2Thread1of1ForFork2_cnt_4 (+ v_thread2_cnt_30 1))))) (= (+ v_thread2Thread1of1ForFork2_j_7 1) v_thread2Thread1of1ForFork2_j_8)) InVars {A=v_A_15, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_7, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_3, B=v_B_13} OutVars{A=v_A_15, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_8, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_4, B=v_B_13} AuxVars[v_thread2_cnt_30] AssignedVars[thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_cnt]" [2025-04-26 18:39:29,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:29,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1634770767, now seen corresponding path program 1 times [2025-04-26 18:39:29,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:29,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486777901] [2025-04-26 18:39:29,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:29,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:29,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:29,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:29,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,907 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:29,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:29,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:29,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:29,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:29,916 INFO L85 PathProgramCache]: Analyzing trace with hash 4099, now seen corresponding path program 2 times [2025-04-26 18:39:29,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:29,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942954665] [2025-04-26 18:39:29,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:29,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:29,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:29,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:29,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:29,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,922 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:29,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:29,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:29,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:29,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:29,935 INFO L85 PathProgramCache]: Analyzing trace with hash 943326387, now seen corresponding path program 1 times [2025-04-26 18:39:29,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:29,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518754062] [2025-04-26 18:39:29,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:29,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:29,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:29,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:29,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,956 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:29,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:29,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:29,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:30,147 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:30,148 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:30,148 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:30,148 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:30,148 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:30,148 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:30,148 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:30,148 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:30,148 INFO L132 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:39:30,148 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:30,148 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:30,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:30,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:30,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:30,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:30,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:30,580 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:30,580 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:30,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:30,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:30,582 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:30,584 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:30,585 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:30,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:30,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:30,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:30,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:30,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:30,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:30,604 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:30,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:30,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:30,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:30,612 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:30,613 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:30,614 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:30,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:30,624 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:39:30,624 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 18:39:30,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:30,666 INFO L402 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2025-04-26 18:39:30,666 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 18:39:30,703 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:30,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:39:30,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:30,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:30,712 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:30,713 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:30,714 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:30,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:30,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:30,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:30,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:30,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:30,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:30,732 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:30,745 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:39:30,745 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:39:30,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:30,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:30,748 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:30,749 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:30,750 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:30,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:39:30,768 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:30,768 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:30,768 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork2_j, N) = -1*thread2Thread1of1ForFork2_j + 1*N Supporting invariants [] [2025-04-26 18:39:30,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:30,774 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:30,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:30,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:30,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:30,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:30,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:30,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:30,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:30,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:30,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:30,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:30,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:30,804 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:30,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:30,815 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:30,815 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:30,815 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 252 transitions. cyclomatic complexity: 150 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:30,859 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 252 transitions. cyclomatic complexity: 150. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 315 states and 602 transitions. Complement of second has 7 states. [2025-04-26 18:39:30,860 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:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2025-04-26 18:39:30,861 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:39:30,861 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:30,861 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:39:30,861 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:30,861 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:39:30,861 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:30,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 602 transitions. [2025-04-26 18:39:30,864 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 65 [2025-04-26 18:39:30,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 228 states and 413 transitions. [2025-04-26 18:39:30,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2025-04-26 18:39:30,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2025-04-26 18:39:30,866 INFO L74 IsDeterministic]: Start isDeterministic. Operand 228 states and 413 transitions. [2025-04-26 18:39:30,866 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:30,866 INFO L218 hiAutomatonCegarLoop]: Abstraction has 228 states and 413 transitions. [2025-04-26 18:39:30,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states and 413 transitions. [2025-04-26 18:39:30,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 180. [2025-04-26 18:39:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 180 states have (on average 1.8611111111111112) internal successors, (in total 335), 179 states have internal predecessors, (335), 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:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 335 transitions. [2025-04-26 18:39:30,873 INFO L240 hiAutomatonCegarLoop]: Abstraction has 180 states and 335 transitions. [2025-04-26 18:39:30,873 INFO L438 stractBuchiCegarLoop]: Abstraction has 180 states and 335 transitions. [2025-04-26 18:39:30,873 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:39:30,873 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states and 335 transitions. [2025-04-26 18:39:30,875 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 51 [2025-04-26 18:39:30,875 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:30,875 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:30,875 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:30,875 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:30,875 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[111] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_12, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[90] $Ultimate##0-->L36-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[92] L36-1-->L36: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[114] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[95] $Ultimate##0-->L50: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[94] L36-->L36-1: Formula: (and (= (store v_A_8 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_8 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_7) (= (+ v_thread1Thread1of1ForFork1_i_7 1) v_thread1Thread1of1ForFork1_i_8)) InVars {A=v_A_8, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_7, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_8} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork1_i]" "[91] L36-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[96] L50-->L52-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" [2025-04-26 18:39:30,875 INFO L754 eck$LassoCheckResult]: Loop: "[98] L52-1-->L52: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[100] L52-->L52-1: Formula: (and (let ((.cse0 (select v_A_15 v_thread2Thread1of1ForFork2_j_7))) (or (and (= v_thread2_cnt_30 (+ v_thread2Thread1of1ForFork2_cnt_3 1)) (< 0 .cse0)) (and (<= .cse0 0) (= v_thread2_cnt_30 v_thread2Thread1of1ForFork2_cnt_3)))) (let ((.cse1 (select v_B_13 v_thread2Thread1of1ForFork2_j_7))) (or (and (<= .cse1 0) (= v_thread2_cnt_30 v_thread2Thread1of1ForFork2_cnt_4)) (and (< 0 .cse1) (= v_thread2Thread1of1ForFork2_cnt_4 (+ v_thread2_cnt_30 1))))) (= (+ v_thread2Thread1of1ForFork2_j_7 1) v_thread2Thread1of1ForFork2_j_8)) InVars {A=v_A_15, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_7, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_3, B=v_B_13} OutVars{A=v_A_15, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_8, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_4, B=v_B_13} AuxVars[v_thread2_cnt_30] AssignedVars[thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_cnt]" [2025-04-26 18:39:30,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:30,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1634770917, now seen corresponding path program 2 times [2025-04-26 18:39:30,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:30,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475802029] [2025-04-26 18:39:30,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:30,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:30,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:30,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:30,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:30,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:30,881 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:30,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:30,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:30,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:30,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:30,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:30,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:30,886 INFO L85 PathProgramCache]: Analyzing trace with hash 4099, now seen corresponding path program 3 times [2025-04-26 18:39:30,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:30,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81533652] [2025-04-26 18:39:30,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:30,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:30,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:30,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:30,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:39:30,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:30,892 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:30,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:30,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:30,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:30,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:30,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:30,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:30,896 INFO L85 PathProgramCache]: Analyzing trace with hash 943182237, now seen corresponding path program 2 times [2025-04-26 18:39:30,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:30,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491384993] [2025-04-26 18:39:30,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:30,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:30,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:30,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:30,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:30,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:30,903 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:30,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:30,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:30,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:30,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:30,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:31,062 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:31,062 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:31,062 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:31,062 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:31,062 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:31,062 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:31,062 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:31,062 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:31,062 INFO L132 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:39:31,062 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:31,062 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:31,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:31,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:31,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:31,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:31,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:31,448 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:31,449 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:31,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:31,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:31,450 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:31,454 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:31,455 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:31,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:31,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:31,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:31,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:31,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:31,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:31,470 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:31,475 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:31,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:31,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:31,477 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:31,478 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:31,480 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:31,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:31,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:31,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:31,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:31,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:31,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:31,493 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:31,499 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:31,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:31,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:31,502 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:31,503 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:31,505 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:31,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:31,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:31,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:31,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:31,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:31,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:31,521 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:31,531 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:39:31,531 INFO L437 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 18:39:31,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:31,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:31,556 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:31,557 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:31,558 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:31,572 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:31,573 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:31,573 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:31,573 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork2_j, N) = -1*thread2Thread1of1ForFork2_j + 1*N Supporting invariants [] [2025-04-26 18:39:31,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:31,581 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:31,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:31,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:31,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:31,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:31,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:31,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:31,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:31,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:31,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:31,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:31,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:31,611 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:31,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:31,623 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:31,624 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:31,624 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 180 states and 335 transitions. cyclomatic complexity: 198 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:31,693 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 180 states and 335 transitions. cyclomatic complexity: 198. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 357 states and 686 transitions. Complement of second has 6 states. [2025-04-26 18:39:31,694 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:31,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2025-04-26 18:39:31,694 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:39:31,694 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:31,694 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:39:31,695 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:31,695 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:39:31,695 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:31,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 357 states and 686 transitions. [2025-04-26 18:39:31,698 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 32 [2025-04-26 18:39:31,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 357 states to 232 states and 423 transitions. [2025-04-26 18:39:31,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2025-04-26 18:39:31,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2025-04-26 18:39:31,703 INFO L74 IsDeterministic]: Start isDeterministic. Operand 232 states and 423 transitions. [2025-04-26 18:39:31,703 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:31,703 INFO L218 hiAutomatonCegarLoop]: Abstraction has 232 states and 423 transitions. [2025-04-26 18:39:31,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states and 423 transitions. [2025-04-26 18:39:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 173. [2025-04-26 18:39:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 173 states have (on average 1.8901734104046244) internal successors, (in total 327), 172 states have internal predecessors, (327), 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:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 327 transitions. [2025-04-26 18:39:31,711 INFO L240 hiAutomatonCegarLoop]: Abstraction has 173 states and 327 transitions. [2025-04-26 18:39:31,711 INFO L438 stractBuchiCegarLoop]: Abstraction has 173 states and 327 transitions. [2025-04-26 18:39:31,711 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:39:31,711 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 327 transitions. [2025-04-26 18:39:31,712 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 18:39:31,712 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:31,712 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:31,713 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:31,713 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:31,713 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[111] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_12, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[90] $Ultimate##0-->L36-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[92] L36-1-->L36: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[114] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[95] $Ultimate##0-->L50: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[94] L36-->L36-1: Formula: (and (= (store v_A_8 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_8 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_7) (= (+ v_thread1Thread1of1ForFork1_i_7 1) v_thread1Thread1of1ForFork1_i_8)) InVars {A=v_A_8, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_7, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_8} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork1_i]" "[96] L50-->L52-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[91] L36-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[98] L52-1-->L52: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[108] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_12, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[101] $Ultimate##0-->L72-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 18:39:31,713 INFO L754 eck$LassoCheckResult]: Loop: "[103] L72-1-->L72: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[105] L72-->L72-1: Formula: (and (= v_thread3Thread1of1ForFork0_k_8 (+ v_thread3Thread1of1ForFork0_k_7 1)) (= (store v_B_8 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_7)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_8} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_8, B=v_B_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, B]" [2025-04-26 18:39:31,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:31,714 INFO L85 PathProgramCache]: Analyzing trace with hash -821652726, now seen corresponding path program 1 times [2025-04-26 18:39:31,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:31,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470897198] [2025-04-26 18:39:31,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:31,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:31,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:39:31,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:39:31,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:31,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:31,720 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:31,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:39:31,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:39:31,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:31,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:31,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:31,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash 4259, now seen corresponding path program 1 times [2025-04-26 18:39:31,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:31,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790900794] [2025-04-26 18:39:31,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:31,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:31,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:31,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:31,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:31,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:31,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:31,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:31,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:31,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:31,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:31,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:31,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:31,732 INFO L85 PathProgramCache]: Analyzing trace with hash 665716076, now seen corresponding path program 1 times [2025-04-26 18:39:31,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:31,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389459037] [2025-04-26 18:39:31,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:31,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:31,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:39:31,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:39:31,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:31,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:31,738 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:31,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:39:31,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:39:31,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:31,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:31,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:31,862 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:31,862 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:31,863 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:31,863 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:31,863 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:31,863 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:31,863 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:31,863 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:31,863 INFO L132 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:39:31,863 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:31,863 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:31,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:31,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:31,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:31,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:31,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:31,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:31,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:31,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:31,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:31,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:31,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,008 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:32,008 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:32,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,011 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:32,012 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:32,013 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:32,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,028 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,034 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:32,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,036 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:32,038 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:32,038 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:32,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,050 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,055 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:32,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,057 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:32,058 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:32,059 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:32,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,072 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:39:32,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,079 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:32,081 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:32,082 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:32,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,095 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:39:32,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,103 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:32,103 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:32,105 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:32,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,118 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:32,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,125 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:32,127 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:32,128 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:32,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,141 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,146 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:32,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,149 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:32,150 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:32,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:32,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,163 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,168 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:32,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,170 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:32,171 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:32,172 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:32,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,185 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,192 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:32,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,194 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:32,195 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:32,196 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:32,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,209 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,215 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:32,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,217 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:32,218 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:32,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:32,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:32,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:32,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:32,231 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 18:39:32,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,240 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:32,240 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:32,241 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:32,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,258 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:32,270 INFO L436 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-04-26 18:39:32,270 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:39:32,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,272 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:32,273 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:32,274 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:32,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 18:39:32,289 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:39:32,289 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:32,290 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork0_k) = -2*thread3Thread1of1ForFork0_k + 1 Supporting invariants [-1*N + 1 >= 0] [2025-04-26 18:39:32,295 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:32,297 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:39:32,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:32,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:39:32,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:39:32,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:32,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:32,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:39:32,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:32,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:32,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:32,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:32,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:32,392 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:39:32,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:32,402 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:32,403 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-04-26 18:39:32,403 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 173 states and 327 transitions. cyclomatic complexity: 188 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (in total 14), 6 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:32,507 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 173 states and 327 transitions. cyclomatic complexity: 188. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (in total 14), 6 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 316 states and 550 transitions. Complement of second has 11 states. [2025-04-26 18:39:32,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2025-04-26 18:39:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (in total 14), 6 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:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2025-04-26 18:39:32,508 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 55 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:39:32,508 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:32,508 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 55 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:39:32,508 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:32,508 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 55 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 18:39:32,509 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:32,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 550 transitions. [2025-04-26 18:39:32,510 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 18:39:32,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 216 states and 386 transitions. [2025-04-26 18:39:32,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2025-04-26 18:39:32,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2025-04-26 18:39:32,514 INFO L74 IsDeterministic]: Start isDeterministic. Operand 216 states and 386 transitions. [2025-04-26 18:39:32,514 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:32,514 INFO L218 hiAutomatonCegarLoop]: Abstraction has 216 states and 386 transitions. [2025-04-26 18:39:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states and 386 transitions. [2025-04-26 18:39:32,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 178. [2025-04-26 18:39:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 178 states have (on average 1.8876404494382022) internal successors, (in total 336), 177 states have internal predecessors, (336), 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:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 336 transitions. [2025-04-26 18:39:32,521 INFO L240 hiAutomatonCegarLoop]: Abstraction has 178 states and 336 transitions. [2025-04-26 18:39:32,521 INFO L438 stractBuchiCegarLoop]: Abstraction has 178 states and 336 transitions. [2025-04-26 18:39:32,521 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:39:32,522 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 336 transitions. [2025-04-26 18:39:32,522 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 18:39:32,522 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:32,522 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:32,523 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:32,523 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:32,523 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[111] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_12, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[90] $Ultimate##0-->L36-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[92] L36-1-->L36: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[114] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[95] $Ultimate##0-->L50: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[94] L36-->L36-1: Formula: (and (= (store v_A_8 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_8 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_7) (= (+ v_thread1Thread1of1ForFork1_i_7 1) v_thread1Thread1of1ForFork1_i_8)) InVars {A=v_A_8, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_7, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_8} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork1_i]" "[108] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_12, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[101] $Ultimate##0-->L72-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[91] L36-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[96] L50-->L52-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[97] L52-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork2_j_3) InVars {N=v_N_3, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_3} OutVars{N=v_N_3, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_3} AuxVars[] AssignedVars[]" [2025-04-26 18:39:32,523 INFO L754 eck$LassoCheckResult]: Loop: "[103] L72-1-->L72: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[105] L72-->L72-1: Formula: (and (= v_thread3Thread1of1ForFork0_k_8 (+ v_thread3Thread1of1ForFork0_k_7 1)) (= (store v_B_8 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_7)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_8} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_8, B=v_B_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, B]" [2025-04-26 18:39:32,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:32,524 INFO L85 PathProgramCache]: Analyzing trace with hash -810279667, now seen corresponding path program 1 times [2025-04-26 18:39:32,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:32,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495070065] [2025-04-26 18:39:32,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:32,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:32,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:39:32,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:39:32,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:32,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:32,572 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:32,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:32,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495070065] [2025-04-26 18:39:32,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495070065] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:32,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:32,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:39:32,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207222252] [2025-04-26 18:39:32,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:32,573 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:32,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:32,573 INFO L85 PathProgramCache]: Analyzing trace with hash 4259, now seen corresponding path program 2 times [2025-04-26 18:39:32,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:32,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149224560] [2025-04-26 18:39:32,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:32,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:32,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:32,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:32,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:32,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:32,576 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:32,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:32,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:32,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:32,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:32,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:32,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:32,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:32,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:32,590 INFO L87 Difference]: Start difference. First operand 178 states and 336 transitions. cyclomatic complexity: 192 Second operand has 4 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:32,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:32,614 INFO L93 Difference]: Finished difference Result 272 states and 509 transitions. [2025-04-26 18:39:32,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 509 transitions. [2025-04-26 18:39:32,616 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 26 [2025-04-26 18:39:32,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 272 states and 509 transitions. [2025-04-26 18:39:32,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2025-04-26 18:39:32,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2025-04-26 18:39:32,617 INFO L74 IsDeterministic]: Start isDeterministic. Operand 272 states and 509 transitions. [2025-04-26 18:39:32,617 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:32,618 INFO L218 hiAutomatonCegarLoop]: Abstraction has 272 states and 509 transitions. [2025-04-26 18:39:32,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states and 509 transitions. [2025-04-26 18:39:32,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 195. [2025-04-26 18:39:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 195 states have (on average 1.8717948717948718) internal successors, (in total 365), 194 states have internal predecessors, (365), 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:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 365 transitions. [2025-04-26 18:39:32,623 INFO L240 hiAutomatonCegarLoop]: Abstraction has 195 states and 365 transitions. [2025-04-26 18:39:32,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:39:32,630 INFO L438 stractBuchiCegarLoop]: Abstraction has 195 states and 365 transitions. [2025-04-26 18:39:32,630 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:39:32,630 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 365 transitions. [2025-04-26 18:39:32,631 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 18:39:32,631 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:32,631 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:32,631 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:32,631 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:32,631 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[111] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_12, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[90] $Ultimate##0-->L36-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[92] L36-1-->L36: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[114] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[95] $Ultimate##0-->L50: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[94] L36-->L36-1: Formula: (and (= (store v_A_8 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_8 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_7) (= (+ v_thread1Thread1of1ForFork1_i_7 1) v_thread1Thread1of1ForFork1_i_8)) InVars {A=v_A_8, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_7, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_8} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork1_i]" "[108] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_12, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[101] $Ultimate##0-->L72-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[91] L36-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[96] L50-->L52-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[98] L52-1-->L52: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" [2025-04-26 18:39:32,631 INFO L754 eck$LassoCheckResult]: Loop: "[103] L72-1-->L72: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[105] L72-->L72-1: Formula: (and (= v_thread3Thread1of1ForFork0_k_8 (+ v_thread3Thread1of1ForFork0_k_7 1)) (= (store v_B_8 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_7)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_8} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_8, B=v_B_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, B]" [2025-04-26 18:39:32,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:32,632 INFO L85 PathProgramCache]: Analyzing trace with hash -810279666, now seen corresponding path program 2 times [2025-04-26 18:39:32,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:32,632 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811257466] [2025-04-26 18:39:32,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:32,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:32,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:39:32,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:39:32,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:32,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:32,641 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:32,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:39:32,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:39:32,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:32,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:32,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:32,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:32,649 INFO L85 PathProgramCache]: Analyzing trace with hash 4259, now seen corresponding path program 3 times [2025-04-26 18:39:32,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:32,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440402343] [2025-04-26 18:39:32,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:32,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:32,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:32,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:32,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:39:32,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:32,655 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:32,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:32,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:32,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:32,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:32,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:32,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:32,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1289675152, now seen corresponding path program 2 times [2025-04-26 18:39:32,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:32,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803969635] [2025-04-26 18:39:32,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:32,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:32,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:39:32,663 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:39:32,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:32,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:32,663 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:32,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:39:32,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:39:32,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:32,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:32,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:32,778 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:32,778 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:32,778 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:32,778 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:32,778 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:32,778 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,778 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:32,778 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:32,778 INFO L132 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_petrified1_Iteration7_Lasso [2025-04-26 18:39:32,778 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:32,778 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:32,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,911 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:32,911 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:32,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,913 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:32,913 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:32,914 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:32,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,927 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 18:39:32,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,935 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:32,936 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:32,938 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:32,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,951 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:32,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,959 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:32,960 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:32,961 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:32,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,975 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,981 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:32,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,983 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:32,984 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:32,986 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:32,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,999 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:33,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:33,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:33,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:33,007 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:33,008 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:33,009 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:33,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:33,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:33,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:33,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:33,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:33,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:33,022 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:33,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 18:39:33,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:33,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:33,029 INFO L229 MonitoredProcess]: Starting monitored process 31 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:33,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 18:39:33,031 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:33,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:33,041 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:39:33,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:33,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:33,042 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 18:39:33,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:33,045 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:33,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 18:39:33,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:33,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:33,053 INFO L229 MonitoredProcess]: Starting monitored process 32 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:33,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 18:39:33,056 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:33,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:33,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:33,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:33,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:33,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:33,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:33,068 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:33,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:33,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:33,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:33,075 INFO L229 MonitoredProcess]: Starting monitored process 33 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:33,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 18:39:33,078 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:33,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:33,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:33,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:33,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:33,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:33,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:33,090 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:33,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:33,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:33,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:33,097 INFO L229 MonitoredProcess]: Starting monitored process 34 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:33,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 18:39:33,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:33,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:33,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:33,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:33,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:33,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:33,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:33,111 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:33,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 18:39:33,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:33,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:33,118 INFO L229 MonitoredProcess]: Starting monitored process 35 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:33,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 18:39:33,119 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:33,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:33,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:33,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:33,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:33,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:33,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:33,132 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:33,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 18:39:33,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:33,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:33,139 INFO L229 MonitoredProcess]: Starting monitored process 36 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:33,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 18:39:33,141 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:33,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:33,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:33,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:33,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:33,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:33,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:33,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:33,152 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:33,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:33,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:33,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:33,158 INFO L229 MonitoredProcess]: Starting monitored process 37 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:33,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 18:39:33,160 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:33,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:33,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:33,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:33,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:33,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:33,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:33,175 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:33,184 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 18:39:33,184 INFO L437 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 18:39:33,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:33,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:33,185 INFO L229 MonitoredProcess]: Starting monitored process 38 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:33,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 18:39:33,187 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:33,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:33,201 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:33,202 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:33,202 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork0_k, N) = -1*thread3Thread1of1ForFork0_k + 1*N Supporting invariants [] [2025-04-26 18:39:33,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 18:39:33,207 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:33,214 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:33,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:39:33,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:39:33,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:33,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:33,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:33,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:33,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:33,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:33,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:33,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:33,242 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:33,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:33,263 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:33,263 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:33,264 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 195 states and 365 transitions. cyclomatic complexity: 206 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:33,314 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 195 states and 365 transitions. cyclomatic complexity: 206. 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 630 states and 1200 transitions. Complement of second has 7 states. [2025-04-26 18:39:33,314 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:33,316 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:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-04-26 18:39:33,316 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:39:33,316 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:33,316 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:39:33,316 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:33,316 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 18:39:33,316 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:33,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 630 states and 1200 transitions. [2025-04-26 18:39:33,319 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 18:39:33,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 630 states to 184 states and 334 transitions. [2025-04-26 18:39:33,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-04-26 18:39:33,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2025-04-26 18:39:33,321 INFO L74 IsDeterministic]: Start isDeterministic. Operand 184 states and 334 transitions. [2025-04-26 18:39:33,321 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:33,321 INFO L218 hiAutomatonCegarLoop]: Abstraction has 184 states and 334 transitions. [2025-04-26 18:39:33,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 334 transitions. [2025-04-26 18:39:33,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 173. [2025-04-26 18:39:33,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 173 states have (on average 1.8439306358381502) internal successors, (in total 319), 172 states have internal predecessors, (319), 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:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 319 transitions. [2025-04-26 18:39:33,325 INFO L240 hiAutomatonCegarLoop]: Abstraction has 173 states and 319 transitions. [2025-04-26 18:39:33,325 INFO L438 stractBuchiCegarLoop]: Abstraction has 173 states and 319 transitions. [2025-04-26 18:39:33,325 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:39:33,325 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 319 transitions. [2025-04-26 18:39:33,326 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 18:39:33,326 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:33,326 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:33,326 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:33,326 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:33,327 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[111] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_12, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[90] $Ultimate##0-->L36-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[92] L36-1-->L36: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[114] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[95] $Ultimate##0-->L50: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[94] L36-->L36-1: Formula: (and (= (store v_A_8 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_8 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_7) (= (+ v_thread1Thread1of1ForFork1_i_7 1) v_thread1Thread1of1ForFork1_i_8)) InVars {A=v_A_8, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_7, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_8} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork1_i]" "[96] L50-->L52-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[92] L36-1-->L36: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[98] L52-1-->L52: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[94] L36-->L36-1: Formula: (and (= (store v_A_8 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_8 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_7) (= (+ v_thread1Thread1of1ForFork1_i_7 1) v_thread1Thread1of1ForFork1_i_8)) InVars {A=v_A_8, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_7, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_8} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork1_i]" "[91] L36-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[108] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_12, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[101] $Ultimate##0-->L72-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 18:39:33,327 INFO L754 eck$LassoCheckResult]: Loop: "[103] L72-1-->L72: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[105] L72-->L72-1: Formula: (and (= v_thread3Thread1of1ForFork0_k_8 (+ v_thread3Thread1of1ForFork0_k_7 1)) (= (store v_B_8 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_7)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_8} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_8, B=v_B_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, B]" [2025-04-26 18:39:33,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:33,327 INFO L85 PathProgramCache]: Analyzing trace with hash 693918694, now seen corresponding path program 3 times [2025-04-26 18:39:33,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:33,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81348437] [2025-04-26 18:39:33,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:33,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:39:33,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:39:33,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:39:33,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:33,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:33,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:39:33,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:39:33,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:33,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:33,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:33,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:33,339 INFO L85 PathProgramCache]: Analyzing trace with hash 4259, now seen corresponding path program 4 times [2025-04-26 18:39:33,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:33,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655861724] [2025-04-26 18:39:33,339 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:39:33,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:33,341 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-04-26 18:39:33,342 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:33,342 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:39:33,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:33,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:33,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:33,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:33,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:33,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:33,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:33,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:33,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1135937352, now seen corresponding path program 3 times [2025-04-26 18:39:33,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:33,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006241008] [2025-04-26 18:39:33,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:33,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:33,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:39:33,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:39:33,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:39:33,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:33,352 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:33,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:39:33,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:39:33,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:33,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:33,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:33,518 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:33,518 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:33,518 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:33,518 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:33,518 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:33,518 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:33,518 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:33,518 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:33,518 INFO L132 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_petrified1_Iteration8_Lasso [2025-04-26 18:39:33,518 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:33,518 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:33,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:33,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:33,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:33,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:33,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:33,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:33,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:33,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:33,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:33,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:33,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:33,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:33,809 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:33,810 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:33,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:33,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:33,812 INFO L229 MonitoredProcess]: Starting monitored process 39 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:33,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 18:39:33,814 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:33,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:33,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:33,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:33,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:33,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:33,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:33,828 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:33,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 18:39:33,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:33,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:33,835 INFO L229 MonitoredProcess]: Starting monitored process 40 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:33,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 18:39:33,837 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:33,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:33,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:33,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:33,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:33,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:33,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:33,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:33,851 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:33,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 18:39:33,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:33,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:33,908 INFO L229 MonitoredProcess]: Starting monitored process 41 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:33,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 18:39:33,909 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:33,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:33,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:33,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:33,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:33,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:33,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:33,924 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:33,932 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:39:33,932 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:39:33,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:33,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:33,934 INFO L229 MonitoredProcess]: Starting monitored process 42 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:33,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 18:39:33,935 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:33,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 18:39:33,950 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:33,950 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:33,950 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork0_k, N) = -1*thread3Thread1of1ForFork0_k + 1*N Supporting invariants [] [2025-04-26 18:39:33,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:33,958 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:39:33,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:33,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:39:33,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:39:33,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:33,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:33,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:33,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:33,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:33,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:33,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:33,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:33,989 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:33,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:34,015 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:34,015 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:34,015 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 173 states and 319 transitions. cyclomatic complexity: 181 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:34,057 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 173 states and 319 transitions. cyclomatic complexity: 181. 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 338 states and 630 transitions. Complement of second has 6 states. [2025-04-26 18:39:34,057 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:34,058 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:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-04-26 18:39:34,058 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:39:34,058 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:34,058 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 18:39:34,058 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:34,058 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 18:39:34,058 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:34,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 630 transitions. [2025-04-26 18:39:34,060 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:34,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 0 states and 0 transitions. [2025-04-26 18:39:34,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:39:34,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:39:34,060 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:39:34,060 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:34,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:34,060 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:34,061 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:34,061 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:39:34,061 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:39:34,061 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:34,061 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:39:34,071 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:34,072 INFO L201 PluginConnector]: Adding new model motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:34 BoogieIcfgContainer [2025-04-26 18:39:34,072 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:34,073 INFO L158 Benchmark]: Toolchain (without parser) took 5800.38ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 84.0MB in the beginning and 127.5MB in the end (delta: -43.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:34,073 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 159.4MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:34,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.94ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 82.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:34,073 INFO L158 Benchmark]: Boogie Preprocessor took 27.85ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 81.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:34,074 INFO L158 Benchmark]: RCFGBuilder took 233.55ms. Allocated memory is still 159.4MB. Free memory was 81.0MB in the beginning and 69.3MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:39:34,074 INFO L158 Benchmark]: BuchiAutomizer took 5502.56ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 69.3MB in the beginning and 127.5MB in the end (delta: -58.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:34,075 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.24ms. Allocated memory is still 159.4MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.94ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 82.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.85ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 81.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 233.55ms. Allocated memory is still 159.4MB. Free memory was 81.0MB in the beginning and 69.3MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 5502.56ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 69.3MB in the beginning and 127.5MB in the end (delta: -58.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 5.3s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 4.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 254 StatesRemovedByMinimization, 6 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 [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 326 mSDsluCounter, 209 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 351 IncrementalHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 117 mSDtfsCounter, 351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital105 mio100 ax100 hnf100 lsp187 ukn33 mio100 lsp99 div100 bol100 ite100 ukn100 eq149 hnf96 smp86 dnf253 smp57 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 92ms VariablesStem: 4 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 226, Number of transitions in reduction automaton: 256, Number of states in reduction automaton: 135, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (2 trivial, 6 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 N + -1 * j and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. One deterministic module has affine ranking function k * -2 + 1 and consists of 8 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function -1 * k + 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:34,086 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...