/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 16:52:11,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:52:11,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:52:11,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:52:11,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:52:11,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:52:11,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:52:11,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:52:11,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:52:11,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:52:11,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:52:11,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:52:11,665 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:52:11,665 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:52:11,665 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:52:11,665 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:52:11,665 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:52:11,665 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:52:11,665 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:52:11,665 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:52:11,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:52:11,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:52:11,665 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:52:11,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:52:11,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:52:11,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:52:11,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:52:11,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:52:11,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:52:11,666 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:52:11,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:52:11,666 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:52:11,666 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:52:11,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:52:11,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:52:11,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:52:11,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:52:11,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:52:11,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:52:11,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:52:11,666 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:52:11,668 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:52:11,668 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:52:11,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:52:11,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:52:11,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:52:11,894 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:52:11,895 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:52:11,895 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 16:52:11,896 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/concurrent_mult.bpl' [2025-04-26 16:52:11,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:52:11,909 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:52:11,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:52:11,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:52:11,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:52:11,917 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 04:52:11" (1/1) ... [2025-04-26 16:52:11,936 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 04:52:11" (1/1) ... [2025-04-26 16:52:11,941 INFO L138 Inliner]: procedures = 2, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:52:11,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:52:11,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:52:11,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:52:11,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:52:11,948 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 04:52:11" (1/1) ... [2025-04-26 16:52:11,948 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 04:52:11" (1/1) ... [2025-04-26 16:52:11,948 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 04:52:11" (1/1) ... [2025-04-26 16:52:11,949 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 04:52:11" (1/1) ... [2025-04-26 16:52:11,951 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 04:52:11" (1/1) ... [2025-04-26 16:52:11,951 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 04:52:11" (1/1) ... [2025-04-26 16:52:11,954 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 04:52:11" (1/1) ... [2025-04-26 16:52:11,954 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 04:52:11" (1/1) ... [2025-04-26 16:52:11,955 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 04:52:11" (1/1) ... [2025-04-26 16:52:11,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:52:11,965 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:52:11,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:52:11,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:52:11,966 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:11" (1/1) ... [2025-04-26 16:52:11,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:52:11,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:11,988 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 16:52:11,993 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 16:52:12,009 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mult given in one single declaration [2025-04-26 16:52:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2025-04-26 16:52:12,010 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2025-04-26 16:52:12,010 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:52:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:52:12,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:52:12,010 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 16:52:12,042 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:52:12,044 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:52:12,098 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:52:12,098 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:52:12,104 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:52:12,104 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:52:12,104 INFO L201 PluginConnector]: Adding new model concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:52:12 BoogieIcfgContainer [2025-04-26 16:52:12,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:52:12,105 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:52:12,105 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:52:12,109 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:52:12,109 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:52:12,109 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:11" (1/2) ... [2025-04-26 16:52:12,110 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 04:52:12, skipping insertion in model container [2025-04-26 16:52:12,110 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:52:12,111 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 04:52:12" (2/2) ... [2025-04-26 16:52:12,111 INFO L376 chiAutomizerObserver]: Analyzing ICFG concurrent_mult.bpl [2025-04-26 16:52:12,146 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:52:12,181 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:12,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:12,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:12,183 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 16:52:12,186 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 16:52:12,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 68 flow [2025-04-26 16:52:12,258 INFO L116 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-04-26 16:52:12,262 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:52:12,265 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 16:52:12,266 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 68 flow [2025-04-26 16:52:12,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 58 flow [2025-04-26 16:52:12,270 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 28 places, 23 transitions, 58 flow [2025-04-26 16:52:12,275 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:12,331 WARN L140 AmpleReduction]: Number of pruned transitions: 21 [2025-04-26 16:52:12,333 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:52:12,333 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 5 [2025-04-26 16:52:12,333 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:17 [2025-04-26 16:52:12,333 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:21 [2025-04-26 16:52:12,333 WARN L145 AmpleReduction]: Times succ was already a loop node:3 [2025-04-26 16:52:12,333 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:5 [2025-04-26 16:52:12,333 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:12,335 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 16:52:12,343 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:12,343 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:12,343 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:12,343 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:12,343 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:12,343 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:12,343 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:12,343 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:12,345 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 16:52:12,355 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 23 [2025-04-26 16:52:12,355 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:12,356 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:12,358 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:52:12,358 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:52:12,358 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:12,359 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 16:52:12,360 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 23 [2025-04-26 16:52:12,360 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:12,360 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:12,360 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:52:12,360 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:52:12,367 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 16:52:12,367 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 16:52:12,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:12,371 INFO L85 PathProgramCache]: Analyzing trace with hash 58054202, now seen corresponding path program 1 times [2025-04-26 16:52:12,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:12,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080475728] [2025-04-26 16:52:12,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:12,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:12,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:52:12,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:52:12,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:12,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:12,431 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:12,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:52:12,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:52:12,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:12,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:12,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:12,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:12,452 INFO L85 PathProgramCache]: Analyzing trace with hash 68583, now seen corresponding path program 1 times [2025-04-26 16:52:12,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:12,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243051987] [2025-04-26 16:52:12,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:12,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:12,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:52:12,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:52:12,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:12,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:12,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:12,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:52:12,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:52:12,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:12,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:12,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:12,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:12,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1379049714, now seen corresponding path program 1 times [2025-04-26 16:52:12,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:12,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794712391] [2025-04-26 16:52:12,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:12,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:12,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:52:12,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:52:12,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:12,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:12,472 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:12,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:52:12,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:52:12,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:12,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:12,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:12,525 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:52:12,525 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:52:12,525 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:52:12,525 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:52:12,525 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:52:12,526 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:12,526 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:52:12,526 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:52:12,527 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_mult.bpl_petrified1_Iteration1_Loop [2025-04-26 16:52:12,527 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:52:12,527 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:52:12,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:12,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:12,586 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:52:12,587 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:52:12,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:12,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:12,591 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 16:52:12,592 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 16:52:12,593 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:52:12,593 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:52:12,612 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 16:52:12,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:12,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:12,614 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 16:52:12,615 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 16:52:12,617 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:52:12,617 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:52:12,680 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:52:12,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:12,684 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:52:12,684 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:52:12,684 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:52:12,684 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:52:12,684 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:52:12,684 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:12,685 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:52:12,685 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:52:12,685 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_mult.bpl_petrified1_Iteration1_Loop [2025-04-26 16:52:12,685 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:52:12,685 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:52:12,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:12,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:12,725 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:52:12,728 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:52:12,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:12,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:12,753 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 16:52:12,754 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 16:52:12,756 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 16:52:12,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:12,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:52:12,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:12,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:12,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:12,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:52:12,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:52:12,774 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:52:12,781 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:52:12,781 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:52:12,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:12,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:12,785 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 16:52:12,787 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 16:52:12,787 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:52:12,790 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:52:12,791 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 16:52:12,791 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:52:12,791 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:52:12,792 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 16:52:12,797 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 16:52:12,800 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:52:12,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:12,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:52:12,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:52:12,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:12,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:12,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:52:12,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:12,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:52:12,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:52:12,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:12,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:12,875 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:52:12,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:12,898 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 16:52:12,944 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 16:52:12,946 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 16:52:13,033 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 83 states and 110 transitions. Complement of second has 6 states. [2025-04-26 16:52:13,034 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 16:52:13,037 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 16:52:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2025-04-26 16:52:13,042 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:52:13,042 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:13,042 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:52:13,046 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:13,046 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:52:13,046 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:13,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 110 transitions. [2025-04-26 16:52:13,049 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 16:52:13,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 38 states and 48 transitions. [2025-04-26 16:52:13,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-04-26 16:52:13,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-04-26 16:52:13,052 INFO L74 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2025-04-26 16:52:13,052 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:52:13,052 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2025-04-26 16:52:13,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2025-04-26 16:52:13,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2025-04-26 16:52:13,070 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 16:52:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2025-04-26 16:52:13,072 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 47 transitions. [2025-04-26 16:52:13,073 INFO L438 stractBuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2025-04-26 16:52:13,073 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:52:13,073 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 47 transitions. [2025-04-26 16:52:13,073 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 16:52:13,073 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:13,073 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:13,074 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:13,074 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:52:13,074 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 16:52:13,074 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 16:52:13,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:13,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1877179868, now seen corresponding path program 1 times [2025-04-26 16:52:13,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:13,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647878643] [2025-04-26 16:52:13,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:13,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:13,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:52:13,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:52:13,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:13,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:13,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:13,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:52:13,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:52:13,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:13,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:13,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:13,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:13,092 INFO L85 PathProgramCache]: Analyzing trace with hash 75534, now seen corresponding path program 1 times [2025-04-26 16:52:13,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:13,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112856466] [2025-04-26 16:52:13,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:13,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:13,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:52:13,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:52:13,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:13,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:13,095 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:13,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:52:13,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:52:13,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:13,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:13,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:13,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:13,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1703667885, now seen corresponding path program 1 times [2025-04-26 16:52:13,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:13,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558536740] [2025-04-26 16:52:13,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:13,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:13,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:52:13,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:52:13,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:13,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:13,108 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:13,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:52:13,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:52:13,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:13,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:13,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:13,143 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:52:13,143 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:52:13,143 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:52:13,143 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:52:13,143 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:52:13,143 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:13,143 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:52:13,143 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:52:13,143 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_mult.bpl_petrified1_Iteration2_Loop [2025-04-26 16:52:13,143 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:52:13,143 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:52:13,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:13,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:13,171 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:52:13,171 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:52:13,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:13,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:13,173 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 16:52:13,174 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 16:52:13,177 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:52:13,178 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:52:13,190 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:52:13,191 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 16:52:13,196 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 16:52:13,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:13,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:13,198 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 16:52:13,199 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 16:52:13,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:52:13,201 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:52:13,220 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 16:52:13,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:13,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:13,222 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 16:52:13,223 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 16:52:13,225 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:52:13,225 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:52:13,288 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:52:13,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:13,292 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:52:13,292 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:52:13,292 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:52:13,293 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:52:13,293 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:52:13,293 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:13,293 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:52:13,293 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:52:13,293 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_mult.bpl_petrified1_Iteration2_Loop [2025-04-26 16:52:13,293 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:52:13,293 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:52:13,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:13,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:13,325 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:52:13,325 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:52:13,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:13,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:13,329 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 16:52:13,331 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 16:52:13,332 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 16:52:13,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:13,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:52:13,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:13,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:13,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:13,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:52:13,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:52:13,344 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:52:13,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:13,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:13,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:13,352 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 16:52:13,353 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 16:52:13,353 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 16:52:13,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:13,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:52:13,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:13,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:13,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:13,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:52:13,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:52:13,366 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:52:13,369 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:52:13,369 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:52:13,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:13,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:13,371 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 16:52:13,373 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 16:52:13,374 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:52:13,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:13,377 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:52:13,377 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:52:13,377 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 16:52:13,382 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 16:52:13,383 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:52:13,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:13,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:52:13,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:52:13,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:13,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:13,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:52:13,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:13,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:52:13,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:52:13,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:13,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:13,418 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:52:13,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:13,439 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 16:52:13,439 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 16:52:13,439 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 16:52:13,461 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 16:52:13,462 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 16:52:13,462 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 16:52:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2025-04-26 16:52:13,463 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 16:52:13,463 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:13,463 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 16:52:13,463 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:13,463 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 10 letters. Loop has 6 letters. [2025-04-26 16:52:13,463 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:13,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 71 transitions. [2025-04-26 16:52:13,464 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:52:13,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. [2025-04-26 16:52:13,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:52:13,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:52:13,464 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:52:13,464 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:52:13,464 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:52:13,464 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:52:13,464 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:52:13,465 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:52:13,465 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:52:13,465 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:52:13,465 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:52:13,481 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 16:52:13,482 INFO L201 PluginConnector]: Adding new model concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:52:13 BoogieIcfgContainer [2025-04-26 16:52:13,482 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:52:13,482 INFO L158 Benchmark]: Toolchain (without parser) took 1573.17ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 85.3MB in the beginning and 76.8MB in the end (delta: 8.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:13,483 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:13,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.99ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 83.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:13,483 INFO L158 Benchmark]: Boogie Preprocessor took 20.83ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 82.5MB in the end (delta: 927.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:13,483 INFO L158 Benchmark]: RCFGBuilder took 139.64ms. Allocated memory is still 159.4MB. Free memory was 82.3MB in the beginning and 73.8MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:52:13,483 INFO L158 Benchmark]: BuchiAutomizer took 1376.61ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.7MB in the beginning and 76.8MB in the end (delta: -3.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:13,484 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.16ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.99ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 83.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 20.83ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 82.5MB in the end (delta: 927.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 139.64ms. Allocated memory is still 159.4MB. Free memory was 82.3MB in the beginning and 73.8MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1376.61ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.7MB in the beginning and 76.8MB in the end (delta: -3.1MB). 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, 59 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 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: 63ms 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]: 155, 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 16:52:13,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...