/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/difference-det.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:30,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:30,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:30,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:30,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:30,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:30,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:30,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:30,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:30,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:30,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:30,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:30,930 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:30,930 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:30,930 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:30,930 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:30,931 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:30,931 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:30,931 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:30,931 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:30,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:30,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:30,931 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:30,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:30,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:30,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:30,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:30,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:30,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:30,931 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:30,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:30,931 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:30,931 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:30,932 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:30,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:30,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:30,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:30,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:30,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:30,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:30,932 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:30,932 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:30,932 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:31,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:31,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:31,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:31,141 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:31,141 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:31,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/difference-det.wvr.bpl [2025-04-26 18:41:31,145 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/difference-det.wvr.bpl' [2025-04-26 18:41:31,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:31,164 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:31,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:31,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:31,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:31,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "difference-det.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:31" (1/1) ... [2025-04-26 18:41:31,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "difference-det.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:31" (1/1) ... [2025-04-26 18:41:31,200 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:31,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:31,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:31,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:31,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:31,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "difference-det.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:31" (1/1) ... [2025-04-26 18:41:31,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "difference-det.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:31" (1/1) ... [2025-04-26 18:41:31,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "difference-det.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:31" (1/1) ... [2025-04-26 18:41:31,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "difference-det.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:31" (1/1) ... [2025-04-26 18:41:31,212 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "difference-det.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:31" (1/1) ... [2025-04-26 18:41:31,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "difference-det.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:31" (1/1) ... [2025-04-26 18:41:31,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "difference-det.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:31" (1/1) ... [2025-04-26 18:41:31,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "difference-det.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:31" (1/1) ... [2025-04-26 18:41:31,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "difference-det.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:31" (1/1) ... [2025-04-26 18:41:31,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:31,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:31,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:31,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:31,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "difference-det.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:31" (1/1) ... [2025-04-26 18:41:31,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:31,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:31,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:31,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:41:31,284 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:31,284 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:31,285 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:31,285 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:31,285 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:31,285 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:31,285 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:31,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:31,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:31,285 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:31,285 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:31,285 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:31,285 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:41:31,285 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:41:31,285 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:41:31,286 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:41:31,325 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:31,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:31,403 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:31,403 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:31,421 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:31,421 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:31,422 INFO L201 PluginConnector]: Adding new model difference-det.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:31 BoogieIcfgContainer [2025-04-26 18:41:31,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:31,423 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:31,423 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:31,427 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:31,427 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:31,427 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "difference-det.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:31" (1/2) ... [2025-04-26 18:41:31,428 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69a87151 and model type difference-det.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:31, skipping insertion in model container [2025-04-26 18:41:31,428 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:31,428 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "difference-det.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:31" (2/2) ... [2025-04-26 18:41:31,429 INFO L376 chiAutomizerObserver]: Analyzing ICFG difference-det.wvr.bpl [2025-04-26 18:41:31,480 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:41:31,521 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:31,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:31,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:31,523 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:31,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:41:31,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 116 flow [2025-04-26 18:41:31,614 INFO L116 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-04-26 18:41:31,618 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:41:31,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 4/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-04-26 18:41:31,622 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 44 transitions, 116 flow [2025-04-26 18:41:31,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 96 flow [2025-04-26 18:41:31,627 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 45 places, 36 transitions, 96 flow [2025-04-26 18:41:31,628 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 36 transitions, 96 flow [2025-04-26 18:41:31,685 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 438 states, 436 states have (on average 3.811926605504587) internal successors, (in total 1662), 437 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:31,687 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 438 states, 436 states have (on average 3.811926605504587) internal successors, (in total 1662), 437 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:31,689 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:31,841 WARN L140 AmpleReduction]: Number of pruned transitions: 543 [2025-04-26 18:41:31,842 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:31,842 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 186 [2025-04-26 18:41:31,842 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:32 [2025-04-26 18:41:31,842 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:219 [2025-04-26 18:41:31,842 WARN L145 AmpleReduction]: Times succ was already a loop node:370 [2025-04-26 18:41:31,842 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:41:31,842 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:31,843 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 438 states, 436 states have (on average 2.56651376146789) internal successors, (in total 1119), 437 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:31,852 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:31,853 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:31,853 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:31,853 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:31,853 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:31,853 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:31,853 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:31,853 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:31,855 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 438 states, 436 states have (on average 2.56651376146789) internal successors, (in total 1119), 437 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:31,887 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 380 [2025-04-26 18:41:31,887 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:31,887 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:31,894 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:31,894 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:31,894 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:31,895 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 438 states, 436 states have (on average 2.56651376146789) internal successors, (in total 1119), 437 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:31,933 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 380 [2025-04-26 18:41:31,933 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:31,933 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:31,934 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:31,934 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:31,939 INFO L752 eck$LassoCheckResult]: Stem: "[89] $Ultimate##0-->L70: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[93] L70-->L71: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[66] L71-->L72: Formula: (= v_counter1_7 0) InVars {counter1=v_counter1_7} OutVars{counter1=v_counter1_7} AuxVars[] AssignedVars[]" "[92] L72-->L73: Formula: (= v_j1_1 0) InVars {j1=v_j1_1} OutVars{j1=v_j1_1} AuxVars[] AssignedVars[]" "[90] L73-->L74: Formula: (= v_j2_1 0) InVars {j2=v_j2_1} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[]" "[63] L74-->L75: Formula: (= v_counter2_2 0) InVars {counter2=v_counter2_2} OutVars{counter2=v_counter2_2} AuxVars[] AssignedVars[]" "[86] L75-->L76: Formula: (= v_M1_1 v_N1_3) InVars {M1=v_M1_1, N1=v_N1_3} OutVars{M1=v_M1_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[94] L76-->L77: Formula: (= v_M2_1 v_N2_3) InVars {N2=v_N2_3, M2=v_M2_1} OutVars{N2=v_N2_3, M2=v_M2_1} AuxVars[] AssignedVars[]" "[114] L77-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:41:31,939 INFO L754 eck$LassoCheckResult]: Loop: "[97] L24-1-->L24: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[99] L24-->L24-1: Formula: (and (= v_counter1_8 (+ v_counter1_9 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter1=v_counter1_9} OutVars{i1=v_i1_6, counter1=v_counter1_8} AuxVars[] AssignedVars[counter1, i1]" [2025-04-26 18:41:31,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2108904762, now seen corresponding path program 1 times [2025-04-26 18:41:31,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:31,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510392216] [2025-04-26 18:41:31,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:31,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:31,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:32,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:32,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,004 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:32,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:32,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:32,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:32,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:32,023 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 18:41:32,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:32,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34422039] [2025-04-26 18:41:32,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:32,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:32,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:32,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:32,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,032 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:32,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:32,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:32,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:32,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:32,038 INFO L85 PathProgramCache]: Analyzing trace with hash 567090536, now seen corresponding path program 1 times [2025-04-26 18:41:32,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:32,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732350652] [2025-04-26 18:41:32,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:32,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:32,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:32,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:32,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:32,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:32,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:32,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:32,119 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:32,119 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:32,119 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:32,119 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:32,119 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:32,119 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,119 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:32,120 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:32,120 INFO L132 ssoRankerPreferences]: Filename of dumped script: difference-det.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:41:32,120 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:32,120 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:32,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:32,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:32,207 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:32,207 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:32,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,211 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:41:32,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:32,213 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:32,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:41:32,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,233 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:41:32,235 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:32,235 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:32,261 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:41:32,261 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {counter1=0} Honda state: {counter1=0} Generalized eigenvectors: [{counter1=-3}, {counter1=-3}, {counter1=7}] Lambdas: [0, 1, 1] Nus: [1, 0] [2025-04-26 18:41:32,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:41:32,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,270 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:41:32,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:32,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:32,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:32,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,291 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:41:32,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:32,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:32,360 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:32,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:32,364 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:32,365 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:32,365 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:32,365 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:32,365 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:32,365 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,365 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:32,365 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:32,365 INFO L132 ssoRankerPreferences]: Filename of dumped script: difference-det.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:41:32,365 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:32,365 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:32,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:32,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:32,399 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:32,401 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:32,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,405 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:41:32,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:32,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:32,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:32,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:32,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:32,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:32,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:32,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:32,427 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:32,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:32,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,434 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:41:32,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:32,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:32,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:32,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:32,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:32,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:32,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:32,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:32,450 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:32,454 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:41:32,454 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:41:32,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,457 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:41:32,459 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:32,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:41:32,462 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:32,462 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:32,462 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N1, i1) = 1*N1 - 1*i1 Supporting invariants [] [2025-04-26 18:41:32,467 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:41:32,469 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:32,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:32,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:32,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:32,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:32,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:32,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:32,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:32,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:32,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:32,513 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:32,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:32,546 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:32,548 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 438 states, 436 states have (on average 2.56651376146789) internal successors, (in total 1119), 437 states have internal predecessors, (1119), 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 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:41:32,637 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 438 states, 436 states have (on average 2.56651376146789) internal successors, (in total 1119), 437 states have internal predecessors, (1119), 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 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 1031 states and 2650 transitions. Complement of second has 7 states. [2025-04-26 18:41:32,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:32,641 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:41:32,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2025-04-26 18:41:32,644 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:41:32,645 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:32,645 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:41:32,645 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:32,645 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:41:32,645 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:32,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1031 states and 2650 transitions. [2025-04-26 18:41:32,656 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 210 [2025-04-26 18:41:32,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1031 states to 539 states and 1379 transitions. [2025-04-26 18:41:32,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 232 [2025-04-26 18:41:32,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 347 [2025-04-26 18:41:32,664 INFO L74 IsDeterministic]: Start isDeterministic. Operand 539 states and 1379 transitions. [2025-04-26 18:41:32,664 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:32,664 INFO L218 hiAutomatonCegarLoop]: Abstraction has 539 states and 1379 transitions. [2025-04-26 18:41:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states and 1379 transitions. [2025-04-26 18:41:32,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 464. [2025-04-26 18:41:32,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 464 states have (on average 2.5560344827586206) internal successors, (in total 1186), 463 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:32,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1186 transitions. [2025-04-26 18:41:32,710 INFO L240 hiAutomatonCegarLoop]: Abstraction has 464 states and 1186 transitions. [2025-04-26 18:41:32,710 INFO L438 stractBuchiCegarLoop]: Abstraction has 464 states and 1186 transitions. [2025-04-26 18:41:32,710 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:32,710 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 464 states and 1186 transitions. [2025-04-26 18:41:32,712 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 210 [2025-04-26 18:41:32,712 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:32,712 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:32,713 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:32,713 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:32,713 INFO L752 eck$LassoCheckResult]: Stem: "[89] $Ultimate##0-->L70: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[93] L70-->L71: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[66] L71-->L72: Formula: (= v_counter1_7 0) InVars {counter1=v_counter1_7} OutVars{counter1=v_counter1_7} AuxVars[] AssignedVars[]" "[92] L72-->L73: Formula: (= v_j1_1 0) InVars {j1=v_j1_1} OutVars{j1=v_j1_1} AuxVars[] AssignedVars[]" "[90] L73-->L74: Formula: (= v_j2_1 0) InVars {j2=v_j2_1} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[]" "[63] L74-->L75: Formula: (= v_counter2_2 0) InVars {counter2=v_counter2_2} OutVars{counter2=v_counter2_2} AuxVars[] AssignedVars[]" "[86] L75-->L76: Formula: (= v_M1_1 v_N1_3) InVars {M1=v_M1_1, N1=v_N1_3} OutVars{M1=v_M1_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[94] L76-->L77: Formula: (= v_M2_1 v_N2_3) InVars {N2=v_N2_3, M2=v_M2_1} OutVars{N2=v_N2_3, M2=v_M2_1} AuxVars[] AssignedVars[]" "[114] L77-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[96] L24-1-->thread1FINAL: Formula: (<= v_N1_2 v_i1_4) InVars {i1=v_i1_4, N1=v_N1_2} OutVars{i1=v_i1_4, N1=v_N1_2} AuxVars[] AssignedVars[]" "[98] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[117] L77-1-->L35-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:41:32,713 INFO L754 eck$LassoCheckResult]: Loop: "[101] L35-1-->L35: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[103] L35-->L35-1: Formula: (and (< 0 v_counter1_17) (= (+ v_counter1_16 1) v_counter1_17) (= v_i2_10 (+ v_i2_11 1))) InVars {counter1=v_counter1_17, i2=v_i2_11} OutVars{counter1=v_counter1_16, i2=v_i2_10} AuxVars[] AssignedVars[counter1, i2]" [2025-04-26 18:41:32,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:32,714 INFO L85 PathProgramCache]: Analyzing trace with hash 399936557, now seen corresponding path program 1 times [2025-04-26 18:41:32,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:32,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21851407] [2025-04-26 18:41:32,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:32,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:32,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:32,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:32,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,722 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:32,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:32,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:32,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:32,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:32,729 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 18:41:32,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:32,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035500452] [2025-04-26 18:41:32,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:32,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:32,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:32,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:32,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,733 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:32,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:32,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:32,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:32,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:32,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2086945167, now seen corresponding path program 1 times [2025-04-26 18:41:32,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:32,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016518115] [2025-04-26 18:41:32,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:32,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:32,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:32,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:32,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:32,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:32,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016518115] [2025-04-26 18:41:32,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016518115] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:32,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:32,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:41:32,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978068524] [2025-04-26 18:41:32,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:32,821 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:32,821 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:32,821 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:32,821 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:32,821 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:32,821 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,821 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:32,821 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:32,821 INFO L132 ssoRankerPreferences]: Filename of dumped script: difference-det.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:41:32,822 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:32,822 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:32,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:32,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:32,855 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:32,855 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:32,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,858 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:41:32,861 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:32,862 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:32,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:41:32,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,881 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:41:32,884 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:32,884 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:32,906 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:32,909 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:41:32,910 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:32,910 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:32,910 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:32,910 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:32,910 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:32,910 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,910 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:32,910 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:32,910 INFO L132 ssoRankerPreferences]: Filename of dumped script: difference-det.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:41:32,910 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:32,910 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:32,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:32,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:32,942 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:32,942 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:32,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,944 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:41:32,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:32,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:32,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:32,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:32,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:32,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:32,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:32,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:32,962 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:32,964 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 18:41:32,964 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:41:32,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,966 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:41:32,969 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:32,972 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:41:32,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:41:32,974 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:32,974 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:32,975 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter1) = 1*counter1 Supporting invariants [] [2025-04-26 18:41:32,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:41:32,981 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:32,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:32,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:33,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:33,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:33,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:33,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:33,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:33,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:33,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:33,024 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:33,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:33,026 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:41:33,027 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 464 states and 1186 transitions. cyclomatic complexity: 829 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:41:33,066 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 464 states and 1186 transitions. cyclomatic complexity: 829. 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 820 states and 1994 transitions. Complement of second has 5 states. [2025-04-26 18:41:33,067 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:33,068 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:41:33,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-04-26 18:41:33,068 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:41:33,068 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:33,068 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:41:33,068 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:33,068 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 18:41:33,069 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:33,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 820 states and 1994 transitions. [2025-04-26 18:41:33,074 INFO L131 ngComponentsAnalysis]: Automaton has 103 accepting balls. 276 [2025-04-26 18:41:33,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 820 states to 651 states and 1612 transitions. [2025-04-26 18:41:33,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 343 [2025-04-26 18:41:33,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2025-04-26 18:41:33,084 INFO L74 IsDeterministic]: Start isDeterministic. Operand 651 states and 1612 transitions. [2025-04-26 18:41:33,084 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:33,085 INFO L218 hiAutomatonCegarLoop]: Abstraction has 651 states and 1612 transitions. [2025-04-26 18:41:33,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states and 1612 transitions. [2025-04-26 18:41:33,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 551. [2025-04-26 18:41:33,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 551 states have (on average 2.5517241379310347) internal successors, (in total 1406), 550 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 1406 transitions. [2025-04-26 18:41:33,099 INFO L240 hiAutomatonCegarLoop]: Abstraction has 551 states and 1406 transitions. [2025-04-26 18:41:33,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:33,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:41:33,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:41:33,103 INFO L87 Difference]: Start difference. First operand 551 states and 1406 transitions. Second operand has 3 states, 2 states have (on average 7.0) 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:41:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:33,146 INFO L93 Difference]: Finished difference Result 602 states and 1494 transitions. [2025-04-26 18:41:33,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 602 states and 1494 transitions. [2025-04-26 18:41:33,150 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 250 [2025-04-26 18:41:33,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 602 states to 600 states and 1492 transitions. [2025-04-26 18:41:33,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 334 [2025-04-26 18:41:33,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 334 [2025-04-26 18:41:33,156 INFO L74 IsDeterministic]: Start isDeterministic. Operand 600 states and 1492 transitions. [2025-04-26 18:41:33,156 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:33,156 INFO L218 hiAutomatonCegarLoop]: Abstraction has 600 states and 1492 transitions. [2025-04-26 18:41:33,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states and 1492 transitions. [2025-04-26 18:41:33,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 554. [2025-04-26 18:41:33,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 554 states have (on average 2.5433212996389893) internal successors, (in total 1409), 553 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1409 transitions. [2025-04-26 18:41:33,168 INFO L240 hiAutomatonCegarLoop]: Abstraction has 554 states and 1409 transitions. [2025-04-26 18:41:33,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:41:33,169 INFO L438 stractBuchiCegarLoop]: Abstraction has 554 states and 1409 transitions. [2025-04-26 18:41:33,169 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:33,169 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 554 states and 1409 transitions. [2025-04-26 18:41:33,171 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 210 [2025-04-26 18:41:33,172 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:33,172 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:33,172 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:33,172 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:33,172 INFO L752 eck$LassoCheckResult]: Stem: "[89] $Ultimate##0-->L70: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[93] L70-->L71: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[66] L71-->L72: Formula: (= v_counter1_7 0) InVars {counter1=v_counter1_7} OutVars{counter1=v_counter1_7} AuxVars[] AssignedVars[]" "[92] L72-->L73: Formula: (= v_j1_1 0) InVars {j1=v_j1_1} OutVars{j1=v_j1_1} AuxVars[] AssignedVars[]" "[90] L73-->L74: Formula: (= v_j2_1 0) InVars {j2=v_j2_1} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[]" "[63] L74-->L75: Formula: (= v_counter2_2 0) InVars {counter2=v_counter2_2} OutVars{counter2=v_counter2_2} AuxVars[] AssignedVars[]" "[86] L75-->L76: Formula: (= v_M1_1 v_N1_3) InVars {M1=v_M1_1, N1=v_N1_3} OutVars{M1=v_M1_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[94] L76-->L77: Formula: (= v_M2_1 v_N2_3) InVars {N2=v_N2_3, M2=v_M2_1} OutVars{N2=v_N2_3, M2=v_M2_1} AuxVars[] AssignedVars[]" "[114] L77-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[97] L24-1-->L24: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[117] L77-1-->L35-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[99] L24-->L24-1: Formula: (and (= v_counter1_8 (+ v_counter1_9 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter1=v_counter1_9} OutVars{i1=v_i1_6, counter1=v_counter1_8} AuxVars[] AssignedVars[counter1, i1]" "[96] L24-1-->thread1FINAL: Formula: (<= v_N1_2 v_i1_4) InVars {i1=v_i1_4, N1=v_N1_2} OutVars{i1=v_i1_4, N1=v_N1_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:33,172 INFO L754 eck$LassoCheckResult]: Loop: "[101] L35-1-->L35: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[103] L35-->L35-1: Formula: (and (< 0 v_counter1_17) (= (+ v_counter1_16 1) v_counter1_17) (= v_i2_10 (+ v_i2_11 1))) InVars {counter1=v_counter1_17, i2=v_i2_11} OutVars{counter1=v_counter1_16, i2=v_i2_10} AuxVars[] AssignedVars[counter1, i2]" [2025-04-26 18:41:33,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash -486821033, now seen corresponding path program 1 times [2025-04-26 18:41:33,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:33,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378150838] [2025-04-26 18:41:33,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:33,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:33,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:33,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:33,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,180 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:33,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:33,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:33,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:33,188 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:33,189 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 2 times [2025-04-26 18:41:33,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:33,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294106528] [2025-04-26 18:41:33,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:33,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:33,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:33,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:33,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:33,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,192 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:33,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:33,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:33,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:33,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:33,194 INFO L85 PathProgramCache]: Analyzing trace with hash 316425785, now seen corresponding path program 1 times [2025-04-26 18:41:33,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:33,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802729777] [2025-04-26 18:41:33,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:33,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:33,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:33,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:33,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:33,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:33,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:33,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:33,228 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:33,228 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:33,228 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:33,228 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:33,228 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:33,228 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,228 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:33,228 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:33,228 INFO L132 ssoRankerPreferences]: Filename of dumped script: difference-det.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:41:33,228 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:33,228 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:33,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:33,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:33,256 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:33,256 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:33,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,258 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:33,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:41:33,260 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:33,260 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:33,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:41:33,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,278 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:33,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:41:33,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:33,279 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:33,342 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:33,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:41:33,346 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:33,346 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:33,346 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:33,346 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:33,346 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:33,346 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,346 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:33,346 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:33,346 INFO L132 ssoRankerPreferences]: Filename of dumped script: difference-det.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:41:33,347 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:33,347 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:33,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:33,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:33,385 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:33,385 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:33,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,387 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:33,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:41:33,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:33,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:33,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:33,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:33,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:33,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:33,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:33,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:33,402 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:33,405 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:41:33,405 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:41:33,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,407 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:33,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:41:33,409 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:33,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:33,412 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:33,413 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:33,413 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N2, i2) = 1*N2 - 1*i2 Supporting invariants [] [2025-04-26 18:41:33,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:41:33,419 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:33,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:33,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:33,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:33,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:33,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:33,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:33,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:33,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:33,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:33,465 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:33,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:33,482 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:33,482 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 554 states and 1409 transitions. cyclomatic complexity: 976 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:33,547 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 554 states and 1409 transitions. cyclomatic complexity: 976. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1251 states and 3357 transitions. Complement of second has 6 states. [2025-04-26 18:41:33,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-04-26 18:41:33,549 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:41:33,549 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:33,549 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 18:41:33,549 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:33,549 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 18:41:33,549 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:33,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1251 states and 3357 transitions. [2025-04-26 18:41:33,560 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 94 [2025-04-26 18:41:33,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1251 states to 837 states and 2133 transitions. [2025-04-26 18:41:33,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 279 [2025-04-26 18:41:33,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 422 [2025-04-26 18:41:33,569 INFO L74 IsDeterministic]: Start isDeterministic. Operand 837 states and 2133 transitions. [2025-04-26 18:41:33,569 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:33,569 INFO L218 hiAutomatonCegarLoop]: Abstraction has 837 states and 2133 transitions. [2025-04-26 18:41:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states and 2133 transitions. [2025-04-26 18:41:33,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 606. [2025-04-26 18:41:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 606 states have (on average 2.6518151815181517) internal successors, (in total 1607), 605 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1607 transitions. [2025-04-26 18:41:33,588 INFO L240 hiAutomatonCegarLoop]: Abstraction has 606 states and 1607 transitions. [2025-04-26 18:41:33,588 INFO L438 stractBuchiCegarLoop]: Abstraction has 606 states and 1607 transitions. [2025-04-26 18:41:33,588 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:33,588 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 606 states and 1607 transitions. [2025-04-26 18:41:33,590 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 94 [2025-04-26 18:41:33,590 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:33,590 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:33,591 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:33,591 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:33,592 INFO L752 eck$LassoCheckResult]: Stem: "[89] $Ultimate##0-->L70: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[93] L70-->L71: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[66] L71-->L72: Formula: (= v_counter1_7 0) InVars {counter1=v_counter1_7} OutVars{counter1=v_counter1_7} AuxVars[] AssignedVars[]" "[92] L72-->L73: Formula: (= v_j1_1 0) InVars {j1=v_j1_1} OutVars{j1=v_j1_1} AuxVars[] AssignedVars[]" "[90] L73-->L74: Formula: (= v_j2_1 0) InVars {j2=v_j2_1} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[]" "[63] L74-->L75: Formula: (= v_counter2_2 0) InVars {counter2=v_counter2_2} OutVars{counter2=v_counter2_2} AuxVars[] AssignedVars[]" "[86] L75-->L76: Formula: (= v_M1_1 v_N1_3) InVars {M1=v_M1_1, N1=v_N1_3} OutVars{M1=v_M1_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[94] L76-->L77: Formula: (= v_M2_1 v_N2_3) InVars {N2=v_N2_3, M2=v_M2_1} OutVars{N2=v_N2_3, M2=v_M2_1} AuxVars[] AssignedVars[]" "[114] L77-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[96] L24-1-->thread1FINAL: Formula: (<= v_N1_2 v_i1_4) InVars {i1=v_i1_4, N1=v_N1_2} OutVars{i1=v_i1_4, N1=v_N1_2} AuxVars[] AssignedVars[]" "[98] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[117] L77-1-->L35-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[100] L35-1-->thread2FINAL: Formula: (<= v_N2_2 v_i2_4) InVars {N2=v_N2_2, i2=v_i2_4} OutVars{N2=v_N2_2, i2=v_i2_4} AuxVars[] AssignedVars[]" "[102] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[120] L78-->L47-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:41:33,592 INFO L754 eck$LassoCheckResult]: Loop: "[105] L47-1-->L47: Formula: (< v_j1_2 v_M1_2) InVars {M1=v_M1_2, j1=v_j1_2} OutVars{M1=v_M1_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[107] L47-->L47-1: Formula: (and (= v_j1_6 (+ v_j1_7 1)) (= v_counter2_8 (+ v_counter2_9 1))) InVars {counter2=v_counter2_9, j1=v_j1_7} OutVars{counter2=v_counter2_8, j1=v_j1_6} AuxVars[] AssignedVars[counter2, j1]" [2025-04-26 18:41:33,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:33,593 INFO L85 PathProgramCache]: Analyzing trace with hash 270789865, now seen corresponding path program 1 times [2025-04-26 18:41:33,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:33,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430909061] [2025-04-26 18:41:33,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:33,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:33,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:33,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:33,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,598 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:33,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:33,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:33,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:33,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:33,604 INFO L85 PathProgramCache]: Analyzing trace with hash 4323, now seen corresponding path program 1 times [2025-04-26 18:41:33,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:33,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904752217] [2025-04-26 18:41:33,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:33,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:33,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:33,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:33,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:33,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:33,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:33,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:33,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:33,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1763941429, now seen corresponding path program 1 times [2025-04-26 18:41:33,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:33,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118863556] [2025-04-26 18:41:33,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:33,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:33,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:41:33,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:41:33,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:33,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:33,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118863556] [2025-04-26 18:41:33,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118863556] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:33,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:33,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:41:33,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248526883] [2025-04-26 18:41:33,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:33,715 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:33,715 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:33,715 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:33,715 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:33,715 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:33,715 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,715 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:33,715 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:33,715 INFO L132 ssoRankerPreferences]: Filename of dumped script: difference-det.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 18:41:33,715 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:33,715 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:33,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:33,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:33,739 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:33,739 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:33,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,741 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:33,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:41:33,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:33,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:33,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:41:33,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,762 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:41:33,763 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:41:33,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:33,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:33,827 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:33,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:41:33,832 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:33,832 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:33,832 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:33,832 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:33,832 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:33,832 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,832 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:33,832 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:33,832 INFO L132 ssoRankerPreferences]: Filename of dumped script: difference-det.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 18:41:33,832 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:33,832 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:33,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:33,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:33,859 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:33,859 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:33,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,862 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:41:33,863 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:41:33,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:33,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:33,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:33,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:33,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:33,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:33,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:33,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:33,879 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:33,883 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:41:33,883 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:41:33,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,885 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:41:33,887 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:41:33,888 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:33,892 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:41:33,892 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:33,892 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:33,892 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M1, j1) = 1*M1 - 1*j1 Supporting invariants [] [2025-04-26 18:41:33,898 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:41:33,900 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:33,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:33,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:33,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:33,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:33,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:33,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:33,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:33,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:33,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:33,963 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:33,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:33,977 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:33,977 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 606 states and 1607 transitions. cyclomatic complexity: 1092 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:34,063 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 606 states and 1607 transitions. cyclomatic complexity: 1092. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1609 states and 4361 transitions. Complement of second has 6 states. [2025-04-26 18:41:34,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:34,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-26 18:41:34,065 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 18:41:34,066 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:34,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 17 letters. Loop has 2 letters. [2025-04-26 18:41:34,066 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:34,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 18:41:34,066 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:34,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1609 states and 4361 transitions. [2025-04-26 18:41:34,078 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 18:41:34,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1609 states to 758 states and 2002 transitions. [2025-04-26 18:41:34,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2025-04-26 18:41:34,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 260 [2025-04-26 18:41:34,083 INFO L74 IsDeterministic]: Start isDeterministic. Operand 758 states and 2002 transitions. [2025-04-26 18:41:34,083 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:34,083 INFO L218 hiAutomatonCegarLoop]: Abstraction has 758 states and 2002 transitions. [2025-04-26 18:41:34,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states and 2002 transitions. [2025-04-26 18:41:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 704. [2025-04-26 18:41:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 704 states have (on average 2.586647727272727) internal successors, (in total 1821), 703 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1821 transitions. [2025-04-26 18:41:34,103 INFO L240 hiAutomatonCegarLoop]: Abstraction has 704 states and 1821 transitions. [2025-04-26 18:41:34,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:34,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:41:34,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:41:34,104 INFO L87 Difference]: Start difference. First operand 704 states and 1821 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (in total 17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:34,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:34,197 INFO L93 Difference]: Finished difference Result 721 states and 1842 transitions. [2025-04-26 18:41:34,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 721 states and 1842 transitions. [2025-04-26 18:41:34,202 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-04-26 18:41:34,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 721 states to 721 states and 1842 transitions. [2025-04-26 18:41:34,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2025-04-26 18:41:34,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2025-04-26 18:41:34,206 INFO L74 IsDeterministic]: Start isDeterministic. Operand 721 states and 1842 transitions. [2025-04-26 18:41:34,207 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:34,207 INFO L218 hiAutomatonCegarLoop]: Abstraction has 721 states and 1842 transitions. [2025-04-26 18:41:34,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states and 1842 transitions. [2025-04-26 18:41:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 708. [2025-04-26 18:41:34,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 708 states have (on average 2.577683615819209) internal successors, (in total 1825), 707 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:34,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1825 transitions. [2025-04-26 18:41:34,218 INFO L240 hiAutomatonCegarLoop]: Abstraction has 708 states and 1825 transitions. [2025-04-26 18:41:34,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 18:41:34,219 INFO L438 stractBuchiCegarLoop]: Abstraction has 708 states and 1825 transitions. [2025-04-26 18:41:34,219 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:34,219 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 708 states and 1825 transitions. [2025-04-26 18:41:34,222 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 18:41:34,222 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:34,222 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:34,222 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:34,222 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:34,223 INFO L752 eck$LassoCheckResult]: Stem: "[89] $Ultimate##0-->L70: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[93] L70-->L71: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[66] L71-->L72: Formula: (= v_counter1_7 0) InVars {counter1=v_counter1_7} OutVars{counter1=v_counter1_7} AuxVars[] AssignedVars[]" "[92] L72-->L73: Formula: (= v_j1_1 0) InVars {j1=v_j1_1} OutVars{j1=v_j1_1} AuxVars[] AssignedVars[]" "[90] L73-->L74: Formula: (= v_j2_1 0) InVars {j2=v_j2_1} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[]" "[63] L74-->L75: Formula: (= v_counter2_2 0) InVars {counter2=v_counter2_2} OutVars{counter2=v_counter2_2} AuxVars[] AssignedVars[]" "[86] L75-->L76: Formula: (= v_M1_1 v_N1_3) InVars {M1=v_M1_1, N1=v_N1_3} OutVars{M1=v_M1_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[94] L76-->L77: Formula: (= v_M2_1 v_N2_3) InVars {N2=v_N2_3, M2=v_M2_1} OutVars{N2=v_N2_3, M2=v_M2_1} AuxVars[] AssignedVars[]" "[114] L77-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[97] L24-1-->L24: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[117] L77-1-->L35-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[99] L24-->L24-1: Formula: (and (= v_counter1_8 (+ v_counter1_9 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter1=v_counter1_9} OutVars{i1=v_i1_6, counter1=v_counter1_8} AuxVars[] AssignedVars[counter1, i1]" "[120] L78-->L47-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[96] L24-1-->thread1FINAL: Formula: (<= v_N1_2 v_i1_4) InVars {i1=v_i1_4, N1=v_N1_2} OutVars{i1=v_i1_4, N1=v_N1_2} AuxVars[] AssignedVars[]" "[123] L79-->L58-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[100] L35-1-->thread2FINAL: Formula: (<= v_N2_2 v_i2_4) InVars {N2=v_N2_2, i2=v_i2_4} OutVars{N2=v_N2_2, i2=v_i2_4} AuxVars[] AssignedVars[]" "[104] L47-1-->thread3FINAL: Formula: (<= v_M1_3 v_j1_5) InVars {M1=v_M1_3, j1=v_j1_5} OutVars{M1=v_M1_3, j1=v_j1_5} AuxVars[] AssignedVars[]" [2025-04-26 18:41:34,223 INFO L754 eck$LassoCheckResult]: Loop: "[109] L58-1-->L58: Formula: (< v_j2_5 v_M2_3) InVars {j2=v_j2_5, M2=v_M2_3} OutVars{j2=v_j2_5, M2=v_M2_3} AuxVars[] AssignedVars[]" "[111] L58-->L58-1: Formula: (and (= (+ v_counter2_16 1) v_counter2_17) (< 0 v_counter2_17) (= (+ v_j2_11 1) v_j2_10)) InVars {j2=v_j2_11, counter2=v_counter2_17} OutVars{j2=v_j2_10, counter2=v_counter2_16} AuxVars[] AssignedVars[counter2, j2]" [2025-04-26 18:41:34,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:34,223 INFO L85 PathProgramCache]: Analyzing trace with hash -835460658, now seen corresponding path program 1 times [2025-04-26 18:41:34,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:34,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964366882] [2025-04-26 18:41:34,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:34,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:34,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:41:34,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:41:34,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:34,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:34,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964366882] [2025-04-26 18:41:34,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964366882] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:34,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:34,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:41:34,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353899217] [2025-04-26 18:41:34,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:34,311 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:34,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:34,311 INFO L85 PathProgramCache]: Analyzing trace with hash 4451, now seen corresponding path program 1 times [2025-04-26 18:41:34,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:34,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362562900] [2025-04-26 18:41:34,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:34,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:34,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:34,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:34,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:34,316 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:34,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:34,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:34,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:34,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:34,338 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:34,338 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:34,338 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:34,338 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:34,338 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:34,338 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,338 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:34,338 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:34,338 INFO L132 ssoRankerPreferences]: Filename of dumped script: difference-det.wvr.bpl_petrified1_Iteration5_Loop [2025-04-26 18:41:34,338 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:34,338 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:34,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:34,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:34,367 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:34,367 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:34,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:34,369 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:41:34,371 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:41:34,372 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:34,372 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:34,393 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:41:34,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:34,395 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:41:34,397 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:41:34,398 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:34,398 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:34,420 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:34,424 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:41:34,424 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:34,424 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:34,424 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:34,424 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:34,424 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:34,424 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,424 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:34,424 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:34,425 INFO L132 ssoRankerPreferences]: Filename of dumped script: difference-det.wvr.bpl_petrified1_Iteration5_Loop [2025-04-26 18:41:34,425 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:34,425 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:34,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:34,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:34,459 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:34,459 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:34,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:34,461 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:41:34,463 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:41:34,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:34,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:34,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:34,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:34,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:34,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:34,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:34,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:34,476 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:34,478 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 18:41:34,478 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:41:34,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:34,480 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:41:34,481 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:41:34,482 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:34,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:34,486 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:34,486 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:34,486 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter2) = 1*counter2 Supporting invariants [] [2025-04-26 18:41:34,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:34,492 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:34,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:34,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:41:34,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:41:34,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:34,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:34,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:34,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:34,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:34,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:34,536 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:34,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:34,538 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:41:34,538 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 708 states and 1825 transitions. cyclomatic complexity: 1198 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:34,561 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 708 states and 1825 transitions. cyclomatic complexity: 1198. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1126 states and 2823 transitions. Complement of second has 4 states. [2025-04-26 18:41:34,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:34,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-04-26 18:41:34,562 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 55 transitions. Stem has 17 letters. Loop has 2 letters. [2025-04-26 18:41:34,563 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:34,563 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 55 transitions. Stem has 19 letters. Loop has 2 letters. [2025-04-26 18:41:34,563 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:34,563 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 55 transitions. Stem has 17 letters. Loop has 4 letters. [2025-04-26 18:41:34,563 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:34,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1126 states and 2823 transitions. [2025-04-26 18:41:34,568 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:34,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1126 states to 0 states and 0 transitions. [2025-04-26 18:41:34,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:34,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:34,569 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:34,569 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:34,569 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:34,569 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:34,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:34,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-26 18:41:34,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-26 18:41:34,569 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (in total 17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:34,569 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 18:41:34,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 18:41:34,569 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:34,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 18:41:34,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:34,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:34,569 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:34,569 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:34,569 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:34,569 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:34,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:41:34,570 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:34,570 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:41:34,570 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:34,570 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:34,570 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:34,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:41:34,581 INFO L201 PluginConnector]: Adding new model difference-det.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:34 BoogieIcfgContainer [2025-04-26 18:41:34,581 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:34,581 INFO L158 Benchmark]: Toolchain (without parser) took 3416.81ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 86.8MB in the beginning and 38.9MB in the end (delta: 47.9MB). Peak memory consumption was 35.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:34,581 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.85ms. Allocated memory is still 159.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:34,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.78ms. Allocated memory is still 159.4MB. Free memory was 86.8MB in the beginning and 84.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:34,582 INFO L158 Benchmark]: Boogie Preprocessor took 26.26ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 83.9MB in the end (delta: 959.5kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:34,582 INFO L158 Benchmark]: RCFGBuilder took 192.86ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 73.3MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:41:34,582 INFO L158 Benchmark]: BuchiAutomizer took 3157.98ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.2MB in the beginning and 38.9MB in the end (delta: 34.2MB). Peak memory consumption was 22.8MB. Max. memory is 8.0GB. [2025-04-26 18:41:34,583 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.85ms. Allocated memory is still 159.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.78ms. Allocated memory is still 159.4MB. Free memory was 86.8MB in the beginning and 84.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.26ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 83.9MB in the end (delta: 959.5kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 192.86ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 73.3MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3157.98ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.2MB in the beginning and 38.9MB in the end (delta: 34.2MB). Peak memory consumption was 22.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 519 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 [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 297 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 356 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 312 IncrementalHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 187 mSDtfsCounter, 312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 331, Number of transitions in reduction automaton: 1119, Number of states in reduction automaton: 438, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N1 + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function counter1 and consists of 3 locations. One deterministic module has affine ranking function -1 * i2 + N2 and consists of 4 locations. One deterministic module has affine ranking function -1 * j1 + M1 and consists of 4 locations. One deterministic module has affine ranking function counter2 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:34,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...