/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/POPL2023/min-max-sample-with_locks.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:36:27,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:36:27,788 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:36:27,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:36:27,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:36:27,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:36:27,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:36:27,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:36:27,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:36:27,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:36:27,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:36:27,830 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:36:27,830 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:36:27,831 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:36:27,831 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:36:27,831 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:36:27,831 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:36:27,832 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:36:27,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:36:27,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:36:27,832 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:36:27,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:36:27,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:36:27,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:36:27,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:36:27,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:36:27,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:36:27,834 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:36:27,834 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:36:27,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:36:27,835 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:36:27,835 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:36:27,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:36:27,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:36:27,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:36:27,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:36:27,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:36:27,836 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:36:27,836 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:36:28,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:36:28,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:36:28,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:36:28,081 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:36:28,082 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:36:28,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-with_locks.bpl [2024-02-10 01:36:28,084 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-with_locks.bpl' [2024-02-10 01:36:28,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:36:28,124 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:36:28,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:36:28,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:36:28,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:36:28,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:28" (1/1) ... [2024-02-10 01:36:28,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:28" (1/1) ... [2024-02-10 01:36:28,174 INFO L138 Inliner]: procedures = 8, calls = 11, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 37 [2024-02-10 01:36:28,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:36:28,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:36:28,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:36:28,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:36:28,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:28" (1/1) ... [2024-02-10 01:36:28,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:28" (1/1) ... [2024-02-10 01:36:28,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:28" (1/1) ... [2024-02-10 01:36:28,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:28" (1/1) ... [2024-02-10 01:36:28,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:28" (1/1) ... [2024-02-10 01:36:28,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:28" (1/1) ... [2024-02-10 01:36:28,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:28" (1/1) ... [2024-02-10 01:36:28,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:28" (1/1) ... [2024-02-10 01:36:28,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:36:28,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:36:28,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:36:28,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:36:28,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:28" (1/1) ... [2024-02-10 01:36:28,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:28,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:36:28,227 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:36:28,252 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:36:28,269 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2024-02-10 01:36:28,269 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2024-02-10 01:36:28,269 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2024-02-10 01:36:28,270 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:36:28,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:36:28,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:36:28,271 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2024-02-10 01:36:28,271 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2024-02-10 01:36:28,271 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2024-02-10 01:36:28,271 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2024-02-10 01:36:28,271 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2024-02-10 01:36:28,271 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2024-02-10 01:36:28,272 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:36:28,318 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:36:28,319 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:36:28,399 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:36:28,408 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:36:28,409 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2024-02-10 01:36:28,410 INFO L201 PluginConnector]: Adding new model min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:36:28 BoogieIcfgContainer [2024-02-10 01:36:28,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:36:28,411 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:36:28,411 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:36:28,414 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:36:28,414 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:36:28,414 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:28" (1/2) ... [2024-02-10 01:36:28,415 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70487c73 and model type min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:36:28, skipping insertion in model container [2024-02-10 01:36:28,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:36:28,416 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:36:28" (2/2) ... [2024-02-10 01:36:28,416 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample-with_locks.bpl [2024-02-10 01:36:28,469 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 01:36:28,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 44 transitions, 106 flow [2024-02-10 01:36:28,505 INFO L124 PetriNetUnfolderBase]: 3/38 cut-off events. [2024-02-10 01:36:28,505 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 01:36:28,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 38 events. 3/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 92 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-02-10 01:36:28,509 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 44 transitions, 106 flow [2024-02-10 01:36:28,513 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 38 transitions, 91 flow [2024-02-10 01:36:28,518 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:36:28,518 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:36:28,518 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:36:28,518 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:36:28,518 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:36:28,518 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:36:28,518 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:36:28,518 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:36:28,518 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:36:28,519 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 45 places, 38 transitions, 91 flow [2024-02-10 01:36:28,590 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1251 states, 1249 states have (on average 2.963170536429143) internal successors, (3701), 1250 states have internal predecessors, (3701), 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:36:28,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1251 states, 1249 states have (on average 2.963170536429143) internal successors, (3701), 1250 states have internal predecessors, (3701), 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:36:28,666 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 1206 [2024-02-10 01:36:28,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:36:28,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:36:28,670 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:36:28,670 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:36:28,670 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 45 places, 38 transitions, 91 flow [2024-02-10 01:36:28,691 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1251 states, 1249 states have (on average 2.963170536429143) internal successors, (3701), 1250 states have internal predecessors, (3701), 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:36:28,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1251 states, 1249 states have (on average 2.963170536429143) internal successors, (3701), 1250 states have internal predecessors, (3701), 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:36:28,714 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 1206 [2024-02-10 01:36:28,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:36:28,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:36:28,723 INFO L748 eck$LassoCheckResult]: Stem: Black: 2555#[$Ultimate##0]don't care [135] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0] 2558#[L74, $Ultimate##0]don't care [138] L74-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 2560#[$Ultimate##0, L75, $Ultimate##0]don't care [141] L75-->L60: Formula: (and (= v_sampleThread1of1ForFork2_thidvar0_2 3) (= v_sampleThread1of1ForFork2_thidvar2_2 3) (= v_sampleThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{sampleThread1of1ForFork2_thidvar0=v_sampleThread1of1ForFork2_thidvar0_2, sampleThread1of1ForFork2_thidvar2=v_sampleThread1of1ForFork2_thidvar2_2, sampleThread1of1ForFork2_thidvar1=v_sampleThread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[sampleThread1of1ForFork2_thidvar0, sampleThread1of1ForFork2_thidvar2, sampleThread1of1ForFork2_thidvar1] 2568#[L76, $Ultimate##0, $Ultimate##0, L60]don't care [2024-02-10 01:36:28,723 INFO L750 eck$LassoCheckResult]: Loop: 2568#[L76, $Ultimate##0, $Ultimate##0, L60]don't care [114] L60-->L86: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2584#[L86, $Ultimate##0, L76, $Ultimate##0]don't care [115] L86-->L86-1: Formula: (and (not v_min_lock_12) v_min_lock_11) InVars {min_lock=v_min_lock_12} OutVars{min_lock=v_min_lock_11} AuxVars[] AssignedVars[min_lock] 2616#[$Ultimate##0, L86-1, L76, $Ultimate##0]don't care [116] L86-1-->L94: Formula: (= v_min_samples_1 (store v_min_samples_2 (+ (- 1) v_i1_1) v_array_min_3)) InVars {min_samples=v_min_samples_2, i1=v_i1_1, array_min=v_array_min_3} OutVars{min_samples=v_min_samples_1, i1=v_i1_1, array_min=v_array_min_3} AuxVars[] AssignedVars[min_samples] 2668#[$Ultimate##0, L94, L76, $Ultimate##0]don't care [117] L94-->L91: Formula: (not v_min_lock_1) InVars {} OutVars{min_lock=v_min_lock_1} AuxVars[] AssignedVars[min_lock] 2744#[$Ultimate##0, L91, L76, $Ultimate##0]don't care [118] L91-->L100: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2852#[L100, $Ultimate##0, L76, $Ultimate##0]don't care [119] L100-->L100-1: Formula: (and v_max_lock_11 (not v_max_lock_12)) InVars {max_lock=v_max_lock_12} OutVars{max_lock=v_max_lock_11} AuxVars[] AssignedVars[max_lock] 2994#[$Ultimate##0, L100-1, L76, $Ultimate##0]don't care [120] L100-1-->L108: Formula: (= (store v_max_samples_2 (+ (- 1) v_i2_7) v_array_max_6) v_max_samples_1) InVars {i2=v_i2_7, array_max=v_array_max_6, max_samples=v_max_samples_2} OutVars{i2=v_i2_7, array_max=v_array_max_6, max_samples=v_max_samples_1} AuxVars[] AssignedVars[max_samples] 3164#[$Ultimate##0, L108, L76, $Ultimate##0]don't care [121] L108-->L105: Formula: (not v_max_lock_6) InVars {} OutVars{max_lock=v_max_lock_6} AuxVars[] AssignedVars[max_lock] 3362#[L105, $Ultimate##0, L76, $Ultimate##0]don't care [122] L105-->L60: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2568#[L76, $Ultimate##0, $Ultimate##0, L60]don't care [2024-02-10 01:36:28,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:28,730 INFO L85 PathProgramCache]: Analyzing trace with hash 163945, now seen corresponding path program 1 times [2024-02-10 01:36:28,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:28,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351164334] [2024-02-10 01:36:28,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:28,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:28,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:28,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:28,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:28,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1805295893, now seen corresponding path program 1 times [2024-02-10 01:36:28,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:28,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637430864] [2024-02-10 01:36:28,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:28,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:28,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:28,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:28,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:28,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1144919469, now seen corresponding path program 1 times [2024-02-10 01:36:28,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:28,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069978353] [2024-02-10 01:36:28,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:28,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:28,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:28,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:29,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:29,048 INFO L201 PluginConnector]: Adding new model min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:36:29 BoogieIcfgContainer [2024-02-10 01:36:29,048 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:36:29,050 INFO L158 Benchmark]: Toolchain (without parser) took 924.83ms. Allocated memory was 203.4MB in the beginning and 353.4MB in the end (delta: 149.9MB). Free memory was 157.2MB in the beginning and 313.9MB in the end (delta: -156.7MB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:36:29,050 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.64ms. Allocated memory is still 203.4MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:36:29,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.54ms. Allocated memory is still 203.4MB. Free memory was 157.2MB in the beginning and 178.6MB in the end (delta: -21.4MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2024-02-10 01:36:29,051 INFO L158 Benchmark]: Boogie Preprocessor took 22.51ms. Allocated memory is still 203.4MB. Free memory was 178.6MB in the beginning and 177.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:36:29,051 INFO L158 Benchmark]: RCFGBuilder took 209.48ms. Allocated memory is still 203.4MB. Free memory was 177.3MB in the beginning and 167.2MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-10 01:36:29,052 INFO L158 Benchmark]: BuchiAutomizer took 637.29ms. Allocated memory was 203.4MB in the beginning and 353.4MB in the end (delta: 149.9MB). Free memory was 167.0MB in the beginning and 313.9MB in the end (delta: -146.8MB). Peak memory consumption was 3.3MB. Max. memory is 8.0GB. [2024-02-10 01:36:29,056 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.64ms. Allocated memory is still 203.4MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.54ms. Allocated memory is still 203.4MB. Free memory was 157.2MB in the beginning and 178.6MB in the end (delta: -21.4MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.51ms. Allocated memory is still 203.4MB. Free memory was 178.6MB in the beginning and 177.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 209.48ms. Allocated memory is still 203.4MB. Free memory was 177.3MB in the beginning and 167.2MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 637.29ms. Allocated memory was 203.4MB in the beginning and 353.4MB in the end (delta: 149.9MB). Free memory was 167.0MB in the beginning and 313.9MB in the end (delta: -146.8MB). Peak memory consumption was 3.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Trivial decomposition into one nonterminating module. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.5s and 1 iterations. TraceHistogramMax:0. Analysis of lassos took 0.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 60]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L74] FORK 0 fork 1 computeMin(); [L75] FORK 0 fork 2, 2 computeMax(); [L76] FORK 0 fork 3, 3, 3 sample(); Loop: [L61] CALL call lock_min(); [L87] assume !min_lock; [L88] min_lock := true; [L61] RET call lock_min(); [L62] min_samples[i1 - 1] := array_min; [L63] CALL call release_min(); [L94] min_lock := false; [L63] RET call release_min(); [L65] CALL call lock_max(); [L101] assume !max_lock; [L102] max_lock := true; [L65] RET call lock_max(); [L66] max_samples[i2 - 1] := array_max; [L67] CALL call release_max(); [L108] max_lock := false; [L67] RET call release_max(); End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 60]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L74] FORK 0 fork 1 computeMin(); [L75] FORK 0 fork 2, 2 computeMax(); [L76] FORK 0 fork 3, 3, 3 sample(); Loop: [L61] CALL call lock_min(); [L87] assume !min_lock; [L88] min_lock := true; [L61] RET call lock_min(); [L62] min_samples[i1 - 1] := array_min; [L63] CALL call release_min(); [L94] min_lock := false; [L63] RET call release_min(); [L65] CALL call lock_max(); [L101] assume !max_lock; [L102] max_lock := true; [L65] RET call lock_max(); [L66] max_samples[i2 - 1] := array_max; [L67] CALL call release_max(); [L108] max_lock := false; [L67] RET call release_max(); End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-10 01:36:29,078 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...