/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/concurrent_mult.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:37:58,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:37:58,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:37:58,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:37:58,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:37:58,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:37:58,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:37:58,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:37:58,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:37:58,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:37:58,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:37:58,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:37:58,425 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:37:58,425 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:37:58,425 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:37:58,425 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:37:58,425 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:37:58,426 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:37:58,426 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:37:58,426 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:37:58,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:37:58,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:37:58,426 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:37:58,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:37:58,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:37:58,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:37:58,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:37:58,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:37:58,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:37:58,426 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:37:58,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:37:58,426 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:37:58,426 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:37:58,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:37:58,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:37:58,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:37:58,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:37:58,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:37:58,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:37:58,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:37:58,427 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:37:58,427 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:37:58,427 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:37:58,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:37:58,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:37:58,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:37:58,649 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:37:58,649 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:37:58,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/concurrent_mult.bpl [2025-04-26 18:37:58,652 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/concurrent_mult.bpl' [2025-04-26 18:37:58,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:37:58,665 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:37:58,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:37:58,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:37:58,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:37:58,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:37:58" (1/1) ... [2025-04-26 18:37:58,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:37:58" (1/1) ... [2025-04-26 18:37:58,689 INFO L138 Inliner]: procedures = 2, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:37:58,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:37:58,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:37:58,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:37:58,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:37:58,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:37:58" (1/1) ... [2025-04-26 18:37:58,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:37:58" (1/1) ... [2025-04-26 18:37:58,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:37:58" (1/1) ... [2025-04-26 18:37:58,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:37:58" (1/1) ... [2025-04-26 18:37:58,698 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:37:58" (1/1) ... [2025-04-26 18:37:58,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:37:58" (1/1) ... [2025-04-26 18:37:58,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:37:58" (1/1) ... [2025-04-26 18:37:58,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:37:58" (1/1) ... [2025-04-26 18:37:58,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:37:58" (1/1) ... [2025-04-26 18:37:58,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:37:58,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:37:58,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:37:58,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:37:58,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:37:58" (1/1) ... [2025-04-26 18:37:58,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:37:58,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:37:58,743 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:37:58,748 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:37:58,763 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mult given in one single declaration [2025-04-26 18:37:58,763 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2025-04-26 18:37:58,763 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2025-04-26 18:37:58,763 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:37:58,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:37:58,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:37:58,764 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:37:58,795 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:37:58,796 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:37:58,857 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:37:58,857 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:37:58,865 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:37:58,865 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:37:58,866 INFO L201 PluginConnector]: Adding new model concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:37:58 BoogieIcfgContainer [2025-04-26 18:37:58,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:37:58,867 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:37:58,867 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:37:58,872 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:37:58,872 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:37:58,872 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:37:58" (1/2) ... [2025-04-26 18:37:58,874 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1be1abf6 and model type concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:37:58, skipping insertion in model container [2025-04-26 18:37:58,874 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:37:58,874 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:37:58" (2/2) ... [2025-04-26 18:37:58,875 INFO L376 chiAutomizerObserver]: Analyzing ICFG concurrent_mult.bpl [2025-04-26 18:37:58,930 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:37:58,970 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:37:58,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:37:58,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:37:58,973 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:37:58,975 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:37:59,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 68 flow [2025-04-26 18:37:59,035 INFO L116 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-04-26 18:37:59,039 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:37:59,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 2/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-26 18:37:59,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 68 flow [2025-04-26 18:37:59,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 58 flow [2025-04-26 18:37:59,046 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 28 places, 23 transitions, 58 flow [2025-04-26 18:37:59,046 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 23 transitions, 58 flow [2025-04-26 18:37:59,058 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 70 states, 68 states have (on average 1.9558823529411764) internal successors, (in total 133), 69 states have internal predecessors, (133), 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:37:59,059 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 70 states, 68 states have (on average 1.9558823529411764) internal successors, (in total 133), 69 states have internal predecessors, (133), 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:37:59,060 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:37:59,097 WARN L140 AmpleReduction]: Number of pruned transitions: 21 [2025-04-26 18:37:59,097 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:37:59,097 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 5 [2025-04-26 18:37:59,098 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:17 [2025-04-26 18:37:59,098 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:21 [2025-04-26 18:37:59,098 WARN L145 AmpleReduction]: Times succ was already a loop node:3 [2025-04-26 18:37:59,098 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:5 [2025-04-26 18:37:59,098 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:37:59,098 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 44 states, 42 states have (on average 1.3333333333333333) internal successors, (in total 56), 43 states have internal predecessors, (56), 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:37:59,103 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:37:59,103 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:37:59,103 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:37:59,104 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:37:59,104 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:37:59,104 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:37:59,104 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:37:59,104 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:37:59,105 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 44 states, 42 states have (on average 1.3333333333333333) internal successors, (in total 56), 43 states have internal predecessors, (56), 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:37:59,112 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 23 [2025-04-26 18:37:59,112 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:37:59,113 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:37:59,115 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:37:59,115 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:37:59,115 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:37:59,115 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 44 states, 42 states have (on average 1.3333333333333333) internal successors, (in total 56), 43 states have internal predecessors, (56), 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:37:59,117 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 23 [2025-04-26 18:37:59,117 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:37:59,117 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:37:59,117 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:37:59,118 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:37:59,122 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L17: Formula: (<= 0 v_ULTIMATE.start_x_1) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_1} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_1} AuxVars[] AssignedVars[]" "[25] L17-->L19: Formula: (<= 0 v_ULTIMATE.start_y_1) InVars {ULTIMATE.start_y=v_ULTIMATE.start_y_1} OutVars{ULTIMATE.start_y=v_ULTIMATE.start_y_1} AuxVars[] AssignedVars[]" "[52] L19-->$Ultimate##0: Formula: (and (= v_multThread1of1ForFork0_a_6 v_ULTIMATE.start_x_3) (= v_multThread1of1ForFork0_thidvar0_2 1) (= v_multThread1of1ForFork0_b_4 v_ULTIMATE.start_y_3)) InVars {ULTIMATE.start_y=v_ULTIMATE.start_y_3, ULTIMATE.start_x=v_ULTIMATE.start_x_3} OutVars{multThread1of1ForFork0_thidvar0=v_multThread1of1ForFork0_thidvar0_2, multThread1of1ForFork0_b=v_multThread1of1ForFork0_b_4, multThread1of1ForFork0_a=v_multThread1of1ForFork0_a_6, ULTIMATE.start_y=v_ULTIMATE.start_y_3, ULTIMATE.start_x=v_ULTIMATE.start_x_3, multThread1of1ForFork0_z=v_multThread1of1ForFork0_z_8, multThread1of1ForFork0_i=v_multThread1of1ForFork0_i_12} AuxVars[] AssignedVars[multThread1of1ForFork0_thidvar0, multThread1of1ForFork0_b, multThread1of1ForFork0_a, multThread1of1ForFork0_z, multThread1of1ForFork0_i]" "[36] $Ultimate##0-->L31: Formula: (= v_multThread1of1ForFork0_z_1 0) InVars {} OutVars{multThread1of1ForFork0_z=v_multThread1of1ForFork0_z_1} AuxVars[] AssignedVars[multThread1of1ForFork0_z]" "[37] L31-->L32-1: Formula: (= v_multThread1of1ForFork0_i_1 0) InVars {} OutVars{multThread1of1ForFork0_i=v_multThread1of1ForFork0_i_1} AuxVars[] AssignedVars[multThread1of1ForFork0_i]" [2025-04-26 18:37:59,122 INFO L754 eck$LassoCheckResult]: Loop: "[39] L32-1-->L33: Formula: (< v_multThread1of1ForFork0_i_5 v_multThread1of1ForFork0_a_3) InVars {multThread1of1ForFork0_a=v_multThread1of1ForFork0_a_3, multThread1of1ForFork0_i=v_multThread1of1ForFork0_i_5} OutVars{multThread1of1ForFork0_a=v_multThread1of1ForFork0_a_3, multThread1of1ForFork0_i=v_multThread1of1ForFork0_i_5} AuxVars[] AssignedVars[]" "[41] L33-->L34: Formula: (= v_multThread1of1ForFork0_z_4 (+ v_multThread1of1ForFork0_b_1 v_multThread1of1ForFork0_z_3)) InVars {multThread1of1ForFork0_b=v_multThread1of1ForFork0_b_1, multThread1of1ForFork0_z=v_multThread1of1ForFork0_z_3} OutVars{multThread1of1ForFork0_b=v_multThread1of1ForFork0_b_1, multThread1of1ForFork0_z=v_multThread1of1ForFork0_z_4} AuxVars[] AssignedVars[multThread1of1ForFork0_z]" "[42] L34-->L32-1: Formula: (= v_multThread1of1ForFork0_i_8 (+ v_multThread1of1ForFork0_i_7 1)) InVars {multThread1of1ForFork0_i=v_multThread1of1ForFork0_i_7} OutVars{multThread1of1ForFork0_i=v_multThread1of1ForFork0_i_8} AuxVars[] AssignedVars[multThread1of1ForFork0_i]" [2025-04-26 18:37:59,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:37:59,125 INFO L85 PathProgramCache]: Analyzing trace with hash 58054202, now seen corresponding path program 1 times [2025-04-26 18:37:59,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:37:59,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430203003] [2025-04-26 18:37:59,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:37:59,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:37:59,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:37:59,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:37:59,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:37:59,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:37:59,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:37:59,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:37:59,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:37:59,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:37:59,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:37:59,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:37:59,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:37:59,189 INFO L85 PathProgramCache]: Analyzing trace with hash 68583, now seen corresponding path program 1 times [2025-04-26 18:37:59,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:37:59,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408062565] [2025-04-26 18:37:59,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:37:59,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:37:59,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:37:59,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:37:59,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:37:59,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:37:59,196 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:37:59,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:37:59,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:37:59,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:37:59,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:37:59,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:37:59,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:37:59,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1379049714, now seen corresponding path program 1 times [2025-04-26 18:37:59,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:37:59,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852785331] [2025-04-26 18:37:59,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:37:59,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:37:59,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:37:59,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:37:59,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:37:59,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:37:59,215 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:37:59,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:37:59,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:37:59,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:37:59,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:37:59,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:37:59,282 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:37:59,283 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:37:59,283 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:37:59,283 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:37:59,283 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:37:59,283 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:37:59,283 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:37:59,283 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:37:59,284 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_mult.bpl_petrified1_Iteration1_Loop [2025-04-26 18:37:59,284 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:37:59,284 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:37:59,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:37:59,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:37:59,355 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:37:59,355 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:37:59,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:37:59,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:37:59,360 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:37:59,361 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:37:59,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:37:59,363 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:37:59,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:37:59,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:37:59,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:37:59,386 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:37:59,387 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:37:59,389 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:37:59,389 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:37:59,457 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:37:59,481 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:37:59,481 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:37:59,481 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:37:59,481 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:37:59,482 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:37:59,482 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:37:59,482 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:37:59,482 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:37:59,482 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:37:59,482 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_mult.bpl_petrified1_Iteration1_Loop [2025-04-26 18:37:59,482 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:37:59,482 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:37:59,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:37:59,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:37:59,522 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:37:59,525 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:37:59,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:37:59,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:37:59,528 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:37:59,530 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:37:59,532 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:37:59,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:37:59,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:37:59,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:37:59,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:37:59,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:37:59,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:37:59,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:37:59,552 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:37:59,558 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:37:59,558 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:37:59,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:37:59,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:37:59,561 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:37:59,562 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:37:59,565 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:37:59,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:37:59,569 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:37:59,569 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:37:59,569 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(multThread1of1ForFork0_i, multThread1of1ForFork0_a) = -1*multThread1of1ForFork0_i + 1*multThread1of1ForFork0_a Supporting invariants [] [2025-04-26 18:37:59,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:37:59,577 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:37:59,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:37:59,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:37:59,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:37:59,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:37:59,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:37:59,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:37:59,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:37:59,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:37:59,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:37:59,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:37:59,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:37:59,659 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:37:59,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:37:59,688 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:37:59,719 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:37:59,724 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 44 states, 42 states have (on average 1.3333333333333333) internal successors, (in total 56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:37:59,811 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 44 states, 42 states have (on average 1.3333333333333333) internal successors, (in total 56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 84 states and 111 transitions. Complement of second has 6 states. [2025-04-26 18:37:59,812 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:37:59,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:37:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2025-04-26 18:37:59,822 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:37:59,822 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:37:59,822 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:37:59,822 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:37:59,822 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 18:37:59,823 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:37:59,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 111 transitions. [2025-04-26 18:37:59,828 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 18:37:59,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 38 states and 48 transitions. [2025-04-26 18:37:59,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-04-26 18:37:59,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-04-26 18:37:59,831 INFO L74 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2025-04-26 18:37:59,832 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:37:59,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2025-04-26 18:37:59,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2025-04-26 18:37:59,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2025-04-26 18:37:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (in total 47), 36 states have internal predecessors, (47), 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:37:59,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2025-04-26 18:37:59,851 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 47 transitions. [2025-04-26 18:37:59,851 INFO L438 stractBuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2025-04-26 18:37:59,851 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:37:59,851 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 47 transitions. [2025-04-26 18:37:59,851 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 18:37:59,851 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:37:59,851 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:37:59,852 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:37:59,852 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:37:59,852 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L17: Formula: (<= 0 v_ULTIMATE.start_x_1) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_1} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_1} AuxVars[] AssignedVars[]" "[25] L17-->L19: Formula: (<= 0 v_ULTIMATE.start_y_1) InVars {ULTIMATE.start_y=v_ULTIMATE.start_y_1} OutVars{ULTIMATE.start_y=v_ULTIMATE.start_y_1} AuxVars[] AssignedVars[]" "[52] L19-->$Ultimate##0: Formula: (and (= v_multThread1of1ForFork0_a_6 v_ULTIMATE.start_x_3) (= v_multThread1of1ForFork0_thidvar0_2 1) (= v_multThread1of1ForFork0_b_4 v_ULTIMATE.start_y_3)) InVars {ULTIMATE.start_y=v_ULTIMATE.start_y_3, ULTIMATE.start_x=v_ULTIMATE.start_x_3} OutVars{multThread1of1ForFork0_thidvar0=v_multThread1of1ForFork0_thidvar0_2, multThread1of1ForFork0_b=v_multThread1of1ForFork0_b_4, multThread1of1ForFork0_a=v_multThread1of1ForFork0_a_6, ULTIMATE.start_y=v_ULTIMATE.start_y_3, ULTIMATE.start_x=v_ULTIMATE.start_x_3, multThread1of1ForFork0_z=v_multThread1of1ForFork0_z_8, multThread1of1ForFork0_i=v_multThread1of1ForFork0_i_12} AuxVars[] AssignedVars[multThread1of1ForFork0_thidvar0, multThread1of1ForFork0_b, multThread1of1ForFork0_a, multThread1of1ForFork0_z, multThread1of1ForFork0_i]" "[36] $Ultimate##0-->L31: Formula: (= v_multThread1of1ForFork0_z_1 0) InVars {} OutVars{multThread1of1ForFork0_z=v_multThread1of1ForFork0_z_1} AuxVars[] AssignedVars[multThread1of1ForFork0_z]" "[37] L31-->L32-1: Formula: (= v_multThread1of1ForFork0_i_1 0) InVars {} OutVars{multThread1of1ForFork0_i=v_multThread1of1ForFork0_i_1} AuxVars[] AssignedVars[multThread1of1ForFork0_i]" "[38] L32-1-->multFINAL: Formula: (<= v_multThread1of1ForFork0_a_1 v_multThread1of1ForFork0_i_3) InVars {multThread1of1ForFork0_a=v_multThread1of1ForFork0_a_1, multThread1of1ForFork0_i=v_multThread1of1ForFork0_i_3} OutVars{multThread1of1ForFork0_a=v_multThread1of1ForFork0_a_1, multThread1of1ForFork0_i=v_multThread1of1ForFork0_i_3} AuxVars[] AssignedVars[]" "[40] multFINAL-->multEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[55] L19-1-->$Ultimate##0: Formula: (and (= 2 v_multThread1of1ForFork1_thidvar1_2) (= 2 v_multThread1of1ForFork1_thidvar0_2) (= v_multThread1of1ForFork1_a_6 v_ULTIMATE.start_y_5) (= v_multThread1of1ForFork1_b_4 v_ULTIMATE.start_x_5)) InVars {ULTIMATE.start_y=v_ULTIMATE.start_y_5, ULTIMATE.start_x=v_ULTIMATE.start_x_5} OutVars{multThread1of1ForFork1_b=v_multThread1of1ForFork1_b_4, multThread1of1ForFork1_a=v_multThread1of1ForFork1_a_6, multThread1of1ForFork1_thidvar0=v_multThread1of1ForFork1_thidvar0_2, multThread1of1ForFork1_thidvar1=v_multThread1of1ForFork1_thidvar1_2, ULTIMATE.start_y=v_ULTIMATE.start_y_5, ULTIMATE.start_x=v_ULTIMATE.start_x_5, multThread1of1ForFork1_z=v_multThread1of1ForFork1_z_8, multThread1of1ForFork1_i=v_multThread1of1ForFork1_i_12} AuxVars[] AssignedVars[multThread1of1ForFork1_b, multThread1of1ForFork1_a, multThread1of1ForFork1_thidvar0, multThread1of1ForFork1_thidvar1, multThread1of1ForFork1_z, multThread1of1ForFork1_i]" "[43] $Ultimate##0-->L31: Formula: (= v_multThread1of1ForFork1_z_1 0) InVars {} OutVars{multThread1of1ForFork1_z=v_multThread1of1ForFork1_z_1} AuxVars[] AssignedVars[multThread1of1ForFork1_z]" "[44] L31-->L32-1: Formula: (= v_multThread1of1ForFork1_i_1 0) InVars {} OutVars{multThread1of1ForFork1_i=v_multThread1of1ForFork1_i_1} AuxVars[] AssignedVars[multThread1of1ForFork1_i]" [2025-04-26 18:37:59,854 INFO L754 eck$LassoCheckResult]: Loop: "[46] L32-1-->L33: Formula: (< v_multThread1of1ForFork1_i_5 v_multThread1of1ForFork1_a_3) InVars {multThread1of1ForFork1_a=v_multThread1of1ForFork1_a_3, multThread1of1ForFork1_i=v_multThread1of1ForFork1_i_5} OutVars{multThread1of1ForFork1_a=v_multThread1of1ForFork1_a_3, multThread1of1ForFork1_i=v_multThread1of1ForFork1_i_5} AuxVars[] AssignedVars[]" "[48] L33-->L34: Formula: (= (+ v_multThread1of1ForFork1_b_1 v_multThread1of1ForFork1_z_3) v_multThread1of1ForFork1_z_4) InVars {multThread1of1ForFork1_b=v_multThread1of1ForFork1_b_1, multThread1of1ForFork1_z=v_multThread1of1ForFork1_z_3} OutVars{multThread1of1ForFork1_b=v_multThread1of1ForFork1_b_1, multThread1of1ForFork1_z=v_multThread1of1ForFork1_z_4} AuxVars[] AssignedVars[multThread1of1ForFork1_z]" "[49] L34-->L32-1: Formula: (= v_multThread1of1ForFork1_i_8 (+ v_multThread1of1ForFork1_i_7 1)) InVars {multThread1of1ForFork1_i=v_multThread1of1ForFork1_i_7} OutVars{multThread1of1ForFork1_i=v_multThread1of1ForFork1_i_8} AuxVars[] AssignedVars[multThread1of1ForFork1_i]" [2025-04-26 18:37:59,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:37:59,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1877179868, now seen corresponding path program 1 times [2025-04-26 18:37:59,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:37:59,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855641493] [2025-04-26 18:37:59,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:37:59,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:37:59,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:37:59,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:37:59,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:37:59,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:37:59,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:37:59,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:37:59,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:37:59,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:37:59,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:37:59,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:37:59,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:37:59,871 INFO L85 PathProgramCache]: Analyzing trace with hash 75534, now seen corresponding path program 1 times [2025-04-26 18:37:59,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:37:59,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702628621] [2025-04-26 18:37:59,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:37:59,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:37:59,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:37:59,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:37:59,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:37:59,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:37:59,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:37:59,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:37:59,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:37:59,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:37:59,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:37:59,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:37:59,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:37:59,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1703667885, now seen corresponding path program 1 times [2025-04-26 18:37:59,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:37:59,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255032606] [2025-04-26 18:37:59,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:37:59,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:37:59,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:37:59,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:37:59,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:37:59,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:37:59,882 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:37:59,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:37:59,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:37:59,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:37:59,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:37:59,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:37:59,914 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:37:59,914 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:37:59,914 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:37:59,914 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:37:59,914 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:37:59,914 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:37:59,914 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:37:59,914 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:37:59,914 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_mult.bpl_petrified1_Iteration2_Loop [2025-04-26 18:37:59,914 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:37:59,914 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:37:59,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:37:59,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:37:59,940 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:37:59,940 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:37:59,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:37:59,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:37:59,942 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:37:59,944 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:37:59,945 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:37:59,945 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:37:59,956 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:37:59,956 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multThread1of1ForFork1_b=0, multThread1of1ForFork1_z=0} Honda state: {multThread1of1ForFork1_b=0, multThread1of1ForFork1_z=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:37:59,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:37:59,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:37:59,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:37:59,963 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:37:59,964 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:37:59,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:37:59,964 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:37:59,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:37:59,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:37:59,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:37:59,982 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:37:59,982 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:37:59,983 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:37:59,983 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:00,045 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:38:00,049 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:38:00,050 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:00,050 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:00,050 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:00,050 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:00,050 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:00,050 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:00,050 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:00,050 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:00,050 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_mult.bpl_petrified1_Iteration2_Loop [2025-04-26 18:38:00,050 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:00,050 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:00,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:00,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:00,077 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:00,077 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:00,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:00,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:00,079 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:38:00,080 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:38:00,083 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:38:00,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:00,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:00,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:00,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:00,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:00,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:00,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:00,099 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:38:00,104 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:38:00,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:00,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:00,106 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:38:00,106 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:38:00,107 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:38:00,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:00,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:00,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:00,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:00,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:00,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:00,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:00,120 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:00,122 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:38:00,122 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:38:00,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:00,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:00,124 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:38:00,125 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:38:00,126 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:00,129 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:38:00,129 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:38:00,129 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:00,129 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(multThread1of1ForFork1_a, multThread1of1ForFork1_i) = 1*multThread1of1ForFork1_a - 1*multThread1of1ForFork1_i Supporting invariants [] [2025-04-26 18:38:00,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:38:00,136 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:38:00,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:00,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:38:00,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:38:00,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:00,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:00,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:00,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:00,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:38:00,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:38:00,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:00,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:00,173 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:00,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:00,189 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:38:00,189 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:38:00,190 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 47 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:00,208 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 47 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 54 states and 71 transitions. Complement of second has 4 states. [2025-04-26 18:38:00,208 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:38:00,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2025-04-26 18:38:00,209 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 18:38:00,209 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:00,209 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 18:38:00,209 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:00,209 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 10 letters. Loop has 6 letters. [2025-04-26 18:38:00,209 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:00,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 71 transitions. [2025-04-26 18:38:00,210 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:38:00,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. [2025-04-26 18:38:00,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:38:00,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:38:00,210 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:38:00,210 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:00,211 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:38:00,211 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:38:00,211 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:38:00,211 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:38:00,211 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:38:00,211 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:38:00,211 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:38:00,220 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:38:00,221 INFO L201 PluginConnector]: Adding new model concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:38:00 BoogieIcfgContainer [2025-04-26 18:38:00,222 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:38:00,222 INFO L158 Benchmark]: Toolchain (without parser) took 1557.02ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 87.3MB in the beginning and 74.8MB in the end (delta: 12.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:00,222 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.71ms. Allocated memory is still 159.4MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:00,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.17ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 85.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:00,223 INFO L158 Benchmark]: Boogie Preprocessor took 24.39ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 84.5MB in the end (delta: 865.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:00,223 INFO L158 Benchmark]: RCFGBuilder took 150.34ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 75.8MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:38:00,223 INFO L158 Benchmark]: BuchiAutomizer took 1354.53ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 75.7MB in the beginning and 74.8MB in the end (delta: 882.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:00,224 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 1.71ms. Allocated memory is still 159.4MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.17ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 85.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.39ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 84.5MB in the end (delta: 865.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 150.34ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 75.8MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1354.53ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 75.7MB in the beginning and 74.8MB in the end (delta: 882.7kB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 40 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp70 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 43ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 131, Number of transitions in reduction automaton: 56, Number of states in reduction automaton: 44, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + a and consists of 4 locations. One deterministic module has affine ranking function -1 * i + a and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:38:00,235 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...