/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/buchiAutomizer/concurrent-automaton-noLbe.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:20:06,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:20:06,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:20:06,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:20:06,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:20:06,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:20:06,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:20:06,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:20:06,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:20:06,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:20:06,970 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:20:06,970 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:20:06,970 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:20:06,970 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:20:06,970 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:20:06,970 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:20:06,970 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:20:06,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:20:06,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:20:06,970 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:20:06,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:20:06,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:20:06,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:20:06,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:20:06,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:20:06,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:20:06,971 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:20:06,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:20:06,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:20:06,971 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:20:06,971 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:20:06,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:20:06,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:20:06,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:20:06,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:20:06,971 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:20:06,971 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:20:07,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:20:07,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:20:07,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:20:07,196 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:20:07,197 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:20:07,197 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:20:07,198 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/concurrent_mult.bpl' [2025-04-26 16:20:07,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:20:07,213 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:20:07,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:07,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:20:07,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:20:07,220 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:20:07" (1/1) ... [2025-04-26 16:20:07,241 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:20:07" (1/1) ... [2025-04-26 16:20:07,245 INFO L138 Inliner]: procedures = 2, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:20:07,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:07,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:20:07,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:20:07,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:20:07,252 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:20:07" (1/1) ... [2025-04-26 16:20:07,252 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:20:07" (1/1) ... [2025-04-26 16:20:07,252 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:20:07" (1/1) ... [2025-04-26 16:20:07,253 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:20:07" (1/1) ... [2025-04-26 16:20:07,254 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:20:07" (1/1) ... [2025-04-26 16:20:07,254 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:20:07" (1/1) ... [2025-04-26 16:20:07,259 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:20:07" (1/1) ... [2025-04-26 16:20:07,259 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:20:07" (1/1) ... [2025-04-26 16:20:07,259 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:20:07" (1/1) ... [2025-04-26 16:20:07,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:20:07,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:20:07,267 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:20:07,267 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:20:07,268 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:20:07" (1/1) ... [2025-04-26 16:20:07,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:07,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:07,287 INFO L229 MonitoredProcess]: Starting monitored process 1 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:20:07,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:20:07,307 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mult given in one single declaration [2025-04-26 16:20:07,308 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2025-04-26 16:20:07,308 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2025-04-26 16:20:07,308 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:20:07,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:20:07,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:20:07,309 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:20:07,341 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:20:07,342 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:20:07,388 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:20:07,388 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:20:07,395 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:20:07,395 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:20:07,395 INFO L201 PluginConnector]: Adding new model concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:07 BoogieIcfgContainer [2025-04-26 16:20:07,395 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:20:07,396 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:20:07,396 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:20:07,400 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:20:07,400 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:07,400 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:20:07" (1/2) ... [2025-04-26 16:20:07,401 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d014255 and model type concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:20:07, skipping insertion in model container [2025-04-26 16:20:07,401 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:07,401 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:20:07" (2/2) ... [2025-04-26 16:20:07,402 INFO L376 chiAutomizerObserver]: Analyzing ICFG concurrent_mult.bpl [2025-04-26 16:20:07,446 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:20:07,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 68 flow [2025-04-26 16:20:07,501 INFO L116 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-04-26 16:20:07,504 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:20:07,512 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:20:07,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 68 flow [2025-04-26 16:20:07,515 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 58 flow [2025-04-26 16:20:07,515 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 28 places, 23 transitions, 58 flow [2025-04-26 16:20:07,523 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:20:07,523 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:20:07,523 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:20:07,523 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:20:07,524 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:20:07,524 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:20:07,525 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:20:07,526 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:20:07,527 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:20:07,568 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 39 [2025-04-26 16:20:07,569 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:07,569 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:07,572 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:20:07,573 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:20:07,573 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:20:07,573 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 69 states, but on-demand construction may add more states [2025-04-26 16:20:07,578 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 39 [2025-04-26 16:20:07,578 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:07,578 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:07,578 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:20:07,578 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:20:07,585 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:20:07,585 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:20:07,590 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash 58054202, now seen corresponding path program 1 times [2025-04-26 16:20:07,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:07,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852609515] [2025-04-26 16:20:07,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:07,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:07,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:07,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:07,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:07,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:07,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:07,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:07,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:07,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:07,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:07,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:07,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:07,681 INFO L85 PathProgramCache]: Analyzing trace with hash 68583, now seen corresponding path program 1 times [2025-04-26 16:20:07,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:07,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310208162] [2025-04-26 16:20:07,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:07,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:07,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:07,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:07,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:07,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:07,689 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:07,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:07,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:07,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:07,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:07,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:07,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:07,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1379049714, now seen corresponding path program 1 times [2025-04-26 16:20:07,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:07,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161755205] [2025-04-26 16:20:07,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:07,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:07,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:07,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:07,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:07,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:07,707 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:07,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:07,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:07,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:07,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:07,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:07,774 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:07,775 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:07,775 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:07,775 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:07,775 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:07,775 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:07,775 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:07,775 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:07,775 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_mult.bpl_petrified1_Iteration1_Loop [2025-04-26 16:20:07,775 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:07,776 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:07,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:07,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:07,842 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:07,843 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:07,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:07,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:07,850 INFO L229 MonitoredProcess]: Starting monitored process 2 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:20:07,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:20:07,852 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:07,852 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:07,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:07,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:07,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:07,875 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:20:07,875 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:20:07,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:07,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:07,942 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:07,946 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:20:07,946 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:07,946 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:07,946 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:07,946 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:07,947 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:07,947 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:07,947 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:07,947 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:07,947 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_mult.bpl_petrified1_Iteration1_Loop [2025-04-26 16:20:07,947 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:07,947 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:07,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:07,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:07,978 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:07,980 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:07,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:07,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:07,983 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:20:07,984 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:20:07,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:07,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:07,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:07,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:07,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:07,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:08,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:08,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:08,005 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:08,012 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:20:08,012 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:20:08,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:08,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:08,015 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:20:08,017 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:20:08,018 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:08,021 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:20:08,021 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:20:08,022 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:08,022 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:08,022 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:20:08,027 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:20:08,030 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:08,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:08,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:08,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:08,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:08,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:08,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:08,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:08,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:08,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:08,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:08,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:08,075 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:08,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:08,098 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:20:08,135 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:20:08,139 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 69 states, but on-demand construction may add more states 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:20:08,240 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 69 states, but on-demand construction may add more states. 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 155 states and 359 transitions. Complement of second has 6 states. [2025-04-26 16:20:08,242 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:20:08,245 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:20:08,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2025-04-26 16:20:08,250 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:20:08,250 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:08,250 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:20:08,251 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:08,251 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:20:08,251 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:08,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 359 transitions. [2025-04-26 16:20:08,256 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2025-04-26 16:20:08,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 92 states and 214 transitions. [2025-04-26 16:20:08,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2025-04-26 16:20:08,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2025-04-26 16:20:08,260 INFO L74 IsDeterministic]: Start isDeterministic. Operand 92 states and 214 transitions. [2025-04-26 16:20:08,261 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:08,261 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 214 transitions. [2025-04-26 16:20:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 214 transitions. [2025-04-26 16:20:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2025-04-26 16:20:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 2.3333333333333335) internal successors, (in total 182), 77 states have internal predecessors, (182), 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:20:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 182 transitions. [2025-04-26 16:20:08,297 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 182 transitions. [2025-04-26 16:20:08,297 INFO L438 stractBuchiCegarLoop]: Abstraction has 78 states and 182 transitions. [2025-04-26 16:20:08,297 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:20:08,297 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 182 transitions. [2025-04-26 16:20:08,301 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2025-04-26 16:20:08,301 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:08,301 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:08,301 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:20:08,301 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:20:08,302 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]" "[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:20:08,302 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:20:08,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:08,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1799698751, now seen corresponding path program 1 times [2025-04-26 16:20:08,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:08,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219514356] [2025-04-26 16:20:08,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:08,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:08,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:08,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:08,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:08,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:08,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:08,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:08,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:08,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:08,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:08,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:08,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:08,311 INFO L85 PathProgramCache]: Analyzing trace with hash 75534, now seen corresponding path program 1 times [2025-04-26 16:20:08,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:08,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889790980] [2025-04-26 16:20:08,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:08,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:08,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:08,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:08,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:08,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:08,313 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:08,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:08,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:08,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:08,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:08,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:08,316 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:08,316 INFO L85 PathProgramCache]: Analyzing trace with hash 748780816, now seen corresponding path program 1 times [2025-04-26 16:20:08,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:08,316 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520644552] [2025-04-26 16:20:08,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:08,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:08,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:08,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:08,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:08,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:08,321 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:08,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:08,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:08,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:08,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:08,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:08,346 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:08,346 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:08,346 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:08,346 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:08,346 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:08,346 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:08,346 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:08,346 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:08,346 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_mult.bpl_petrified1_Iteration2_Loop [2025-04-26 16:20:08,346 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:08,346 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:08,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:08,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:08,373 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:08,373 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:08,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:08,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:08,375 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:20:08,377 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:20:08,378 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:08,378 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:08,391 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:20:08,391 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:20:08,397 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:20:08,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:08,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:08,400 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:20:08,402 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:20:08,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:08,403 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:08,419 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:20:08,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:08,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:08,421 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:20:08,421 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:20:08,422 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:08,422 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:08,488 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:08,494 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 16:20:08,495 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:08,495 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:08,495 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:08,495 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:08,495 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:08,495 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:08,495 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:08,495 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:08,495 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_mult.bpl_petrified1_Iteration2_Loop [2025-04-26 16:20:08,496 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:08,496 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:08,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:08,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:08,533 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:08,533 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:08,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:08,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:08,535 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:20:08,536 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:20:08,537 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:20:08,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:08,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:08,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:08,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:08,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:08,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:08,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:08,550 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:08,556 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:20:08,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:08,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:08,558 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:20:08,559 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:20:08,560 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:20:08,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:08,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:08,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:08,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:08,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:08,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:08,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:08,573 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:08,577 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:20:08,577 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:20:08,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:08,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:08,579 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:20:08,580 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:20:08,581 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:08,584 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:20:08,585 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:08,585 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:08,585 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:20:08,590 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:20:08,591 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:08,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:08,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:08,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:08,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:08,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:08,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:08,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:08,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:08,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:08,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:08,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:08,621 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:08,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:08,637 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:20:08,638 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:20:08,638 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 182 transitions. cyclomatic complexity: 116 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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:20:08,665 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 182 transitions. cyclomatic complexity: 116. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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 171 states and 420 transitions. Complement of second has 6 states. [2025-04-26 16:20:08,667 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:20:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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:20:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-26 16:20:08,668 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:20:08,668 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:08,669 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 16:20:08,669 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:08,669 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 6 letters. Loop has 6 letters. [2025-04-26 16:20:08,669 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:08,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 420 transitions. [2025-04-26 16:20:08,672 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:20:08,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 0 states and 0 transitions. [2025-04-26 16:20:08,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:20:08,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:20:08,672 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:20:08,672 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:20:08,672 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:08,672 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:08,672 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:08,672 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:20:08,672 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:20:08,672 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:20:08,672 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:20:08,677 INFO L201 PluginConnector]: Adding new model concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:20:08 BoogieIcfgContainer [2025-04-26 16:20:08,677 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:20:08,678 INFO L158 Benchmark]: Toolchain (without parser) took 1465.15ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 86.7MB in the beginning and 75.6MB in the end (delta: 11.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:08,678 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:08,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.52ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 84.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:08,678 INFO L158 Benchmark]: Boogie Preprocessor took 19.67ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 83.8MB in the end (delta: 907.2kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:20:08,678 INFO L158 Benchmark]: RCFGBuilder took 128.08ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 75.2MB in the end (delta: 8.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:20:08,679 INFO L158 Benchmark]: BuchiAutomizer took 1281.28ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 75.2MB in the beginning and 75.6MB in the end (delta: -419.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:08,679 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.19ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.52ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 84.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 19.67ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 83.8MB in the end (delta: 907.2kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 128.08ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 75.2MB in the end (delta: 8.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 1281.28ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 75.2MB in the beginning and 75.6MB in the end (delta: -419.0kB). 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.1s 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, 14 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, 72 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 56 mSDtfsCounter, 30 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: 41ms 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.0s InitialAbstraction: - 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 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:20:08,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...