/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:24,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:24,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:21:24,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:24,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:24,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:24,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:24,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:24,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:24,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:24,751 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:24,751 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:24,751 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:24,751 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:24,751 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:24,751 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:24,751 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:24,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:24,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:24,751 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:24,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:24,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:24,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:24,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:24,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:24,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:24,752 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:24,752 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:24,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:24,752 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:24,752 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:24,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:24,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:24,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:24,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:24,754 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:24,754 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:24,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:24,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:24,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:24,994 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:24,994 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:24,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-2.bpl [2025-04-26 16:21:24,995 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-2.bpl' [2025-04-26 16:21:25,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:25,014 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:25,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:25,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:25,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:25,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:25" (1/1) ... [2025-04-26 16:21:25,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:25" (1/1) ... [2025-04-26 16:21:25,051 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:21:25,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:25,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:25,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:25,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:25,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:25" (1/1) ... [2025-04-26 16:21:25,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:25" (1/1) ... [2025-04-26 16:21:25,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:25" (1/1) ... [2025-04-26 16:21:25,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:25" (1/1) ... [2025-04-26 16:21:25,060 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:25" (1/1) ... [2025-04-26 16:21:25,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:25" (1/1) ... [2025-04-26 16:21:25,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:25" (1/1) ... [2025-04-26 16:21:25,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:25" (1/1) ... [2025-04-26 16:21:25,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:25" (1/1) ... [2025-04-26 16:21:25,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:25,071 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:25,071 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:25,071 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:25,072 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:25" (1/1) ... [2025-04-26 16:21:25,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:25,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:25,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:25,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:21:25,124 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2025-04-26 16:21:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2025-04-26 16:21:25,124 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2025-04-26 16:21:25,124 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:25,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:25,125 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2025-04-26 16:21:25,125 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2025-04-26 16:21:25,125 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2025-04-26 16:21:25,125 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2025-04-26 16:21:25,125 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2025-04-26 16:21:25,125 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2025-04-26 16:21:25,125 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:21:25,160 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:25,161 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:25,233 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:25,233 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:25,240 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:25,240 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 16:21:25,241 INFO L201 PluginConnector]: Adding new model min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:25 BoogieIcfgContainer [2025-04-26 16:21:25,241 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:25,241 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:25,241 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:25,245 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:25,246 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:25,246 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:25" (1/2) ... [2025-04-26 16:21:25,247 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a063da7 and model type min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:25, skipping insertion in model container [2025-04-26 16:21:25,247 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:25,247 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:25" (2/2) ... [2025-04-26 16:21:25,248 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-max-sample-2.bpl [2025-04-26 16:21:25,295 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:21:25,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 82 flow [2025-04-26 16:21:25,347 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-26 16:21:25,349 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:21:25,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 26 events. 3/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-26 16:21:25,353 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 82 flow [2025-04-26 16:21:25,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 67 flow [2025-04-26 16:21:25,356 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 33 places, 26 transitions, 67 flow [2025-04-26 16:21:25,363 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:25,364 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:25,364 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:25,364 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:25,364 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:25,364 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:25,364 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:25,364 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:25,365 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:25,431 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 192 [2025-04-26 16:21:25,431 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:25,431 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:25,434 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:21:25,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:21:25,434 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:25,434 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 237 states, but on-demand construction may add more states [2025-04-26 16:21:25,440 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 192 [2025-04-26 16:21:25,441 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:25,441 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:25,441 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:21:25,441 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:21:25,445 INFO L752 eck$LassoCheckResult]: Stem: "[56] $Ultimate##0-->L70: 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[]" "[82] L70-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0]" "[85] L70-1-->$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]" "[88] L71-->L57: 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]" [2025-04-26 16:21:25,445 INFO L754 eck$LassoCheckResult]: Loop: "[71] L57-->L59: 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]" "[72] L59-->L57: Formula: (= (store v_max_samples_2 (+ (- 1) v_i2_7) v_array_max_6) v_max_samples_1) InVars {array_max=v_array_max_6, i2=v_i2_7, max_samples=v_max_samples_2} OutVars{array_max=v_array_max_6, i2=v_i2_7, max_samples=v_max_samples_1} AuxVars[] AssignedVars[max_samples]" [2025-04-26 16:21:25,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:25,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2673342, now seen corresponding path program 1 times [2025-04-26 16:21:25,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:25,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011464149] [2025-04-26 16:21:25,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:25,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:25,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:25,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:25,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:25,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:25,508 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:25,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:25,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:25,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:25,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:25,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:25,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:25,531 INFO L85 PathProgramCache]: Analyzing trace with hash 3234, now seen corresponding path program 1 times [2025-04-26 16:21:25,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:25,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17419158] [2025-04-26 16:21:25,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:25,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:25,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:25,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:25,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:25,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:25,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:25,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:25,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:25,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:25,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:25,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:25,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:25,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1725883361, now seen corresponding path program 1 times [2025-04-26 16:21:25,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:25,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098090212] [2025-04-26 16:21:25,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:25,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:25,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:25,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:25,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:25,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:25,565 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:25,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:25,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:25,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:25,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:25,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:25,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:25,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:25,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:25,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:25,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:25,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:25,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:25,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:25,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:25,757 INFO L201 PluginConnector]: Adding new model min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:21:25 BoogieIcfgContainer [2025-04-26 16:21:25,758 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:21:25,760 INFO L158 Benchmark]: Toolchain (without parser) took 744.97ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 52.1MB in the end (delta: 42.0MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-26 16:21:25,760 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:25,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.70ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 92.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:25,760 INFO L158 Benchmark]: Boogie Preprocessor took 17.33ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 91.1MB in the end (delta: 988.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:25,763 INFO L158 Benchmark]: RCFGBuilder took 169.51ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 81.2MB in the end (delta: 9.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:21:25,763 INFO L158 Benchmark]: BuchiAutomizer took 516.43ms. Allocated memory is still 167.8MB. Free memory was 81.2MB in the beginning and 52.1MB in the end (delta: 29.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-26 16:21:25,764 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.17ms. Allocated memory is still 167.8MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.70ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 92.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.33ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 91.1MB in the end (delta: 988.6kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 169.51ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 81.2MB in the end (delta: 9.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 516.43ms. Allocated memory is still 167.8MB. Free memory was 81.2MB in the beginning and 52.1MB in the end (delta: 29.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.4s and 1 iterations. TraceHistogramMax:1. 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 InitialAbstraction: - StatisticsResult: Constructed decomposition of program Trivial decomposition into one nonterminating module. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 57]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L68] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L70] FORK 0 fork 1 computeMin(); VAL [N=1, m=0] [L71] FORK 0 fork 2, 2 computeMax(); VAL [N=1, m=0] [L72] FORK 0 fork 3, 3, 3 sample(); VAL [N=1, m=0] Loop: [L58] min_samples[i1 - 1] := array_min; [L59] max_samples[i2 - 1] := array_max; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 57]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L68] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L70] FORK 0 fork 1 computeMin(); VAL [N=1, m=0] [L71] FORK 0 fork 2, 2 computeMax(); VAL [N=1, m=0] [L72] FORK 0 fork 3, 3, 3 sample(); VAL [N=1, m=0] Loop: [L58] min_samples[i1 - 1] := array_min; [L59] max_samples[i2 - 1] := array_max; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:21:25,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...