/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/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/single_assertion_test.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:53:09,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:53:09,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:53:09,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:53:09,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:53:09,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:53:09,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:53:09,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:53:09,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:53:09,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:53:09,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:53:09,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:53:09,888 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:53:09,888 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:53:09,889 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:53:09,889 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:53:09,889 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:53:09,889 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:53:09,889 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:53:09,889 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:53:09,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:53:09,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:53:09,889 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:53:09,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:53:09,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:53:09,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:53:09,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:53:09,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:53:09,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:53:09,889 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:53:09,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:53:09,890 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:53:09,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:53:09,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:53:09,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:53:09,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:09,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:53:09,890 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:53:09,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:53:09,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:53:09,890 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:53:09,890 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:53:09,890 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:53:10,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:53:10,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:53:10,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:53:10,130 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:53:10,130 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:53:10,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/single_assertion_test.bpl [2025-04-26 16:53:10,132 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/single_assertion_test.bpl' [2025-04-26 16:53:10,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:53:10,148 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:53:10,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:10,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:53:10,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:53:10,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:10" (1/1) ... [2025-04-26 16:53:10,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:10" (1/1) ... [2025-04-26 16:53:10,179 INFO L138 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:53:10,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:10,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:53:10,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:53:10,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:53:10,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:10" (1/1) ... [2025-04-26 16:53:10,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:10" (1/1) ... [2025-04-26 16:53:10,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:10" (1/1) ... [2025-04-26 16:53:10,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:10" (1/1) ... [2025-04-26 16:53:10,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:10" (1/1) ... [2025-04-26 16:53:10,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:10" (1/1) ... [2025-04-26 16:53:10,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:10" (1/1) ... [2025-04-26 16:53:10,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:10" (1/1) ... [2025-04-26 16:53:10,191 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:10" (1/1) ... [2025-04-26 16:53:10,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:53:10,204 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:53:10,204 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:53:10,204 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:53:10,208 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:10" (1/1) ... [2025-04-26 16:53:10,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:10,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:10,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:10,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:53:10,256 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:53:10,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:53:10,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:53:10,256 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2025-04-26 16:53:10,256 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-26 16:53:10,256 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-26 16:53:10,257 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:53:10,287 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:53:10,289 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:53:10,338 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:53:10,338 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:53:10,344 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:53:10,345 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:53:10,345 INFO L201 PluginConnector]: Adding new model single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:10 BoogieIcfgContainer [2025-04-26 16:53:10,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:53:10,346 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:53:10,346 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:53:10,351 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:53:10,352 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:10,352 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:10" (1/2) ... [2025-04-26 16:53:10,353 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72aca382 and model type single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:53:10, skipping insertion in model container [2025-04-26 16:53:10,353 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:10,353 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:10" (2/2) ... [2025-04-26 16:53:10,354 INFO L376 chiAutomizerObserver]: Analyzing ICFG single_assertion_test.bpl [2025-04-26 16:53:10,389 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:53:10,420 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:10,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:10,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:10,422 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:10,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:53:10,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 17 transitions, 44 flow [2025-04-26 16:53:10,487 INFO L116 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-04-26 16:53:10,489 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-26 16:53:10,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20 conditions, 15 events. 1/15 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 15 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 5. Up to 2 conditions per place. [2025-04-26 16:53:10,492 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 17 transitions, 44 flow [2025-04-26 16:53:10,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 13 transitions, 33 flow [2025-04-26 16:53:10,496 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 15 places, 13 transitions, 33 flow [2025-04-26 16:53:10,501 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:10,533 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 70#[threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:53:10,534 WARN L140 AmpleReduction]: Number of pruned transitions: 7 [2025-04-26 16:53:10,535 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:53:10,535 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 16:53:10,535 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:20 [2025-04-26 16:53:10,535 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:6 [2025-04-26 16:53:10,535 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:53:10,535 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:53:10,535 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:10,536 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 27 states, 24 states have (on average 1.5) internal successors, (in total 36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:10,545 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:10,545 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:10,545 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:10,545 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:10,549 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:10,550 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:10,550 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:10,550 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:10,551 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 24 states have (on average 1.5) internal successors, (in total 36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:10,571 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-04-26 16:53:10,571 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:10,572 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:10,574 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:10,574 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:53:10,574 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:10,575 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 24 states have (on average 1.5) internal successors, (in total 36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:10,577 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-04-26 16:53:10,577 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:10,577 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:10,577 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:10,577 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:53:10,582 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L21: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[26] L21-->L22-1: Formula: (= 0 v_ULTIMATE.start_i_1) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_1} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[20] L22-1-->L24: Formula: (< v_ULTIMATE.start_i_2 2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[40] L24-->$Ultimate##0: Formula: (and (= v_threadThread1of1ForFork0_i_6 v_ULTIMATE.start_i_8) (= v_threadThread1of1ForFork0_thidvar0_2 v_ULTIMATE.start_i_8)) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_8} OutVars{threadThread1of1ForFork0_i=v_threadThread1of1ForFork0_i_6, ULTIMATE.start_i=v_ULTIMATE.start_i_8, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of1ForFork0_i, threadThread1of1ForFork0_thidvar0]" "[34] $Ultimate##0-->L41: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[35] L41-->threadErr0ASSERT_VIOLATIONASSERT: Formula: (not (= v_threadThread1of1ForFork0_i_1 0)) InVars {threadThread1of1ForFork0_i=v_threadThread1of1ForFork0_i_1} OutVars{threadThread1of1ForFork0_i=v_threadThread1of1ForFork0_i_1} AuxVars[] AssignedVars[]" "[25] L24-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[20] L22-1-->L24: Formula: (< v_ULTIMATE.start_i_2 2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[38] L24-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:53:10,582 INFO L754 eck$LassoCheckResult]: Loop: "[39] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:53:10,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:10,585 INFO L85 PathProgramCache]: Analyzing trace with hash -576760998, now seen corresponding path program 1 times [2025-04-26 16:53:10,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:10,590 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108549322] [2025-04-26 16:53:10,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:10,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:10,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:10,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:10,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:10,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:10,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:10,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108549322] [2025-04-26 16:53:10,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108549322] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:10,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:10,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:53:10,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085867610] [2025-04-26 16:53:10,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:10,760 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:10,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:10,761 INFO L85 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 1 times [2025-04-26 16:53:10,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:10,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831727547] [2025-04-26 16:53:10,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:10,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:10,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:53:10,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:53:10,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:10,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:10,763 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:10,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:53:10,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:53:10,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:10,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:10,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:10,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:10,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:53:10,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:53:10,841 INFO L87 Difference]: Start difference. First operand has 27 states, 24 states have (on average 1.5) internal successors, (in total 36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:10,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:10,911 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2025-04-26 16:53:10,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2025-04-26 16:53:10,913 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-04-26 16:53:10,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 20 transitions. [2025-04-26 16:53:10,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-04-26 16:53:10,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-04-26 16:53:10,926 INFO L74 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2025-04-26 16:53:10,927 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:53:10,927 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-04-26 16:53:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2025-04-26 16:53:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-04-26 16:53:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (in total 20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2025-04-26 16:53:10,958 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-04-26 16:53:10,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:53:10,965 INFO L438 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-04-26 16:53:10,965 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:53:10,965 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2025-04-26 16:53:10,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-04-26 16:53:10,966 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:10,966 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:10,966 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:10,966 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:53:10,977 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L21: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[26] L21-->L22-1: Formula: (= 0 v_ULTIMATE.start_i_1) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_1} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[20] L22-1-->L24: Formula: (< v_ULTIMATE.start_i_2 2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[40] L24-->$Ultimate##0: Formula: (and (= v_threadThread1of1ForFork0_i_6 v_ULTIMATE.start_i_8) (= v_threadThread1of1ForFork0_thidvar0_2 v_ULTIMATE.start_i_8)) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_8} OutVars{threadThread1of1ForFork0_i=v_threadThread1of1ForFork0_i_6, ULTIMATE.start_i=v_ULTIMATE.start_i_8, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of1ForFork0_i, threadThread1of1ForFork0_thidvar0]" "[34] $Ultimate##0-->L41: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[25] L24-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[20] L22-1-->L24: Formula: (< v_ULTIMATE.start_i_2 2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[38] L24-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[36] L41-->threadFINAL: Formula: (= v_threadThread1of1ForFork0_i_3 0) InVars {threadThread1of1ForFork0_i=v_threadThread1of1ForFork0_i_3} OutVars{threadThread1of1ForFork0_i=v_threadThread1of1ForFork0_i_3} AuxVars[] AssignedVars[]" [2025-04-26 16:53:10,977 INFO L754 eck$LassoCheckResult]: Loop: "[39] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:53:10,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:10,978 INFO L85 PathProgramCache]: Analyzing trace with hash -577063157, now seen corresponding path program 1 times [2025-04-26 16:53:10,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:10,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461094089] [2025-04-26 16:53:10,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:10,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:10,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:10,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:10,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:10,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:10,991 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:10,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:10,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:10,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:10,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:10,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:10,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:10,998 INFO L85 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 2 times [2025-04-26 16:53:10,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:10,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134356838] [2025-04-26 16:53:11,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:11,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:11,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:53:11,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:53:11,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:11,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:11,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:11,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:53:11,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:53:11,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:11,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:11,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:11,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:11,005 INFO L85 PathProgramCache]: Analyzing trace with hash -709088644, now seen corresponding path program 1 times [2025-04-26 16:53:11,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:11,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196548300] [2025-04-26 16:53:11,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:11,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:11,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:53:11,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:53:11,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:11,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:11,012 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:11,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:53:11,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:53:11,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:11,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:11,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:11,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:11,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:11,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:11,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:11,098 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:11,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:11,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:11,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:11,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:11,111 WARN L166 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:53:11,117 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:53:11,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:53:11,131 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:11,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:11,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:11,133 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:11,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2025-04-26 16:53:11,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 24 transitions, 70 flow [2025-04-26 16:53:11,157 INFO L116 PetriNetUnfolderBase]: 2/30 cut-off events. [2025-04-26 16:53:11,157 INFO L117 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-04-26 16:53:11,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 2/30 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 47 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 18. Up to 4 conditions per place. [2025-04-26 16:53:11,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 24 transitions, 70 flow [2025-04-26 16:53:11,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 24 transitions, 70 flow [2025-04-26 16:53:11,159 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 26 places, 24 transitions, 70 flow [2025-04-26 16:53:11,159 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:11,196 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 107#[threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONASSERT]true [2025-04-26 16:53:11,211 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 173#[threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:53:11,221 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 239#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadFINAL, threadErr0ASSERT_VIOLATIONASSERT]true [2025-04-26 16:53:11,226 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 249#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadFINAL, threadEXIT]true [2025-04-26 16:53:11,227 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 251#[threadFINAL, threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:53:11,245 WARN L140 AmpleReduction]: Number of pruned transitions: 96 [2025-04-26 16:53:11,245 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 5 [2025-04-26 16:53:11,245 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 5 [2025-04-26 16:53:11,246 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:98 [2025-04-26 16:53:11,246 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:59 [2025-04-26 16:53:11,246 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:53:11,246 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:53:11,246 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:11,246 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 158 states, 150 states have (on average 1.8066666666666666) internal successors, (in total 271), 157 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:11,246 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:11,246 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:11,246 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:11,246 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:11,246 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:11,246 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:11,247 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:11,247 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:11,247 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 158 states, 150 states have (on average 1.8066666666666666) internal successors, (in total 271), 157 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:11,252 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2025-04-26 16:53:11,253 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:11,253 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:11,254 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:11,254 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:53:11,254 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:11,254 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 158 states, 150 states have (on average 1.8066666666666666) internal successors, (in total 271), 157 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:11,259 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2025-04-26 16:53:11,259 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:11,259 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:11,259 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:11,259 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:53:11,260 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L21: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[56] L21-->L22-1: Formula: (= 0 v_ULTIMATE.start_i_1) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_1} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[50] L22-1-->L24: Formula: (< v_ULTIMATE.start_i_2 2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[74] L24-->$Ultimate##0: Formula: (and (= v_threadThread1of2ForFork0_i_6 v_ULTIMATE.start_i_13) (= v_threadThread1of2ForFork0_thidvar0_2 v_ULTIMATE.start_i_13)) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_13} OutVars{threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_13, threadThread1of2ForFork0_i=v_threadThread1of2ForFork0_i_6} AuxVars[] AssignedVars[threadThread1of2ForFork0_thidvar0, threadThread1of2ForFork0_i]" "[64] $Ultimate##0-->L41: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[65] L41-->threadErr0ASSERT_VIOLATIONASSERT: Formula: (not (= v_threadThread1of2ForFork0_i_1 0)) InVars {threadThread1of2ForFork0_i=v_threadThread1of2ForFork0_i_1} OutVars{threadThread1of2ForFork0_i=v_threadThread1of2ForFork0_i_1} AuxVars[] AssignedVars[]" "[55] L24-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[50] L22-1-->L24: Formula: (< v_ULTIMATE.start_i_2 2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[75] L24-->$Ultimate##0: Formula: (and (= v_threadThread2of2ForFork0_thidvar0_2 v_ULTIMATE.start_i_16) (= v_threadThread2of2ForFork0_i_6 v_ULTIMATE.start_i_16)) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_16} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_16, threadThread2of2ForFork0_thidvar0=v_threadThread2of2ForFork0_thidvar0_2, threadThread2of2ForFork0_i=v_threadThread2of2ForFork0_i_6} AuxVars[] AssignedVars[threadThread2of2ForFork0_thidvar0, threadThread2of2ForFork0_i]" "[68] $Ultimate##0-->L41: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[69] L41-->threadErr0ASSERT_VIOLATIONASSERT: Formula: (not (= v_threadThread2of2ForFork0_i_1 0)) InVars {threadThread2of2ForFork0_i=v_threadThread2of2ForFork0_i_1} OutVars{threadThread2of2ForFork0_i=v_threadThread2of2ForFork0_i_1} AuxVars[] AssignedVars[]" "[55] L24-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[50] L22-1-->L24: Formula: (< v_ULTIMATE.start_i_2 2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[72] L24-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:53:11,260 INFO L754 eck$LassoCheckResult]: Loop: "[73] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:53:11,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:11,260 INFO L85 PathProgramCache]: Analyzing trace with hash -988123503, now seen corresponding path program 1 times [2025-04-26 16:53:11,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:11,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581159434] [2025-04-26 16:53:11,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:11,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:11,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:53:11,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:53:11,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:11,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:11,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:11,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581159434] [2025-04-26 16:53:11,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581159434] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:11,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:11,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:53:11,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562072293] [2025-04-26 16:53:11,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:11,317 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:11,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:11,318 INFO L85 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 1 times [2025-04-26 16:53:11,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:11,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787656647] [2025-04-26 16:53:11,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:11,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:11,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:53:11,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:53:11,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:11,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:11,320 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:11,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:53:11,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:53:11,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:11,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:11,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:11,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:11,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:53:11,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:53:11,326 INFO L87 Difference]: Start difference. First operand has 158 states, 150 states have (on average 1.8066666666666666) internal successors, (in total 271), 157 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (in total 14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:11,356 INFO L93 Difference]: Finished difference Result 112 states and 179 transitions. [2025-04-26 16:53:11,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 179 transitions. [2025-04-26 16:53:11,358 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:53:11,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 0 states and 0 transitions. [2025-04-26 16:53:11,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:53:11,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:53:11,358 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:53:11,359 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:53:11,359 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:53:11,359 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:53:11,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:53:11,362 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:53:11,362 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:53:11,362 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:53:11,362 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:53:11,362 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:53:11,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:11,371 INFO L201 PluginConnector]: Adding new model single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:53:11 BoogieIcfgContainer [2025-04-26 16:53:11,371 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:53:11,372 INFO L158 Benchmark]: Toolchain (without parser) took 1223.67ms. Allocated memory was 142.6MB in the beginning and 125.8MB in the end (delta: -16.8MB). Free memory was 78.4MB in the beginning and 68.3MB in the end (delta: 10.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:11,372 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.78ms. Allocated memory is still 142.6MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:11,372 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.65ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 76.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:11,372 INFO L158 Benchmark]: Boogie Preprocessor took 22.44ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 75.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:11,372 INFO L158 Benchmark]: RCFGBuilder took 140.70ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 66.9MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:53:11,372 INFO L158 Benchmark]: BuchiAutomizer took 1025.29ms. Allocated memory was 142.6MB in the beginning and 125.8MB in the end (delta: -16.8MB). Free memory was 66.9MB in the beginning and 68.3MB in the end (delta: -1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:11,375 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.78ms. Allocated memory is still 142.6MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.65ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 76.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.44ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 75.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 140.70ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 66.9MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1025.29ms. Allocated memory was 142.6MB in the beginning and 125.8MB in the end (delta: -16.8MB). Free memory was 66.9MB in the beginning and 68.3MB in the end (delta: -1.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.6s and 2 iterations. TraceHistogramMax:2. Analysis of lassos took 0.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 8 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN1 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 119, Number of transitions in reduction automaton: 36, Number of states in reduction automaton: 27, Underlying: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.2s and 2 iterations. TraceHistogramMax:3. Analysis of lassos took 0.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. 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: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 25 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN1 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 121, Number of transitions in reduction automaton: 271, Number of states in reduction automaton: 158, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic). 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:53:11,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...