/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-abs-2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:35:11,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:35:11,955 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:35:11,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:35:11,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:35:11,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:35:11,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:35:11,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:35:11,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:35:11,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:35:11,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:35:11,991 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:35:11,991 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:35:11,992 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:35:11,992 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:35:11,992 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:35:11,993 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:35:11,993 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:35:11,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:35:11,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:35:11,994 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:35:11,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:35:11,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:35:11,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:35:11,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:35:11,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:35:11,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:35:11,996 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:35:11,996 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:35:11,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:35:11,997 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:35:11,997 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:35:11,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:35:11,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:35:11,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:35:11,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:35:11,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:35:11,999 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:35:11,999 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:35:12,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:35:12,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:35:12,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:35:12,317 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:35:12,318 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:35:12,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-2.bpl [2024-02-10 01:35:12,319 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-2.bpl' [2024-02-10 01:35:12,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:35:12,376 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:35:12,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:35:12,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:35:12,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:35:12,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:12" (1/1) ... [2024-02-10 01:35:12,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:12" (1/1) ... [2024-02-10 01:35:12,426 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:35:12,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:35:12,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:35:12,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:35:12,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:35:12,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:12" (1/1) ... [2024-02-10 01:35:12,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:12" (1/1) ... [2024-02-10 01:35:12,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:12" (1/1) ... [2024-02-10 01:35:12,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:12" (1/1) ... [2024-02-10 01:35:12,459 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:12" (1/1) ... [2024-02-10 01:35:12,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:12" (1/1) ... [2024-02-10 01:35:12,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:12" (1/1) ... [2024-02-10 01:35:12,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:12" (1/1) ... [2024-02-10 01:35:12,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:35:12,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:35:12,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:35:12,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:35:12,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:12" (1/1) ... [2024-02-10 01:35:12,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:35:12,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:35:12,554 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:35:12,581 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:35:12,616 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2024-02-10 01:35:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2024-02-10 01:35:12,617 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2024-02-10 01:35:12,617 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:35:12,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:35:12,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:35:12,618 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2024-02-10 01:35:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2024-02-10 01:35:12,618 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2024-02-10 01:35:12,618 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2024-02-10 01:35:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2024-02-10 01:35:12,618 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2024-02-10 01:35:12,619 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2024-02-10 01:35:12,619 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2024-02-10 01:35:12,619 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2024-02-10 01:35:12,620 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:35:12,674 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:35:12,675 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:35:12,835 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:35:12,846 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:35:12,847 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2024-02-10 01:35:12,848 INFO L201 PluginConnector]: Adding new model min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:35:12 BoogieIcfgContainer [2024-02-10 01:35:12,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:35:12,849 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:35:12,849 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:35:12,857 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:35:12,858 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:35:12,858 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:12" (1/2) ... [2024-02-10 01:35:12,861 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45697ec9 and model type min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:35:12, skipping insertion in model container [2024-02-10 01:35:12,861 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:35:12,861 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:35:12" (2/2) ... [2024-02-10 01:35:12,863 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample-abs-2.bpl [2024-02-10 01:35:12,921 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-10 01:35:12,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 116 flow [2024-02-10 01:35:12,959 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2024-02-10 01:35:12,959 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-10 01:35:12,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 4/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 86 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-02-10 01:35:12,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 44 transitions, 116 flow [2024-02-10 01:35:12,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 96 flow [2024-02-10 01:35:12,972 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:35:12,972 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:35:12,972 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:35:12,972 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:35:12,972 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:35:12,972 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:35:12,972 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:35:12,972 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:35:12,972 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:35:12,973 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 45 places, 36 transitions, 96 flow [2024-02-10 01:35:13,078 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1632 states, 1630 states have (on average 3.9331288343558284) internal successors, (6411), 1631 states have internal predecessors, (6411), 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:35:13,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1632 states, 1630 states have (on average 3.9331288343558284) internal successors, (6411), 1631 states have internal predecessors, (6411), 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:35:13,249 INFO L131 ngComponentsAnalysis]: Automaton has 230 accepting balls. 1524 [2024-02-10 01:35:13,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:35:13,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:35:13,258 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:35:13,258 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:35:13,258 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 45 places, 36 transitions, 96 flow [2024-02-10 01:35:13,300 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1632 states, 1630 states have (on average 3.9331288343558284) internal successors, (6411), 1631 states have internal predecessors, (6411), 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:35:13,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1632 states, 1630 states have (on average 3.9331288343558284) internal successors, (6411), 1631 states have internal predecessors, (6411), 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:35:13,333 INFO L131 ngComponentsAnalysis]: Automaton has 230 accepting balls. 1524 [2024-02-10 01:35:13,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:35:13,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:35:13,340 INFO L748 eck$LassoCheckResult]: Stem: Black: 3318#[$Ultimate##0]don't care [82] $Ultimate##0-->L85: Formula: (and (<= 0 v_ULTIMATE.start_m_3) (< v_ULTIMATE.start_m_3 v_N_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} AuxVars[] AssignedVars[] 3321#[L85]don't care [113] L85-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 3323#[$Ultimate##0, L85-1]don't care [116] L85-1-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_14, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 3325#[L86, $Ultimate##0, $Ultimate##0]don't care [119] L86-->L70: Formula: (and (= v_sampleThread1of1ForFork2_thidvar0_2 3) (= v_sampleThread1of1ForFork2_thidvar2_2 3) (= v_sampleThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_4, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_6, sampleThread1of1ForFork2_thidvar0=v_sampleThread1of1ForFork2_thidvar0_2, sampleThread1of1ForFork2_thidvar2=v_sampleThread1of1ForFork2_thidvar2_2, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_6, sampleThread1of1ForFork2_thidvar1=v_sampleThread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_min_l, sampleThread1of1ForFork2_thidvar0, sampleThread1of1ForFork2_thidvar2, sampleThread1of1ForFork2_max_l, sampleThread1of1ForFork2_thidvar1] 3329#[L87, L70, $Ultimate##0, $Ultimate##0]don't care [2024-02-10 01:35:13,341 INFO L750 eck$LassoCheckResult]: Loop: 3329#[L87, L70, $Ultimate##0, $Ultimate##0]don't care [95] L70-->L72: Formula: (= v_array_min_3 v_sampleThread1of1ForFork2_min_l_1) InVars {array_min=v_array_min_3} OutVars{array_min=v_array_min_3, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_1} AuxVars[] AssignedVars[sampleThread1of1ForFork2_min_l] 3339#[L72, L87, $Ultimate##0, $Ultimate##0]don't care [96] L72-->L74: Formula: (= v_array_max_6 v_sampleThread1of1ForFork2_max_l_1) InVars {array_max=v_array_max_6} OutVars{array_max=v_array_max_6, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_1} AuxVars[] AssignedVars[sampleThread1of1ForFork2_max_l] 3363#[L74, L87, $Ultimate##0, $Ultimate##0]don't care [97] L74-->L70: Formula: (= (+ v_sampleThread1of1ForFork2_diff_1 v_sampleThread1of1ForFork2_min_l_3) v_sampleThread1of1ForFork2_max_l_3) InVars {sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_3, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_3} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_1, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_3, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_3} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff] 3329#[L87, L70, $Ultimate##0, $Ultimate##0]don't care [2024-02-10 01:35:13,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:35:13,350 INFO L85 PathProgramCache]: Analyzing trace with hash 3478691, now seen corresponding path program 1 times [2024-02-10 01:35:13,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:35:13,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913861901] [2024-02-10 01:35:13,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:35:13,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:35:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:13,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:35:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:13,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:35:13,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:35:13,463 INFO L85 PathProgramCache]: Analyzing trace with hash 124159, now seen corresponding path program 1 times [2024-02-10 01:35:13,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:35:13,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377605254] [2024-02-10 01:35:13,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:35:13,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:35:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:13,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:35:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:13,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:35:13,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:35:13,473 INFO L85 PathProgramCache]: Analyzing trace with hash 554562845, now seen corresponding path program 1 times [2024-02-10 01:35:13,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:35:13,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108321100] [2024-02-10 01:35:13,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:35:13,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:35:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:13,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:35:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:13,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:35:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:13,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:35:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:13,782 INFO L201 PluginConnector]: Adding new model min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:35:13 BoogieIcfgContainer [2024-02-10 01:35:13,783 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:35:13,784 INFO L158 Benchmark]: Toolchain (without parser) took 1407.51ms. Allocated memory was 185.6MB in the beginning and 239.1MB in the end (delta: 53.5MB). Free memory was 152.7MB in the beginning and 157.1MB in the end (delta: -4.4MB). Peak memory consumption was 47.5MB. Max. memory is 8.0GB. [2024-02-10 01:35:13,785 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 185.6MB. Free memory was 153.9MB in the beginning and 153.8MB in the end (delta: 63.7kB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:35:13,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.86ms. Allocated memory is still 185.6MB. Free memory was 152.6MB in the beginning and 151.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:35:13,786 INFO L158 Benchmark]: Boogie Preprocessor took 50.32ms. Allocated memory is still 185.6MB. Free memory was 151.0MB in the beginning and 159.9MB in the end (delta: -8.9MB). Peak memory consumption was 3.9MB. Max. memory is 8.0GB. [2024-02-10 01:35:13,786 INFO L158 Benchmark]: RCFGBuilder took 367.09ms. Allocated memory is still 185.6MB. Free memory was 159.8MB in the beginning and 149.5MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 01:35:13,787 INFO L158 Benchmark]: BuchiAutomizer took 933.42ms. Allocated memory was 185.6MB in the beginning and 239.1MB in the end (delta: 53.5MB). Free memory was 149.3MB in the beginning and 157.1MB in the end (delta: -7.7MB). Peak memory consumption was 45.7MB. Max. memory is 8.0GB. [2024-02-10 01:35:13,789 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.11ms. Allocated memory is still 185.6MB. Free memory was 153.9MB in the beginning and 153.8MB in the end (delta: 63.7kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.86ms. Allocated memory is still 185.6MB. Free memory was 152.6MB in the beginning and 151.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.32ms. Allocated memory is still 185.6MB. Free memory was 151.0MB in the beginning and 159.9MB in the end (delta: -8.9MB). Peak memory consumption was 3.9MB. Max. memory is 8.0GB. * RCFGBuilder took 367.09ms. Allocated memory is still 185.6MB. Free memory was 159.8MB in the beginning and 149.5MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 933.42ms. Allocated memory was 185.6MB in the beginning and 239.1MB in the end (delta: 53.5MB). Free memory was 149.3MB in the beginning and 157.1MB in the end (delta: -7.7MB). Peak memory consumption was 45.7MB. 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.8s and 1 iterations. TraceHistogramMax:0. Analysis of lassos took 0.4s. 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: 70]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L83] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L85] FORK 0 fork 1 computeMin(); VAL [N=1, m=0] [L86] FORK 0 fork 2, 2 computeMax(); VAL [N=1, m=0] [L87] FORK 0 fork 3, 3, 3 sample(); VAL [N=1, m=0] Loop: [L71] min_l := array_min; [L72] max_l := array_max; [L74] diff := max_l - min_l; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 70]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L83] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L85] FORK 0 fork 1 computeMin(); VAL [N=1, m=0] [L86] FORK 0 fork 2, 2 computeMax(); VAL [N=1, m=0] [L87] FORK 0 fork 3, 3, 3 sample(); VAL [N=1, m=0] Loop: [L71] min_l := array_min; [L72] max_l := array_max; [L74] diff := max_l - min_l; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-10 01:35:13,844 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...