/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/concurrent_mult.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:32:26,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:32:26,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 01:32:26,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:32:26,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:32:26,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:32:26,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:32:26,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:32:26,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:32:26,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:32:26,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:32:26,341 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:32:26,342 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:32:26,342 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:32:26,342 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:32:26,342 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:32:26,343 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:32:26,343 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:32:26,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:32:26,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:32:26,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:32:26,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:32:26,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:32:26,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:32:26,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:32:26,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:32:26,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:32:26,353 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:32:26,354 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:32:26,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:32:26,379 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:32:26,380 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:32:26,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:32:26,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:32:26,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:32:26,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:32:26,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:32:26,381 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:32:26,381 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 01:32:26,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:32:26,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:32:26,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:32:26,787 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:32:26,789 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:32:26,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/concurrent_mult.bpl [2024-02-10 01:32:26,791 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/concurrent_mult.bpl' [2024-02-10 01:32:26,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:32:26,809 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:32:26,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:32:26,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:32:26,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:32:26,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:26" (1/1) ... [2024-02-10 01:32:26,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:26" (1/1) ... [2024-02-10 01:32:26,828 INFO L138 Inliner]: procedures = 2, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:32:26,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:32:26,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:32:26,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:32:26,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:32:26,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:26" (1/1) ... [2024-02-10 01:32:26,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:26" (1/1) ... [2024-02-10 01:32:26,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:26" (1/1) ... [2024-02-10 01:32:26,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:26" (1/1) ... [2024-02-10 01:32:26,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:26" (1/1) ... [2024-02-10 01:32:26,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:26" (1/1) ... [2024-02-10 01:32:26,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:26" (1/1) ... [2024-02-10 01:32:26,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:26" (1/1) ... [2024-02-10 01:32:26,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:32:26,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:32:26,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:32:26,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:32:26,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:26" (1/1) ... [2024-02-10 01:32:26,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:26,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:26,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:26,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 01:32:26,986 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mult given in one single declaration [2024-02-10 01:32:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2024-02-10 01:32:26,987 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2024-02-10 01:32:26,988 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:32:26,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:32:26,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:32:26,989 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:32:27,029 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:32:27,032 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:32:27,113 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:32:27,125 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:32:27,125 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 01:32:27,127 INFO L201 PluginConnector]: Adding new model concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:32:27 BoogieIcfgContainer [2024-02-10 01:32:27,127 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:32:27,129 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:32:27,129 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:32:27,132 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:32:27,133 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:32:27,133 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:26" (1/2) ... [2024-02-10 01:32:27,134 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@272610a1 and model type concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:32:27, skipping insertion in model container [2024-02-10 01:32:27,135 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:32:27,135 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:32:27" (2/2) ... [2024-02-10 01:32:27,136 INFO L332 chiAutomizerObserver]: Analyzing ICFG concurrent_mult.bpl [2024-02-10 01:32:27,195 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 01:32:27,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 68 flow [2024-02-10 01:32:27,232 INFO L124 PetriNetUnfolderBase]: 2/23 cut-off events. [2024-02-10 01:32:27,232 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 01:32:27,236 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. [2024-02-10 01:32:27,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 68 flow [2024-02-10 01:32:27,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 58 flow [2024-02-10 01:32:27,244 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:32:27,244 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:32:27,244 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:32:27,244 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:32:27,244 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:32:27,244 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:32:27,244 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:32:27,245 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:32:27,245 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:32:27,245 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 28 places, 23 transitions, 58 flow [2024-02-10 01:32:27,259 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 70 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 69 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:27,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 70 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 69 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:27,285 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 39 [2024-02-10 01:32:27,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:32:27,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:32:27,288 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:32:27,288 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:32:27,288 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 28 places, 23 transitions, 58 flow [2024-02-10 01:32:27,294 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 70 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 69 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:27,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 70 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 69 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:27,297 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 39 [2024-02-10 01:32:27,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:32:27,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:32:27,301 INFO L748 eck$LassoCheckResult]: Stem: Black: 175#[$Ultimate##0]don't care [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[] 178#[L17]don't care [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[] 180#[L19]don't care [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] 182#[L19-1, $Ultimate##0]don't care [36] $Ultimate##0-->L31: Formula: (= v_multThread1of1ForFork0_z_1 0) InVars {} OutVars{multThread1of1ForFork0_z=v_multThread1of1ForFork0_z_1} AuxVars[] AssignedVars[multThread1of1ForFork0_z] 184#[L31, L19-1]don't care [37] L31-->L32-1: Formula: (= v_multThread1of1ForFork0_i_1 0) InVars {} OutVars{multThread1of1ForFork0_i=v_multThread1of1ForFork0_i_1} AuxVars[] AssignedVars[multThread1of1ForFork0_i] 188#[L32-1, L19-1]don't care [2024-02-10 01:32:27,301 INFO L750 eck$LassoCheckResult]: Loop: 188#[L32-1, L19-1]don't care [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[] 196#[L19-1, L33]don't care [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] 208#[L19-1, L34]don't care [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] 188#[L32-1, L19-1]don't care [2024-02-10 01:32:27,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:27,305 INFO L85 PathProgramCache]: Analyzing trace with hash 58054202, now seen corresponding path program 1 times [2024-02-10 01:32:27,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:27,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385061857] [2024-02-10 01:32:27,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:27,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:27,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:27,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:27,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:27,390 INFO L85 PathProgramCache]: Analyzing trace with hash 68583, now seen corresponding path program 1 times [2024-02-10 01:32:27,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:27,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66934271] [2024-02-10 01:32:27,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:27,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:27,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:27,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:27,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:27,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1379049714, now seen corresponding path program 1 times [2024-02-10 01:32:27,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:27,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962679184] [2024-02-10 01:32:27,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:27,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:27,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:27,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:27,506 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:32:27,508 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:32:27,508 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:32:27,508 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:32:27,508 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-10 01:32:27,508 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:27,508 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:32:27,509 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:32:27,509 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_mult.bpl_BEv2_Iteration1_Loop [2024-02-10 01:32:27,509 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:32:27,509 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:32:27,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:27,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:27,580 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:32:27,581 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-10 01:32:27,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:27,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:27,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:27,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-10 01:32:27,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:32:27,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:32:27,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-10 01:32:27,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:27,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:27,613 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:27,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-10 01:32:27,614 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 01:32:27,615 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:32:27,751 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-10 01:32:27,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-10 01:32:27,756 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:32:27,756 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:32:27,757 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:32:27,757 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:32:27,757 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:32:27,757 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:27,757 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:32:27,757 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:32:27,757 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_mult.bpl_BEv2_Iteration1_Loop [2024-02-10 01:32:27,757 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:32:27,757 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:32:27,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:27,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:27,798 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:32:27,802 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:32:27,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:27,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:27,813 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:27,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-10 01:32:27,818 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 [2024-02-10 01:32:27,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:27,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:32:27,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:27,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:27,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:27,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:32:27,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:32:27,835 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:32:27,846 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:32:27,847 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:32:27,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:27,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:27,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:27,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-10 01:32:27,852 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:32:27,852 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-10 01:32:27,852 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:32:27,853 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(multThread1of1ForFork0_i, multThread1of1ForFork0_a) = -1*multThread1of1ForFork0_i + 1*multThread1of1ForFork0_a Supporting invariants [] [2024-02-10 01:32:27,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-10 01:32:27,859 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:32:27,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:32:27,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:32:27,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:32:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:32:27,912 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:32:27,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:32:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:32:27,968 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 [2024-02-10 01:32:27,969 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:28,064 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 335 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:32:28,065 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:32:28,066 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:32:28,071 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:32:28,071 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:32:28,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:32:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2024-02-10 01:32:28,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 129 transitions. Stem has 5 letters. Loop has 3 letters. [2024-02-10 01:32:28,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:28,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 129 transitions. Stem has 8 letters. Loop has 3 letters. [2024-02-10 01:32:28,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:28,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 129 transitions. Stem has 5 letters. Loop has 6 letters. [2024-02-10 01:32:28,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:28,099 INFO L428 stractBuchiCegarLoop]: Abstraction has has 46 places, 566 transitions, 2546 flow [2024-02-10 01:32:28,099 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:32:28,099 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:32:28,099 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 46 places, 566 transitions, 2546 flow [2024-02-10 01:32:28,121 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 209 states, 199 states have (on average 2.562814070351759) internal successors, (510), 208 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:28,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 209 states, 199 states have (on average 2.562814070351759) internal successors, (510), 208 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:28,160 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 48 [2024-02-10 01:32:28,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:32:28,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:32:28,162 INFO L748 eck$LassoCheckResult]: Stem: Black: 374#[$Ultimate##0]don't care [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[] Black: 377#[L17]don't care [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[] 385#[L19]don't care [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] Black: 395#[$Ultimate##0, L19-1]don't care [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] 406#[$Ultimate##0, $Ultimate##0, L20]don't care [43] $Ultimate##0-->L31: Formula: (= v_multThread1of1ForFork1_z_1 0) InVars {} OutVars{multThread1of1ForFork1_z=v_multThread1of1ForFork1_z_1} AuxVars[] AssignedVars[multThread1of1ForFork1_z] Black: 430#[$Ultimate##0, L31, L20]don't care [44] L31-->L32-1: Formula: (= v_multThread1of1ForFork1_i_1 0) InVars {} OutVars{multThread1of1ForFork1_i=v_multThread1of1ForFork1_i_1} AuxVars[] AssignedVars[multThread1of1ForFork1_i] 462#[$Ultimate##0, L20, L32-1]don't care [2024-02-10 01:32:28,162 INFO L750 eck$LassoCheckResult]: Loop: 462#[$Ultimate##0, L20, L32-1]don't care [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[] Black: 531#[L33, $Ultimate##0, L20]don't care [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] 604#[$Ultimate##0, L20, L34]don't care [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] Black: 464#[$Ultimate##0, L20, L32-1]don't care [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[] 526#[L33, $Ultimate##0, L20]don't care [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] Black: 606#[$Ultimate##0, L20, L34]don't care [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] 462#[$Ultimate##0, L20, L32-1]don't care [2024-02-10 01:32:28,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1799698751, now seen corresponding path program 1 times [2024-02-10 01:32:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:28,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063914546] [2024-02-10 01:32:28,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:28,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:28,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:28,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:28,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:28,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2044688159, now seen corresponding path program 1 times [2024-02-10 01:32:28,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:28,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378846428] [2024-02-10 01:32:28,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:28,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:28,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-02-10 01:32:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:28,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:28,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:28,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:28,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1130800225, now seen corresponding path program 1 times [2024-02-10 01:32:28,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:28,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766240694] [2024-02-10 01:32:28,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:28,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:28,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:28,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:28,297 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:32:28,297 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:32:28,297 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:32:28,297 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:32:28,297 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-10 01:32:28,297 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:28,297 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:32:28,297 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:32:28,298 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_mult.bpl_BEv2_Iteration2_Loop [2024-02-10 01:32:28,298 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:32:28,298 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:32:28,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:28,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:28,330 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:32:28,330 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-10 01:32:28,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:28,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:28,332 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:28,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-10 01:32:28,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:32:28,338 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:32:28,348 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 01:32:28,348 INFO L440 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: [] [2024-02-10 01:32:28,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-02-10 01:32:28,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:28,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:28,366 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:28,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-10 01:32:28,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:32:28,371 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:32:28,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-02-10 01:32:28,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:28,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:28,418 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:28,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-10 01:32:28,421 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 01:32:28,421 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:32:28,517 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-10 01:32:28,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-10 01:32:28,524 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:32:28,524 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:32:28,524 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:32:28,525 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:32:28,525 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:32:28,525 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:28,525 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:32:28,525 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:32:28,525 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_mult.bpl_BEv2_Iteration2_Loop [2024-02-10 01:32:28,525 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:32:28,525 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:32:28,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:28,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:28,558 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:32:28,558 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:32:28,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:28,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:28,568 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:28,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-10 01:32:28,623 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 [2024-02-10 01:32:28,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:28,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:32:28,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:28,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:28,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:28,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:32:28,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:32:28,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:32:28,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-10 01:32:28,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:28,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:28,648 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:28,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-10 01:32:28,652 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 [2024-02-10 01:32:28,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:28,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:32:28,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:28,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:28,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:28,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:32:28,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:32:28,688 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:32:28,692 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:32:28,692 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:32:28,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:28,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:28,693 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:28,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-10 01:32:28,696 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:32:28,697 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-10 01:32:28,697 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:32:28,697 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(multThread1of1ForFork1_a, multThread1of1ForFork1_i) = 1*multThread1of1ForFork1_a - 1*multThread1of1ForFork1_i Supporting invariants [] [2024-02-10 01:32:28,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-02-10 01:32:28,702 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:32:28,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:32:28,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:32:28,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:32:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:32:28,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 01:32:28,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:32:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:32:28,843 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 01:32:28,843 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:28,949 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8 states and 310 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:32:28,949 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:32:28,949 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:32:29,095 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:32:29,096 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:32:29,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:32:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-02-10 01:32:29,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 6 letters. Loop has 6 letters. [2024-02-10 01:32:29,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:29,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 12 letters. Loop has 6 letters. [2024-02-10 01:32:29,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:29,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 6 letters. Loop has 12 letters. [2024-02-10 01:32:29,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:29,115 INFO L428 stractBuchiCegarLoop]: Abstraction has has 62 places, 12856 transitions, 83124 flow [2024-02-10 01:32:29,115 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:32:29,115 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:32:29,115 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 62 places, 12856 transitions, 83124 flow [2024-02-10 01:32:29,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-02-10 01:32:30,301 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 787 states, 718 states have (on average 3.396935933147632) internal successors, (2439), 786 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:30,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 787 states, 718 states have (on average 3.396935933147632) internal successors, (2439), 786 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:30,316 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-10 01:32:30,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-10 01:32:30,321 INFO L201 PluginConnector]: Adding new model concurrent_mult.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:32:30 BoogieIcfgContainer [2024-02-10 01:32:30,322 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:32:30,322 INFO L158 Benchmark]: Toolchain (without parser) took 3513.52ms. Allocated memory was 151.0MB in the beginning and 290.5MB in the end (delta: 139.5MB). Free memory was 108.6MB in the beginning and 155.1MB in the end (delta: -46.5MB). Peak memory consumption was 148.0MB. Max. memory is 8.0GB. [2024-02-10 01:32:30,322 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 151.0MB. Free memory was 109.7MB in the beginning and 109.7MB in the end (delta: 63.3kB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:32:30,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.76ms. Allocated memory is still 151.0MB. Free memory was 108.6MB in the beginning and 107.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:32:30,323 INFO L158 Benchmark]: Boogie Preprocessor took 54.51ms. Allocated memory is still 151.0MB. Free memory was 107.0MB in the beginning and 125.2MB in the end (delta: -18.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:32:30,323 INFO L158 Benchmark]: RCFGBuilder took 235.73ms. Allocated memory is still 151.0MB. Free memory was 125.2MB in the beginning and 116.4MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2024-02-10 01:32:30,324 INFO L158 Benchmark]: BuchiAutomizer took 3192.64ms. Allocated memory was 151.0MB in the beginning and 290.5MB in the end (delta: 139.5MB). Free memory was 116.2MB in the beginning and 155.1MB in the end (delta: -38.9MB). Peak memory consumption was 155.6MB. Max. memory is 8.0GB. [2024-02-10 01:32:30,326 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.10ms. Allocated memory is still 151.0MB. Free memory was 109.7MB in the beginning and 109.7MB in the end (delta: 63.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.76ms. Allocated memory is still 151.0MB. Free memory was 108.6MB in the beginning and 107.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.51ms. Allocated memory is still 151.0MB. Free memory was 107.0MB in the beginning and 125.2MB in the end (delta: -18.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 235.73ms. Allocated memory is still 151.0MB. Free memory was 125.2MB in the beginning and 116.4MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3192.64ms. Allocated memory was 151.0MB in the beginning and 290.5MB in the end (delta: 139.5MB). Free memory was 116.2MB in the beginning and 155.1MB in the end (delta: -38.9MB). Peak memory consumption was 155.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 5 locations. One deterministic module has affine ranking function -1 * i + a and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. 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: 3/3 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 144 mSDsluCounter, 240 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 126 mSDtfsCounter, 90 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp66 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 49ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-10 01:32:30,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...