/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/weaver-benchmarks/generated/popl20/counter-fun.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:34,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:34,574 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:23:34,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:34,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:34,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:34,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:34,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:34,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:34,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:34,597 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:34,598 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:34,598 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:34,598 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:34,598 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:34,598 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:34,598 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:34,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:34,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:34,599 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:34,599 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:34,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:34,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:34,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:34,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:34,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:34,599 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:34,599 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:34,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:34,599 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:34,599 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:34,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:34,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:34,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:34,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:34,600 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:34,600 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:34,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:34,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:34,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:34,848 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:34,850 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:34,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/counter-fun.wvr.bpl [2025-04-26 16:23:34,853 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/counter-fun.wvr.bpl' [2025-04-26 16:23:34,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:34,874 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:34,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:34,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:34,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:34,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:34" (1/1) ... [2025-04-26 16:23:34,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:34" (1/1) ... [2025-04-26 16:23:34,914 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:34,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:34,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:34,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:34,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:34,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:34" (1/1) ... [2025-04-26 16:23:34,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:34" (1/1) ... [2025-04-26 16:23:34,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:34" (1/1) ... [2025-04-26 16:23:34,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:34" (1/1) ... [2025-04-26 16:23:34,923 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:34" (1/1) ... [2025-04-26 16:23:34,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:34" (1/1) ... [2025-04-26 16:23:34,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:34" (1/1) ... [2025-04-26 16:23:34,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:34" (1/1) ... [2025-04-26 16:23:34,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:34" (1/1) ... [2025-04-26 16:23:34,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:34,939 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:34,939 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:34,940 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:34,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:34" (1/1) ... [2025-04-26 16:23:34,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:34,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:34,970 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:23:34,975 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:23:34,995 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:34,996 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:34,996 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:34,996 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:34,996 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:34,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:34,997 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:23:35,033 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:35,035 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:35,117 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:35,117 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:35,140 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:35,140 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:35,141 INFO L201 PluginConnector]: Adding new model counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:35 BoogieIcfgContainer [2025-04-26 16:23:35,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:35,141 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:35,142 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:35,146 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:35,146 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:35,146 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:34" (1/2) ... [2025-04-26 16:23:35,147 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c77e3a1 and model type counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:23:35, skipping insertion in model container [2025-04-26 16:23:35,147 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:35,147 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:35" (2/2) ... [2025-04-26 16:23:35,149 INFO L376 chiAutomizerObserver]: Analyzing ICFG counter-fun.wvr.bpl [2025-04-26 16:23:35,187 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:23:35,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 24 transitions, 62 flow [2025-04-26 16:23:35,248 INFO L116 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-04-26 16:23:35,249 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:23:35,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 2/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-26 16:23:35,257 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 24 transitions, 62 flow [2025-04-26 16:23:35,261 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 20 transitions, 52 flow [2025-04-26 16:23:35,261 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 25 places, 20 transitions, 52 flow [2025-04-26 16:23:35,271 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:35,271 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:35,271 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:35,271 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:35,271 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:35,271 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:35,271 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:35,271 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:35,273 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:35,304 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:23:35,305 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:35,305 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:35,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:35,308 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:35,308 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:35,309 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 33 states, but on-demand construction may add more states [2025-04-26 16:23:35,310 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:23:35,310 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:35,310 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:35,311 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:35,312 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:35,318 INFO L752 eck$LassoCheckResult]: Stem: "[47] $Ultimate##0-->L45: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[49] L45-->L46: Formula: (= v_counter_7 0) InVars {counter=v_counter_7} OutVars{counter=v_counter_7} AuxVars[] AssignedVars[]" "[48] L46-->L47: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[34] L47-->L48: Formula: (= v_N2_3 v_N1_3) InVars {N2=v_N2_3, N1=v_N1_3} OutVars{N2=v_N2_3, N1=v_N1_3} AuxVars[] AssignedVars[]" "[64] L48-->L21-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:23:35,320 INFO L754 eck$LassoCheckResult]: Loop: "[55] L21-1-->L21: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[57] L21-->L21-1: Formula: (let ((.cse0 (select v_f_6 v_counter_14))) (and (= (+ v_i1_11 1) v_i1_10) (= v_counter_13 .cse0) (= v_counter_14 (select v_f_inv_4 .cse0)))) InVars {i1=v_i1_11, f_inv=v_f_inv_4, f=v_f_6, counter=v_counter_14} OutVars{i1=v_i1_10, f_inv=v_f_inv_4, f=v_f_6, counter=v_counter_13} AuxVars[] AssignedVars[counter, i1]" [2025-04-26 16:23:35,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:35,325 INFO L85 PathProgramCache]: Analyzing trace with hash 73541643, now seen corresponding path program 1 times [2025-04-26 16:23:35,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:35,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599020506] [2025-04-26 16:23:35,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:35,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:35,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:35,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:35,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:35,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:35,393 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:35,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:35,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:35,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:35,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:35,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:35,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:35,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 1 times [2025-04-26 16:23:35,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:35,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349305017] [2025-04-26 16:23:35,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:35,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:35,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:35,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:35,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:35,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:35,425 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:35,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:35,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:35,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:35,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:35,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:35,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:35,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1954043949, now seen corresponding path program 1 times [2025-04-26 16:23:35,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:35,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793823828] [2025-04-26 16:23:35,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:35,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:35,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:35,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:35,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:35,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:35,438 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:35,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:35,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:35,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:35,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:35,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:35,562 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:35,563 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:35,563 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:35,563 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:35,563 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:35,563 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:35,563 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:35,564 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:35,564 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-fun.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:23:35,564 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:35,564 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:35,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:35,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:35,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:35,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:35,683 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:35,686 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:35,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:35,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:35,690 INFO L229 MonitoredProcess]: Starting monitored process 2 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:23:35,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:23:35,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:35,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:35,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:35,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:35,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:35,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:35,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:35,719 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:35,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:35,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:35,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:35,729 INFO L229 MonitoredProcess]: Starting monitored process 3 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:23:35,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:23:35,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:35,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:35,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:35,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:35,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:35,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:35,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:35,757 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:35,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:35,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:35,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:35,766 INFO L229 MonitoredProcess]: Starting monitored process 4 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:23:35,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:23:35,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:35,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:35,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:35,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:35,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:35,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:35,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:35,796 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:35,805 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:23:35,806 INFO L437 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:23:35,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:35,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:35,809 INFO L229 MonitoredProcess]: Starting monitored process 5 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:23:35,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:23:35,812 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:35,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:35,828 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:35,828 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:35,829 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N1) = -1*i1 + 1*N1 Supporting invariants [] [2025-04-26 16:23:35,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:35,837 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:35,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:35,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:35,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:35,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:35,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:35,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:35,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:35,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:35,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:35,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:35,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:35,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:35,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:35,927 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:23:35,972 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:35,980 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 33 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:23:36,063 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 33 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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) Result 77 states and 158 transitions. Complement of second has 7 states. [2025-04-26 16:23:36,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:23:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2025-04-26 16:23:36,081 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:23:36,082 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:36,082 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:23:36,082 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:36,082 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:23:36,082 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:36,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 158 transitions. [2025-04-26 16:23:36,087 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 16:23:36,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 33 states and 69 transitions. [2025-04-26 16:23:36,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-04-26 16:23:36,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-04-26 16:23:36,092 INFO L74 IsDeterministic]: Start isDeterministic. Operand 33 states and 69 transitions. [2025-04-26 16:23:36,092 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:36,092 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 69 transitions. [2025-04-26 16:23:36,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 69 transitions. [2025-04-26 16:23:36,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2025-04-26 16:23:36,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.111111111111111) internal successors, (in total 57), 26 states have internal predecessors, (57), 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:23:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 57 transitions. [2025-04-26 16:23:36,108 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 57 transitions. [2025-04-26 16:23:36,108 INFO L438 stractBuchiCegarLoop]: Abstraction has 27 states and 57 transitions. [2025-04-26 16:23:36,109 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:36,109 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 57 transitions. [2025-04-26 16:23:36,109 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 16:23:36,109 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:36,109 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:36,110 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:36,110 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:36,110 INFO L752 eck$LassoCheckResult]: Stem: "[47] $Ultimate##0-->L45: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[49] L45-->L46: Formula: (= v_counter_7 0) InVars {counter=v_counter_7} OutVars{counter=v_counter_7} AuxVars[] AssignedVars[]" "[48] L46-->L47: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[34] L47-->L48: Formula: (= v_N2_3 v_N1_3) InVars {N2=v_N2_3, N1=v_N1_3} OutVars{N2=v_N2_3, N1=v_N1_3} AuxVars[] AssignedVars[]" "[64] L48-->L21-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L48-1-->L33-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:23:36,110 INFO L754 eck$LassoCheckResult]: Loop: "[59] L33-1-->L33: Formula: (< v_i2_2 v_N2_2) InVars {N2=v_N2_2, i2=v_i2_2} OutVars{N2=v_N2_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[61] L33-->L33-1: Formula: (let ((.cse0 (select v_f_inv_8 v_counter_22))) (and (= v_counter_22 (select v_f_8 .cse0)) (= v_counter_21 .cse0) (= v_i2_10 (+ v_i2_11 1)))) InVars {i2=v_i2_11, f_inv=v_f_inv_8, f=v_f_8, counter=v_counter_22} OutVars{i2=v_i2_10, f_inv=v_f_inv_8, f=v_f_8, counter=v_counter_21} AuxVars[] AssignedVars[counter, i2]" [2025-04-26 16:23:36,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:36,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2015176296, now seen corresponding path program 1 times [2025-04-26 16:23:36,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:36,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075392536] [2025-04-26 16:23:36,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:36,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:36,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:36,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:36,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:36,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:36,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:36,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:36,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:36,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:36,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:36,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2025-04-26 16:23:36,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:36,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097088001] [2025-04-26 16:23:36,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:36,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:36,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:36,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:36,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:36,133 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:36,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:36,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:36,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:36,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:36,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:36,137 INFO L85 PathProgramCache]: Analyzing trace with hash 445831930, now seen corresponding path program 1 times [2025-04-26 16:23:36,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:36,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199053323] [2025-04-26 16:23:36,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:36,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:36,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:36,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:36,143 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:36,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:36,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:36,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:36,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:36,224 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:36,224 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:36,224 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:36,224 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:36,224 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:36,224 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,224 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:36,224 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:36,224 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-fun.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:23:36,224 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:36,224 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:36,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:36,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:36,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:36,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:36,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:36,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:36,319 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:36,319 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:36,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,321 INFO L229 MonitoredProcess]: Starting monitored process 6 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:23:36,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:23:36,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:36,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:36,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:36,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:36,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:36,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:36,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:36,340 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:36,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:23:36,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,348 INFO L229 MonitoredProcess]: Starting monitored process 7 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:23:36,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:23:36,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:36,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:36,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:36,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:36,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:36,363 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:36,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:36,366 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:36,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:36,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,374 INFO L229 MonitoredProcess]: Starting monitored process 8 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:23:36,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:23:36,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:36,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:36,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:36,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:36,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:36,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:36,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:36,396 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:36,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:23:36,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,404 INFO L229 MonitoredProcess]: Starting monitored process 9 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:23:36,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:23:36,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:36,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:36,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:36,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:36,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:36,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:36,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:36,430 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:36,441 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:23:36,441 INFO L437 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:23:36,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,443 INFO L229 MonitoredProcess]: Starting monitored process 10 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:23:36,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:23:36,445 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:36,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:23:36,460 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:36,460 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:36,460 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N2, i2) = 1*N2 - 1*i2 Supporting invariants [] [2025-04-26 16:23:36,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:36,467 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:36,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:36,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:36,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:36,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:36,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:36,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:36,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:36,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:36,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:36,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:36,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:36,507 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:23:36,507 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:36,508 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 57 transitions. cyclomatic complexity: 37 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:23:36,539 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 57 transitions. cyclomatic complexity: 37. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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) Result 64 states and 135 transitions. Complement of second has 6 states. [2025-04-26 16:23:36,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:23:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2025-04-26 16:23:36,541 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:23:36,541 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:36,541 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:23:36,541 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:36,541 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:23:36,541 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:36,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 135 transitions. [2025-04-26 16:23:36,543 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:36,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2025-04-26 16:23:36,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:23:36,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:23:36,543 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:23:36,546 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:36,546 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:36,546 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:36,546 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:36,546 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:36,546 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:23:36,547 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:36,547 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:23:36,551 INFO L201 PluginConnector]: Adding new model counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:36 BoogieIcfgContainer [2025-04-26 16:23:36,552 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:36,552 INFO L158 Benchmark]: Toolchain (without parser) took 1678.08ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 85.1MB in the beginning and 53.4MB in the end (delta: 31.7MB). Peak memory consumption was 5.8MB. Max. memory is 8.0GB. [2025-04-26 16:23:36,552 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.84ms. Allocated memory is still 155.2MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:36,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.35ms. Allocated memory is still 155.2MB. Free memory was 85.1MB in the beginning and 83.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:23:36,553 INFO L158 Benchmark]: Boogie Preprocessor took 23.41ms. Allocated memory is still 155.2MB. Free memory was 83.2MB in the beginning and 82.2MB in the end (delta: 964.1kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:36,553 INFO L158 Benchmark]: RCFGBuilder took 201.41ms. Allocated memory is still 155.2MB. Free memory was 82.2MB in the beginning and 72.6MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:23:36,554 INFO L158 Benchmark]: BuchiAutomizer took 1410.19ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 72.5MB in the beginning and 53.4MB in the end (delta: 19.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:36,556 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.84ms. Allocated memory is still 155.2MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.35ms. Allocated memory is still 155.2MB. Free memory was 85.1MB in the beginning and 83.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.41ms. Allocated memory is still 155.2MB. Free memory was 83.2MB in the beginning and 82.2MB in the end (delta: 964.1kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 201.41ms. Allocated memory is still 155.2MB. Free memory was 82.2MB in the beginning and 72.6MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1410.19ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 72.5MB in the beginning and 53.4MB in the end (delta: 19.1MB). 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 1.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 26 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital42 mio100 ax100 hnf100 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq177 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N1 + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function -1 * i2 + N2 and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:23:36,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...