/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/figure1-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:35,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:35,383 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:35,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:35,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:35,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:35,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:35,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:35,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:35,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:35,410 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:35,410 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:35,410 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:35,410 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:35,410 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:35,410 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:35,410 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:35,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:35,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:35,410 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:35,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:35,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:35,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:35,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:35,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:35,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:35,411 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:35,411 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:35,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:35,411 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:35,411 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:35,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:35,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:35,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:35,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:35,413 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:35,413 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:35,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:35,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:35,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:35,640 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:35,640 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:35,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/figure1-alt.wvr.bpl [2025-04-26 16:23:35,641 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/figure1-alt.wvr.bpl' [2025-04-26 16:23:35,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:35,660 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:35,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:35,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:35,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:35,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:35" (1/1) ... [2025-04-26 16:23:35,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:35" (1/1) ... [2025-04-26 16:23:35,694 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:35,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:35,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:35,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:35,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:35,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:35" (1/1) ... [2025-04-26 16:23:35,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:35" (1/1) ... [2025-04-26 16:23:35,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:35" (1/1) ... [2025-04-26 16:23:35,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:35" (1/1) ... [2025-04-26 16:23:35,702 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:35" (1/1) ... [2025-04-26 16:23:35,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:35" (1/1) ... [2025-04-26 16:23:35,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:35" (1/1) ... [2025-04-26 16:23:35,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:35" (1/1) ... [2025-04-26 16:23:35,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:35" (1/1) ... [2025-04-26 16:23:35,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:35,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:35,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:35,711 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:35,712 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:35" (1/1) ... [2025-04-26 16:23:35,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:35,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:35,736 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:35,738 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:35,754 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:35,754 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:35,754 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:35,754 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:35,754 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:35,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:35,755 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,786 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:35,788 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:35,852 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:35,852 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:35,875 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:35,875 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:35,876 INFO L201 PluginConnector]: Adding new model figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:35 BoogieIcfgContainer [2025-04-26 16:23:35,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:35,877 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:35,877 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:35,883 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:35,883 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:35,883 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:35" (1/2) ... [2025-04-26 16:23:35,884 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2aac303b and model type figure1-alt.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,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:35,884 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:35" (2/2) ... [2025-04-26 16:23:35,885 INFO L376 chiAutomizerObserver]: Analyzing ICFG figure1-alt.wvr.bpl [2025-04-26 16:23:35,933 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:23:35,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 64 flow [2025-04-26 16:23:35,985 INFO L116 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-04-26 16:23:35,987 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:23:35,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 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/18 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2025-04-26 16:23:35,994 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 64 flow [2025-04-26 16:23:35,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2025-04-26 16:23:35,997 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 26 places, 21 transitions, 54 flow [2025-04-26 16:23:36,005 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:36,005 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:36,005 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:36,006 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:36,006 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:36,006 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:36,006 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:36,006 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:36,007 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:36,026 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:23:36,027 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:36,027 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:36,029 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:36,029 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:36,029 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:36,030 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 34 states, but on-demand construction may add more states [2025-04-26 16:23:36,033 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:23:36,033 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:36,033 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:36,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:36,033 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:36,038 INFO L752 eck$LassoCheckResult]: Stem: "[49] $Ultimate##0-->L42: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[43] L42-->L43: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[40] L43-->L44: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[34] L44-->L45: Formula: (<= 0 v_N1_3) InVars {N1=v_N1_3} OutVars{N1=v_N1_3} AuxVars[] AssignedVars[]" "[51] L45-->L46: Formula: (<= 0 v_N2_3) InVars {N2=v_N2_3} OutVars{N2=v_N2_3} AuxVars[] AssignedVars[]" "[64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:23:36,039 INFO L754 eck$LassoCheckResult]: Loop: "[55] L19-1-->L19: 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] L19-->L19-1: Formula: (and (= v_counter_8 (+ v_counter_9 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter=v_counter_9} OutVars{i1=v_i1_6, counter=v_counter_8} AuxVars[] AssignedVars[counter, i1]" [2025-04-26 16:23:36,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:36,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1963697854, now seen corresponding path program 1 times [2025-04-26 16:23:36,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:36,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247636816] [2025-04-26 16:23:36,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:36,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:36,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:36,094 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,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:36,095 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:36,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:36,101 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,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:36,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:36,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:36,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 1 times [2025-04-26 16:23:36,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:36,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392018084] [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 2 statements into 1 equivalence classes. [2025-04-26 16:23:36,121 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,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:36,121 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:36,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:36,124 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,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:36,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:36,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:36,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1622992988, now seen corresponding path program 1 times [2025-04-26 16:23:36,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:36,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473902437] [2025-04-26 16:23:36,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:36,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:36,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:36,131 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,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:36,131 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:36,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 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 8 of 8 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,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:36,187 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:36,187 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:36,187 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:36,188 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:36,188 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:23:36,188 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,188 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:36,188 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:36,189 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:23:36,189 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:36,189 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:36,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:36,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:36,246 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:36,247 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:23:36,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,250 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:36,251 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:36,251 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:23:36,252 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:36,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:23:36,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,271 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:36,273 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:36,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:23:36,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:36,300 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:23:36,300 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {counter=0} Honda state: {counter=0} Generalized eigenvectors: [{counter=2}, {counter=-6}, {counter=5}] Lambdas: [4, 1, 1] Nus: [1, 0] [2025-04-26 16:23:36,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:23:36,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,308 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:36,310 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:36,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:23:36,311 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:36,329 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:36,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,331 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:36,331 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:36,332 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:23:36,332 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:36,400 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:23:36,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:23:36,404 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:36,405 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:36,405 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:36,405 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:36,405 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:36,405 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,405 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:36,405 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:36,405 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:23:36,405 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:36,405 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:36,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:36,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:36,443 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:36,446 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:36,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,449 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,451 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,452 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,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:36,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:36,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:36,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:36,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:36,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:36,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:36,471 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:36,477 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,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,479 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,480 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,480 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,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:36,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:36,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:36,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:36,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:36,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:36,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:36,496 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:36,500 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:23:36,500 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:23:36,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,503 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,504 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,504 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:36,507 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,507 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:23:36,507 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:36,508 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N1, i1) = 1*N1 - 1*i1 Supporting invariants [] [2025-04-26 16:23:36,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:23:36,515 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:36,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:36,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:36,554 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,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:36,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:36,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:36,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:36,573 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,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:36,573 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:36,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:36,590 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,637 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,640 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 34 states, but on-demand construction may add more states 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,777 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 34 states, but on-demand construction may add more states. 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 78 states and 159 transitions. Complement of second has 7 states. [2025-04-26 16:23:36,782 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,785 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,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2025-04-26 16:23:36,797 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:23:36,798 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:36,798 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:23:36,798 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:36,798 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:23:36,798 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:36,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 159 transitions. [2025-04-26 16:23:36,803 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 16:23:36,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 34 states and 70 transitions. [2025-04-26 16:23:36,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-04-26 16:23:36,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-04-26 16:23:36,809 INFO L74 IsDeterministic]: Start isDeterministic. Operand 34 states and 70 transitions. [2025-04-26 16:23:36,809 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:36,811 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 70 transitions. [2025-04-26 16:23:36,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 70 transitions. [2025-04-26 16:23:36,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2025-04-26 16:23:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (in total 58), 27 states have internal predecessors, (58), 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,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2025-04-26 16:23:36,829 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 58 transitions. [2025-04-26 16:23:36,829 INFO L438 stractBuchiCegarLoop]: Abstraction has 28 states and 58 transitions. [2025-04-26 16:23:36,829 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:36,829 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 58 transitions. [2025-04-26 16:23:36,830 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 16:23:36,830 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:36,830 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:36,830 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:36,832 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:36,833 INFO L752 eck$LassoCheckResult]: Stem: "[49] $Ultimate##0-->L42: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[43] L42-->L43: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[40] L43-->L44: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[34] L44-->L45: Formula: (<= 0 v_N1_3) InVars {N1=v_N1_3} OutVars{N1=v_N1_3} AuxVars[] AssignedVars[]" "[51] L45-->L46: Formula: (<= 0 v_N2_3) InVars {N2=v_N2_3} OutVars{N2=v_N2_3} AuxVars[] AssignedVars[]" "[64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L46-1-->L30-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,833 INFO L754 eck$LassoCheckResult]: Loop: "[59] L30-1-->L30: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[61] L30-->L30-1: Formula: (and (= v_counter_17 (+ v_counter_16 1)) (= v_i2_10 (+ v_i2_11 1)) (< 0 v_counter_17)) InVars {i2=v_i2_11, counter=v_counter_17} OutVars{i2=v_i2_10, counter=v_counter_16} AuxVars[] AssignedVars[counter, i2]" [2025-04-26 16:23:36,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:36,833 INFO L85 PathProgramCache]: Analyzing trace with hash -745091263, now seen corresponding path program 1 times [2025-04-26 16:23:36,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:36,833 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76491649] [2025-04-26 16:23:36,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:36,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:36,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:36,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:36,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:36,837 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:36,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:36,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:36,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:36,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:36,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:36,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2025-04-26 16:23:36,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:36,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572095424] [2025-04-26 16:23:36,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:36,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:36,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:36,844 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,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:36,845 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:36,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:36,846 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,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:36,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:36,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:36,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1226836579, now seen corresponding path program 1 times [2025-04-26 16:23:36,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:36,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755491465] [2025-04-26 16:23:36,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:36,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:36,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:36,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:36,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:36,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:36,896 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,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:36,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755491465] [2025-04-26 16:23:36,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755491465] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:36,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:36,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:23:36,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919575519] [2025-04-26 16:23:36,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:36,932 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:36,932 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:36,932 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:36,932 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:36,932 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:23:36,932 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,932 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:36,932 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:36,932 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:23:36,932 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:36,932 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:36,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:36,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:36,969 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:36,970 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:23:36,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,973 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,974 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,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:23:36,975 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:36,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:23:36,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:36,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:36,994 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,994 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,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:23:36,995 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:37,017 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:23:37,021 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:37,021 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:37,021 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:37,021 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:37,021 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:37,021 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:37,021 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,021 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:37,021 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:37,021 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:23:37,021 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:37,021 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:37,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,052 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:37,052 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:37,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:37,054 INFO L229 MonitoredProcess]: Starting monitored process 11 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:37,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:23:37,057 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:37,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:37,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:37,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:37,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:37,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:37,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:37,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:37,070 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:37,073 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 16:23:37,073 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:23:37,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:37,075 INFO L229 MonitoredProcess]: Starting monitored process 12 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:37,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:23:37,077 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:37,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:23:37,080 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:23:37,080 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:37,080 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2025-04-26 16:23:37,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:23:37,086 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:37,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:37,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:37,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:37,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:37,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:37,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:37,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:37,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:37,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:37,115 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:37,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:37,117 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:37,117 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:23:37,118 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 58 transitions. cyclomatic complexity: 37 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 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:23:37,133 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 58 transitions. cyclomatic complexity: 37. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 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) Result 69 states and 137 transitions. Complement of second has 5 states. [2025-04-26 16:23:37,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 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:23:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2025-04-26 16:23:37,136 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:23:37,136 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:37,136 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:23:37,136 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:37,136 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:23:37,137 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:37,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 137 transitions. [2025-04-26 16:23:37,138 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 16:23:37,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 33 states and 63 transitions. [2025-04-26 16:23:37,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-04-26 16:23:37,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-04-26 16:23:37,141 INFO L74 IsDeterministic]: Start isDeterministic. Operand 33 states and 63 transitions. [2025-04-26 16:23:37,141 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:37,141 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 63 transitions. [2025-04-26 16:23:37,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 63 transitions. [2025-04-26 16:23:37,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-04-26 16:23:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.9090909090909092) internal successors, (in total 63), 32 states have internal predecessors, (63), 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:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 63 transitions. [2025-04-26 16:23:37,143 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 63 transitions. [2025-04-26 16:23:37,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:37,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:23:37,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:23:37,147 INFO L87 Difference]: Start difference. First operand 33 states and 63 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (in total 9), 3 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:23:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:37,161 INFO L93 Difference]: Finished difference Result 42 states and 78 transitions. [2025-04-26 16:23:37,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 78 transitions. [2025-04-26 16:23:37,162 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 16:23:37,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 39 states and 73 transitions. [2025-04-26 16:23:37,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-04-26 16:23:37,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-04-26 16:23:37,163 INFO L74 IsDeterministic]: Start isDeterministic. Operand 39 states and 73 transitions. [2025-04-26 16:23:37,163 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:37,163 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 73 transitions. [2025-04-26 16:23:37,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 73 transitions. [2025-04-26 16:23:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-04-26 16:23:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (in total 67), 34 states have internal predecessors, (67), 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:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 67 transitions. [2025-04-26 16:23:37,166 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 67 transitions. [2025-04-26 16:23:37,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:23:37,168 INFO L438 stractBuchiCegarLoop]: Abstraction has 35 states and 67 transitions. [2025-04-26 16:23:37,168 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:37,168 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 67 transitions. [2025-04-26 16:23:37,168 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 16:23:37,169 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:37,169 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:37,169 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:37,169 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:37,169 INFO L752 eck$LassoCheckResult]: Stem: "[49] $Ultimate##0-->L42: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[43] L42-->L43: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[40] L43-->L44: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[34] L44-->L45: Formula: (<= 0 v_N1_3) InVars {N1=v_N1_3} OutVars{N1=v_N1_3} AuxVars[] AssignedVars[]" "[51] L45-->L46: Formula: (<= 0 v_N2_3) InVars {N2=v_N2_3} OutVars{N2=v_N2_3} AuxVars[] AssignedVars[]" "[64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L46-1-->L30-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]" "[55] L19-1-->L19: 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] L19-->L19-1: Formula: (and (= v_counter_8 (+ v_counter_9 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter=v_counter_9} OutVars{i1=v_i1_6, counter=v_counter_8} AuxVars[] AssignedVars[counter, i1]" "[54] L19-1-->thread1FINAL: Formula: (<= v_N1_2 v_i1_4) InVars {i1=v_i1_4, N1=v_N1_2} OutVars{i1=v_i1_4, N1=v_N1_2} AuxVars[] AssignedVars[]" [2025-04-26 16:23:37,169 INFO L754 eck$LassoCheckResult]: Loop: "[59] L30-1-->L30: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[61] L30-->L30-1: Formula: (and (= v_counter_17 (+ v_counter_16 1)) (= v_i2_10 (+ v_i2_11 1)) (< 0 v_counter_17)) InVars {i2=v_i2_11, counter=v_counter_17} OutVars{i2=v_i2_10, counter=v_counter_16} AuxVars[] AssignedVars[counter, i2]" [2025-04-26 16:23:37,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:37,170 INFO L85 PathProgramCache]: Analyzing trace with hash -622775629, now seen corresponding path program 1 times [2025-04-26 16:23:37,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:37,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406616867] [2025-04-26 16:23:37,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:37,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:37,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:37,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:37,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,175 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:37,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:37,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:37,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:37,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:37,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2025-04-26 16:23:37,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:37,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78707236] [2025-04-26 16:23:37,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:37,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:37,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:37,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:37,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:37,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:37,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:37,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:37,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:37,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:37,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1486923435, now seen corresponding path program 1 times [2025-04-26 16:23:37,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:37,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864674641] [2025-04-26 16:23:37,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:37,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:37,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:37,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:37,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,194 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:37,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:37,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:37,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:37,234 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:37,234 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:37,234 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:37,234 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:37,234 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:23:37,234 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,234 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:37,234 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:37,234 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:23:37,234 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:37,234 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:37,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,275 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:37,275 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:23:37,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:37,277 INFO L229 MonitoredProcess]: Starting monitored process 13 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:37,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:23:37,280 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:23:37,280 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:37,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:37,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:37,300 INFO L229 MonitoredProcess]: Starting monitored process 14 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:37,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:23:37,304 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:23:37,304 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:37,374 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:23:37,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:37,379 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:37,379 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:37,379 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:37,379 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:37,379 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:37,379 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,379 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:37,379 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:37,379 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:23:37,379 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:37,379 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:37,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,416 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:37,417 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:37,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:37,419 INFO L229 MonitoredProcess]: Starting monitored process 15 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:37,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:23:37,421 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:37,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:37,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:37,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:37,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:37,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:37,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:37,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:37,433 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:37,436 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:23:37,436 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:23:37,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:37,438 INFO L229 MonitoredProcess]: Starting monitored process 16 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:37,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:23:37,441 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:37,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:37,444 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:23:37,444 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:37,444 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N2, i2) = 1*N2 - 1*i2 Supporting invariants [] [2025-04-26 16:23:37,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:23:37,451 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:37,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:37,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:37,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:37,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:37,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:37,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:37,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:37,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:37,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:37,502 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:37,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:37,517 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:37,517 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:37,517 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 67 transitions. cyclomatic complexity: 41 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:37,544 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 67 transitions. cyclomatic complexity: 41. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 55 states and 103 transitions. Complement of second has 6 states. [2025-04-26 16:23:37,546 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:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2025-04-26 16:23:37,547 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:23:37,547 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:37,547 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:23:37,548 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:37,548 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:23:37,548 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:37,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 103 transitions. [2025-04-26 16:23:37,549 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 16:23:37,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 29 states and 53 transitions. [2025-04-26 16:23:37,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-04-26 16:23:37,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-04-26 16:23:37,549 INFO L74 IsDeterministic]: Start isDeterministic. Operand 29 states and 53 transitions. [2025-04-26 16:23:37,549 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:37,549 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 53 transitions. [2025-04-26 16:23:37,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 53 transitions. [2025-04-26 16:23:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-04-26 16:23:37,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (in total 53), 28 states have internal predecessors, (53), 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:37,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 53 transitions. [2025-04-26 16:23:37,553 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 53 transitions. [2025-04-26 16:23:37,553 INFO L438 stractBuchiCegarLoop]: Abstraction has 29 states and 53 transitions. [2025-04-26 16:23:37,553 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:23:37,553 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 53 transitions. [2025-04-26 16:23:37,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 16:23:37,554 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:37,554 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:37,554 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:37,554 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:37,554 INFO L752 eck$LassoCheckResult]: Stem: "[49] $Ultimate##0-->L42: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[43] L42-->L43: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[40] L43-->L44: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[34] L44-->L45: Formula: (<= 0 v_N1_3) InVars {N1=v_N1_3} OutVars{N1=v_N1_3} AuxVars[] AssignedVars[]" "[51] L45-->L46: Formula: (<= 0 v_N2_3) InVars {N2=v_N2_3} OutVars{N2=v_N2_3} AuxVars[] AssignedVars[]" "[64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L46-1-->L30-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]" "[55] L19-1-->L19: 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] L19-->L19-1: Formula: (and (= v_counter_8 (+ v_counter_9 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter=v_counter_9} OutVars{i1=v_i1_6, counter=v_counter_8} AuxVars[] AssignedVars[counter, i1]" "[55] L19-1-->L19: 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[]" [2025-04-26 16:23:37,554 INFO L754 eck$LassoCheckResult]: Loop: "[59] L30-1-->L30: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[61] L30-->L30-1: Formula: (and (= v_counter_17 (+ v_counter_16 1)) (= v_i2_10 (+ v_i2_11 1)) (< 0 v_counter_17)) InVars {i2=v_i2_11, counter=v_counter_17} OutVars{i2=v_i2_10, counter=v_counter_16} AuxVars[] AssignedVars[counter, i2]" [2025-04-26 16:23:37,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:37,555 INFO L85 PathProgramCache]: Analyzing trace with hash -622775628, now seen corresponding path program 1 times [2025-04-26 16:23:37,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:37,555 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201621823] [2025-04-26 16:23:37,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:37,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:37,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:37,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:37,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,565 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:37,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:37,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:37,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:37,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:37,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 3 times [2025-04-26 16:23:37,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:37,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111061584] [2025-04-26 16:23:37,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:37,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:37,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:37,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:37,578 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:37,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,578 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:37,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:37,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:37,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:37,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:37,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1486922474, now seen corresponding path program 1 times [2025-04-26 16:23:37,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:37,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464527380] [2025-04-26 16:23:37,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:37,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:37,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:37,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:37,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,591 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:37,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:37,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:37,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:37,618 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:37,618 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:37,618 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:37,618 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:37,618 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:23:37,618 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,618 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:37,618 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:37,618 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 16:23:37,618 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:37,618 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:37,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,653 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:37,653 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:23:37,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:37,655 INFO L229 MonitoredProcess]: Starting monitored process 17 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:37,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:23:37,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:23:37,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:37,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:37,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:37,676 INFO L229 MonitoredProcess]: Starting monitored process 18 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:37,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:23:37,679 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:23:37,679 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:37,701 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:23:37,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:37,706 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:37,706 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:37,706 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:37,706 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:37,706 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:37,706 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,706 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:37,706 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:37,706 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 16:23:37,706 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:37,706 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:37,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,738 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:37,738 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:37,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:37,741 INFO L229 MonitoredProcess]: Starting monitored process 19 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:37,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:23:37,743 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:37,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:37,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:37,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:37,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:37,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:37,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:37,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:37,757 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:37,759 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:23:37,759 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:23:37,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:37,761 INFO L229 MonitoredProcess]: Starting monitored process 20 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:37,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:23:37,764 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:37,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:37,770 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:23:37,770 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:37,770 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2025-04-26 16:23:37,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:23:37,777 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:37,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:37,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:37,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:37,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:37,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:37,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:37,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:37,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:37,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:37,816 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:37,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:37,817 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:37,818 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:23:37,818 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 53 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:37,826 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 53 transitions. cyclomatic complexity: 30. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 36 states and 63 transitions. Complement of second has 5 states. [2025-04-26 16:23:37,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:37,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:37,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-04-26 16:23:37,827 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:23:37,827 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:37,827 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:37,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:37,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:37,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:37,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:37,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:37,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:37,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:37,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:37,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:37,853 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:37,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:37,855 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:37,855 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:23:37,855 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 53 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:37,861 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 53 transitions. cyclomatic complexity: 30. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 36 states and 63 transitions. Complement of second has 5 states. [2025-04-26 16:23:37,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-04-26 16:23:37,862 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:23:37,862 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:37,862 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:37,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:37,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:37,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:37,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:37,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:37,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:37,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:37,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:37,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:37,890 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:37,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:37,892 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:37,893 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:23:37,893 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 53 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:37,905 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 53 transitions. cyclomatic complexity: 30. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 42 states and 76 transitions. Complement of second has 4 states. [2025-04-26 16:23:37,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:37,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:37,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2025-04-26 16:23:37,906 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:23:37,906 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:37,906 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:23:37,906 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:37,906 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:23:37,906 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:37,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 76 transitions. [2025-04-26 16:23:37,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-04-26 16:23:37,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 34 states and 58 transitions. [2025-04-26 16:23:37,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-04-26 16:23:37,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-04-26 16:23:37,908 INFO L74 IsDeterministic]: Start isDeterministic. Operand 34 states and 58 transitions. [2025-04-26 16:23:37,908 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:37,908 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 58 transitions. [2025-04-26 16:23:37,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 58 transitions. [2025-04-26 16:23:37,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2025-04-26 16:23:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.7692307692307692) internal successors, (in total 46), 25 states have internal predecessors, (46), 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:37,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 46 transitions. [2025-04-26 16:23:37,909 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 46 transitions. [2025-04-26 16:23:37,909 INFO L438 stractBuchiCegarLoop]: Abstraction has 26 states and 46 transitions. [2025-04-26 16:23:37,909 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:23:37,909 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 46 transitions. [2025-04-26 16:23:37,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-04-26 16:23:37,910 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:37,910 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:37,910 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:37,910 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:37,910 INFO L752 eck$LassoCheckResult]: Stem: "[49] $Ultimate##0-->L42: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[43] L42-->L43: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[40] L43-->L44: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[34] L44-->L45: Formula: (<= 0 v_N1_3) InVars {N1=v_N1_3} OutVars{N1=v_N1_3} AuxVars[] AssignedVars[]" "[51] L45-->L46: Formula: (<= 0 v_N2_3) InVars {N2=v_N2_3} OutVars{N2=v_N2_3} AuxVars[] AssignedVars[]" "[64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L46-1-->L30-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]" "[55] L19-1-->L19: 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] L19-->L19-1: Formula: (and (= v_counter_8 (+ v_counter_9 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter=v_counter_9} OutVars{i1=v_i1_6, counter=v_counter_8} AuxVars[] AssignedVars[counter, i1]" "[59] L30-1-->L30: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" [2025-04-26 16:23:37,910 INFO L754 eck$LassoCheckResult]: Loop: "[61] L30-->L30-1: Formula: (and (= v_counter_17 (+ v_counter_16 1)) (= v_i2_10 (+ v_i2_11 1)) (< 0 v_counter_17)) InVars {i2=v_i2_11, counter=v_counter_17} OutVars{i2=v_i2_10, counter=v_counter_16} AuxVars[] AssignedVars[counter, i2]" "[59] L30-1-->L30: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" [2025-04-26 16:23:37,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:37,911 INFO L85 PathProgramCache]: Analyzing trace with hash -622775624, now seen corresponding path program 1 times [2025-04-26 16:23:37,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:37,911 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522876139] [2025-04-26 16:23:37,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:37,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:37,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:37,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:37,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,915 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:37,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:37,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:37,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:37,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:37,918 INFO L85 PathProgramCache]: Analyzing trace with hash 2911, now seen corresponding path program 4 times [2025-04-26 16:23:37,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:37,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659978964] [2025-04-26 16:23:37,918 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:37,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:37,920 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-04-26 16:23:37,921 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:37,921 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:37,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:37,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:37,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:37,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:37,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:37,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1486918570, now seen corresponding path program 2 times [2025-04-26 16:23:37,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:37,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801736011] [2025-04-26 16:23:37,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:37,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:37,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-26 16:23:37,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:37,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:37,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:37,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:37,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:37,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:37,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:37,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:37,956 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:37,956 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:37,956 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:37,956 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:37,956 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:23:37,956 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,956 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:37,956 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:37,956 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_petrified1_Iteration5_Loop [2025-04-26 16:23:37,956 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:37,956 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:37,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:37,990 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:37,990 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:23:37,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:37,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:37,992 INFO L229 MonitoredProcess]: Starting monitored process 21 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:37,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:23:37,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:23:37,995 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:38,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:38,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,013 INFO L229 MonitoredProcess]: Starting monitored process 22 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:38,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:23:38,016 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:23:38,016 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:38,037 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:23:38,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:23:38,041 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:38,041 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:38,041 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:38,041 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:38,041 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:38,041 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,041 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:38,041 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:38,041 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_petrified1_Iteration5_Loop [2025-04-26 16:23:38,041 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:38,041 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:38,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,072 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:38,073 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:38,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,075 INFO L229 MonitoredProcess]: Starting monitored process 23 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:38,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:23:38,077 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:38,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:38,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:38,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:38,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:38,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:38,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:38,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:38,090 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:38,091 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:23:38,092 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:23:38,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,094 INFO L229 MonitoredProcess]: Starting monitored process 24 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:38,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:23:38,096 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:38,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:23:38,100 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:23:38,100 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:38,100 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2025-04-26 16:23:38,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:23:38,106 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:38,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:38,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:38,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:38,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:38,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:38,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:38,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:38,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:38,142 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:38,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:38,167 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:38,167 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:38,168 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 46 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:38,179 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 46 transitions. cyclomatic complexity: 24. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 56 states and 102 transitions. Complement of second has 5 states. [2025-04-26 16:23:38,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:38,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2025-04-26 16:23:38,180 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:23:38,181 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:38,181 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:23:38,181 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:38,181 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:23:38,181 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:38,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 102 transitions. [2025-04-26 16:23:38,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-04-26 16:23:38,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 46 states and 83 transitions. [2025-04-26 16:23:38,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-04-26 16:23:38,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-04-26 16:23:38,182 INFO L74 IsDeterministic]: Start isDeterministic. Operand 46 states and 83 transitions. [2025-04-26 16:23:38,182 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:38,182 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 83 transitions. [2025-04-26 16:23:38,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 83 transitions. [2025-04-26 16:23:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2025-04-26 16:23:38,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.935483870967742) internal successors, (in total 60), 30 states have internal predecessors, (60), 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:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 60 transitions. [2025-04-26 16:23:38,184 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 60 transitions. [2025-04-26 16:23:38,184 INFO L438 stractBuchiCegarLoop]: Abstraction has 31 states and 60 transitions. [2025-04-26 16:23:38,184 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:23:38,184 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 60 transitions. [2025-04-26 16:23:38,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-04-26 16:23:38,185 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:38,185 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:38,185 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:38,185 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:38,185 INFO L752 eck$LassoCheckResult]: Stem: "[49] $Ultimate##0-->L42: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[43] L42-->L43: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[40] L43-->L44: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[34] L44-->L45: Formula: (<= 0 v_N1_3) InVars {N1=v_N1_3} OutVars{N1=v_N1_3} AuxVars[] AssignedVars[]" "[51] L45-->L46: Formula: (<= 0 v_N2_3) InVars {N2=v_N2_3} OutVars{N2=v_N2_3} AuxVars[] AssignedVars[]" "[64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L46-1-->L30-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]" "[55] L19-1-->L19: 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[]" "[59] L30-1-->L30: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[57] L19-->L19-1: Formula: (and (= v_counter_8 (+ v_counter_9 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter=v_counter_9} OutVars{i1=v_i1_6, counter=v_counter_8} AuxVars[] AssignedVars[counter, i1]" "[61] L30-->L30-1: Formula: (and (= v_counter_17 (+ v_counter_16 1)) (= v_i2_10 (+ v_i2_11 1)) (< 0 v_counter_17)) InVars {i2=v_i2_11, counter=v_counter_17} OutVars{i2=v_i2_10, counter=v_counter_16} AuxVars[] AssignedVars[counter, i2]" [2025-04-26 16:23:38,185 INFO L754 eck$LassoCheckResult]: Loop: "[59] L30-1-->L30: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[61] L30-->L30-1: Formula: (and (= v_counter_17 (+ v_counter_16 1)) (= v_i2_10 (+ v_i2_11 1)) (< 0 v_counter_17)) InVars {i2=v_i2_11, counter=v_counter_17} OutVars{i2=v_i2_10, counter=v_counter_16} AuxVars[] AssignedVars[counter, i2]" [2025-04-26 16:23:38,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2126173239, now seen corresponding path program 3 times [2025-04-26 16:23:38,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83603630] [2025-04-26 16:23:38,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:38,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:38,190 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:38,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:38,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,191 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:38,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:38,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:38,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:38,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 5 times [2025-04-26 16:23:38,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646978870] [2025-04-26 16:23:38,194 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:23:38,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,197 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:38,197 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:38,197 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:38,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,197 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:38,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:38,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:38,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:38,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1151952107, now seen corresponding path program 4 times [2025-04-26 16:23:38,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233432086] [2025-04-26 16:23:38,200 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:38,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,204 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 13 statements into 2 equivalence classes. [2025-04-26 16:23:38,208 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:38,209 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-26 16:23:38,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:23:38,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:38,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233432086] [2025-04-26 16:23:38,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233432086] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:38,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:38,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:23:38,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949236464] [2025-04-26 16:23:38,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:38,265 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:38,266 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:38,266 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:38,266 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:38,266 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:23:38,266 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,266 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:38,266 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:38,266 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_petrified1_Iteration6_Loop [2025-04-26 16:23:38,266 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:38,266 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:38,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,297 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:38,297 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:23:38,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,299 INFO L229 MonitoredProcess]: Starting monitored process 25 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:38,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:23:38,301 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:23:38,301 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:38,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:23:38,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,322 INFO L229 MonitoredProcess]: Starting monitored process 26 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:38,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:23:38,323 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:23:38,323 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:38,344 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:23:38,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:23:38,348 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:38,348 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:38,348 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:38,348 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:38,348 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:38,348 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,348 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:38,348 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:38,348 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_petrified1_Iteration6_Loop [2025-04-26 16:23:38,348 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:38,348 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:38,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,381 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:38,381 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:38,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,383 INFO L229 MonitoredProcess]: Starting monitored process 27 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:38,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:23:38,386 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:38,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:38,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:38,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:38,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:38,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:38,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:38,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:38,399 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:38,401 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 16:23:38,401 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:23:38,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,404 INFO L229 MonitoredProcess]: Starting monitored process 28 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:38,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:23:38,406 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:38,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:38,410 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:23:38,410 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:38,410 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2025-04-26 16:23:38,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:23:38,417 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:38,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:38,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:38,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:38,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:38,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:38,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:38,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:38,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:38,456 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:38,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:38,458 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:38,459 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:23:38,459 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 60 transitions. cyclomatic complexity: 34 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:38,471 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 60 transitions. cyclomatic complexity: 34. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 58 states and 105 transitions. Complement of second has 5 states. [2025-04-26 16:23:38,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:38,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2025-04-26 16:23:38,472 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:23:38,472 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:38,472 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:23:38,472 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:38,472 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:23:38,472 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:38,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 105 transitions. [2025-04-26 16:23:38,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-04-26 16:23:38,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 48 states and 87 transitions. [2025-04-26 16:23:38,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-04-26 16:23:38,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-04-26 16:23:38,473 INFO L74 IsDeterministic]: Start isDeterministic. Operand 48 states and 87 transitions. [2025-04-26 16:23:38,473 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:38,473 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 87 transitions. [2025-04-26 16:23:38,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 87 transitions. [2025-04-26 16:23:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2025-04-26 16:23:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.8857142857142857) internal successors, (in total 66), 34 states have internal predecessors, (66), 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:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 66 transitions. [2025-04-26 16:23:38,476 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 66 transitions. [2025-04-26 16:23:38,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:38,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:23:38,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:23:38,476 INFO L87 Difference]: Start difference. First operand 35 states and 66 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 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:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:38,489 INFO L93 Difference]: Finished difference Result 72 states and 132 transitions. [2025-04-26 16:23:38,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 132 transitions. [2025-04-26 16:23:38,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-04-26 16:23:38,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 66 states and 123 transitions. [2025-04-26 16:23:38,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-04-26 16:23:38,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-04-26 16:23:38,490 INFO L74 IsDeterministic]: Start isDeterministic. Operand 66 states and 123 transitions. [2025-04-26 16:23:38,490 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:38,490 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 123 transitions. [2025-04-26 16:23:38,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 123 transitions. [2025-04-26 16:23:38,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2025-04-26 16:23:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.9298245614035088) internal successors, (in total 110), 56 states have internal predecessors, (110), 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:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 110 transitions. [2025-04-26 16:23:38,493 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 110 transitions. [2025-04-26 16:23:38,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:23:38,494 INFO L438 stractBuchiCegarLoop]: Abstraction has 57 states and 110 transitions. [2025-04-26 16:23:38,494 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:23:38,494 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 110 transitions. [2025-04-26 16:23:38,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-04-26 16:23:38,495 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:38,495 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:38,495 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:38,495 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:38,495 INFO L752 eck$LassoCheckResult]: Stem: "[49] $Ultimate##0-->L42: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[43] L42-->L43: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[40] L43-->L44: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[34] L44-->L45: Formula: (<= 0 v_N1_3) InVars {N1=v_N1_3} OutVars{N1=v_N1_3} AuxVars[] AssignedVars[]" "[51] L45-->L46: Formula: (<= 0 v_N2_3) InVars {N2=v_N2_3} OutVars{N2=v_N2_3} AuxVars[] AssignedVars[]" "[64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L46-1-->L30-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]" "[55] L19-1-->L19: 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] L19-->L19-1: Formula: (and (= v_counter_8 (+ v_counter_9 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter=v_counter_9} OutVars{i1=v_i1_6, counter=v_counter_8} AuxVars[] AssignedVars[counter, i1]" "[55] L19-1-->L19: 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] L19-->L19-1: Formula: (and (= v_counter_8 (+ v_counter_9 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter=v_counter_9} OutVars{i1=v_i1_6, counter=v_counter_8} AuxVars[] AssignedVars[counter, i1]" "[55] L19-1-->L19: 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[]" "[59] L30-1-->L30: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[61] L30-->L30-1: Formula: (and (= v_counter_17 (+ v_counter_16 1)) (= v_i2_10 (+ v_i2_11 1)) (< 0 v_counter_17)) InVars {i2=v_i2_11, counter=v_counter_17} OutVars{i2=v_i2_10, counter=v_counter_16} AuxVars[] AssignedVars[counter, i2]" "[57] L19-->L19-1: Formula: (and (= v_counter_8 (+ v_counter_9 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter=v_counter_9} OutVars{i1=v_i1_6, counter=v_counter_8} AuxVars[] AssignedVars[counter, i1]" "[59] L30-1-->L30: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" [2025-04-26 16:23:38,495 INFO L754 eck$LassoCheckResult]: Loop: "[61] L30-->L30-1: Formula: (and (= v_counter_17 (+ v_counter_16 1)) (= v_i2_10 (+ v_i2_11 1)) (< 0 v_counter_17)) InVars {i2=v_i2_11, counter=v_counter_17} OutVars{i2=v_i2_10, counter=v_counter_16} AuxVars[] AssignedVars[counter, i2]" "[59] L30-1-->L30: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" [2025-04-26 16:23:38,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,496 INFO L85 PathProgramCache]: Analyzing trace with hash -67345962, now seen corresponding path program 5 times [2025-04-26 16:23:38,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366189309] [2025-04-26 16:23:38,496 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:23:38,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,498 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 4 equivalence classes. [2025-04-26 16:23:38,501 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:38,501 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-26 16:23:38,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,501 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:38,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:38,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:38,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:38,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2911, now seen corresponding path program 6 times [2025-04-26 16:23:38,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874569185] [2025-04-26 16:23:38,507 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:23:38,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,510 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:38,510 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:38,511 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:23:38,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:38,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:38,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:38,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:38,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,515 INFO L85 PathProgramCache]: Analyzing trace with hash -294958092, now seen corresponding path program 6 times [2025-04-26 16:23:38,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39868428] [2025-04-26 16:23:38,516 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:23:38,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,518 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 4 equivalence classes. [2025-04-26 16:23:38,523 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:23:38,524 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-26 16:23:38,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:38,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:23:38,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:23:38,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:38,557 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:38,557 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:38,557 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:38,558 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:38,558 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:23:38,558 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,558 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:38,558 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:38,558 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_petrified1_Iteration7_Loop [2025-04-26 16:23:38,558 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:38,558 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:38,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,583 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:38,583 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:23:38,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,585 INFO L229 MonitoredProcess]: Starting monitored process 29 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:38,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:23:38,587 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:23:38,587 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:38,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:23:38,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,605 INFO L229 MonitoredProcess]: Starting monitored process 30 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:38,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:23:38,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:23:38,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:38,629 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:23:38,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:38,634 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:38,634 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:38,634 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:38,634 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:38,634 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:38,634 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,634 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:38,634 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:38,634 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_petrified1_Iteration7_Loop [2025-04-26 16:23:38,634 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:38,634 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:38,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,660 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:38,661 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:38,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,663 INFO L229 MonitoredProcess]: Starting monitored process 31 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:38,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:23:38,664 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:38,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:38,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:38,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:38,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:38,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:38,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:38,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:38,678 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:38,680 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 16:23:38,680 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:23:38,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,682 INFO L229 MonitoredProcess]: Starting monitored process 32 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:38,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:23:38,684 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:38,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:38,688 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:23:38,688 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:38,688 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2025-04-26 16:23:38,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:23:38,694 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:38,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:38,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:38,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:38,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:38,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:38,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:38,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:38,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:38,729 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:38,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:38,740 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:38,741 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:38,741 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 110 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 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:23:38,758 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 110 transitions. cyclomatic complexity: 60. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 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) Result 89 states and 164 transitions. Complement of second has 5 states. [2025-04-26 16:23:38,758 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 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:23:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2025-04-26 16:23:38,759 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 16:23:38,759 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:38,759 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:38,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:38,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:38,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:38,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:38,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:38,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:38,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:38,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:38,809 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:38,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:38,818 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:38,819 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:38,819 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 110 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 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:23:38,837 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 110 transitions. cyclomatic complexity: 60. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 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) Result 114 states and 209 transitions. Complement of second has 7 states. [2025-04-26 16:23:38,838 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:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 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:23:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2025-04-26 16:23:38,838 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 16:23:38,838 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:38,839 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 18 letters. Loop has 2 letters. [2025-04-26 16:23:38,839 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:38,839 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 16 letters. Loop has 4 letters. [2025-04-26 16:23:38,839 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:38,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 209 transitions. [2025-04-26 16:23:38,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-04-26 16:23:38,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 103 states and 193 transitions. [2025-04-26 16:23:38,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-04-26 16:23:38,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-04-26 16:23:38,841 INFO L74 IsDeterministic]: Start isDeterministic. Operand 103 states and 193 transitions. [2025-04-26 16:23:38,841 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:38,841 INFO L218 hiAutomatonCegarLoop]: Abstraction has 103 states and 193 transitions. [2025-04-26 16:23:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 193 transitions. [2025-04-26 16:23:38,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2025-04-26 16:23:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 2.0240963855421685) internal successors, (in total 168), 82 states have internal predecessors, (168), 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:38,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 168 transitions. [2025-04-26 16:23:38,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 168 transitions. [2025-04-26 16:23:38,847 INFO L438 stractBuchiCegarLoop]: Abstraction has 83 states and 168 transitions. [2025-04-26 16:23:38,847 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:23:38,847 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 168 transitions. [2025-04-26 16:23:38,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-04-26 16:23:38,848 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:38,848 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:38,848 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:38,848 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:38,848 INFO L752 eck$LassoCheckResult]: Stem: "[49] $Ultimate##0-->L42: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[43] L42-->L43: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[40] L43-->L44: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[34] L44-->L45: Formula: (<= 0 v_N1_3) InVars {N1=v_N1_3} OutVars{N1=v_N1_3} AuxVars[] AssignedVars[]" "[51] L45-->L46: Formula: (<= 0 v_N2_3) InVars {N2=v_N2_3} OutVars{N2=v_N2_3} AuxVars[] AssignedVars[]" "[64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L46-1-->L30-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]" "[55] L19-1-->L19: 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] L19-->L19-1: Formula: (and (= v_counter_8 (+ v_counter_9 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter=v_counter_9} OutVars{i1=v_i1_6, counter=v_counter_8} AuxVars[] AssignedVars[counter, i1]" "[55] L19-1-->L19: 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[]" "[59] L30-1-->L30: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[57] L19-->L19-1: Formula: (and (= v_counter_8 (+ v_counter_9 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter=v_counter_9} OutVars{i1=v_i1_6, counter=v_counter_8} AuxVars[] AssignedVars[counter, i1]" "[55] L19-1-->L19: 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[]" "[61] L30-->L30-1: Formula: (and (= v_counter_17 (+ v_counter_16 1)) (= v_i2_10 (+ v_i2_11 1)) (< 0 v_counter_17)) InVars {i2=v_i2_11, counter=v_counter_17} OutVars{i2=v_i2_10, counter=v_counter_16} AuxVars[] AssignedVars[counter, i2]" "[57] L19-->L19-1: Formula: (and (= v_counter_8 (+ v_counter_9 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter=v_counter_9} OutVars{i1=v_i1_6, counter=v_counter_8} AuxVars[] AssignedVars[counter, i1]" "[59] L30-1-->L30: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" [2025-04-26 16:23:38,848 INFO L754 eck$LassoCheckResult]: Loop: "[61] L30-->L30-1: Formula: (and (= v_counter_17 (+ v_counter_16 1)) (= v_i2_10 (+ v_i2_11 1)) (< 0 v_counter_17)) InVars {i2=v_i2_11, counter=v_counter_17} OutVars{i2=v_i2_10, counter=v_counter_16} AuxVars[] AssignedVars[counter, i2]" "[59] L30-1-->L30: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" [2025-04-26 16:23:38,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,849 INFO L85 PathProgramCache]: Analyzing trace with hash -8359782, now seen corresponding path program 7 times [2025-04-26 16:23:38,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183191249] [2025-04-26 16:23:38,849 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:23:38,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:38,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:38,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,854 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:38,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:38,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:38,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:38,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2911, now seen corresponding path program 7 times [2025-04-26 16:23:38,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431846403] [2025-04-26 16:23:38,863 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:23:38,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:38,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:38,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:38,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:38,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:38,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:38,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,869 INFO L85 PathProgramCache]: Analyzing trace with hash 556186040, now seen corresponding path program 8 times [2025-04-26 16:23:38,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893170647] [2025-04-26 16:23:38,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:38,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-26 16:23:38,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:23:38,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:38,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,876 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:38,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:23:38,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:23:38,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:38,905 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:38,905 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:38,905 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:38,905 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:38,905 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:23:38,905 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,905 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:38,905 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:38,905 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_petrified1_Iteration8_Loop [2025-04-26 16:23:38,905 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:38,905 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:38,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:38,947 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:38,947 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:23:38,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,952 INFO L229 MonitoredProcess]: Starting monitored process 33 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:38,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:23:38,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:23:38,954 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:38,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:23:38,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:38,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:38,971 INFO L229 MonitoredProcess]: Starting monitored process 34 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:38,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:23:38,973 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:23:38,973 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:39,029 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:23:39,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:23:39,034 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:39,034 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:39,034 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:39,034 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:39,034 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:39,034 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,034 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:39,034 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:39,035 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_petrified1_Iteration8_Loop [2025-04-26 16:23:39,035 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:39,035 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:39,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,060 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:39,060 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:39,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:39,063 INFO L229 MonitoredProcess]: Starting monitored process 35 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:39,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:23:39,065 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:39,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:39,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:39,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:39,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:39,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:39,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:39,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:39,077 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:39,079 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:23:39,079 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:23:39,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:39,081 INFO L229 MonitoredProcess]: Starting monitored process 36 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:39,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:23:39,083 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:39,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:39,086 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:23:39,086 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:39,086 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N2, i2) = 1*N2 - 1*i2 Supporting invariants [] [2025-04-26 16:23:39,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:39,092 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:39,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:39,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:39,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:39,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:39,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:39,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:39,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:39,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:39,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:39,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:39,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:39,126 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:39,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:39,132 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:39,132 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:39,132 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 168 transitions. cyclomatic complexity: 96 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 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:23:39,152 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 168 transitions. cyclomatic complexity: 96. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 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) Result 139 states and 284 transitions. Complement of second has 6 states. [2025-04-26 16:23:39,153 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:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 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:23:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2025-04-26 16:23:39,154 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 16:23:39,154 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:39,154 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 2 letters. [2025-04-26 16:23:39,154 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:39,154 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2025-04-26 16:23:39,154 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:39,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 284 transitions. [2025-04-26 16:23:39,156 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:39,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 0 states and 0 transitions. [2025-04-26 16:23:39,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:23:39,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:23:39,156 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:23:39,156 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:39,156 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:39,156 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:39,156 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:39,156 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:23:39,156 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:23:39,156 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:39,156 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:23:39,163 INFO L201 PluginConnector]: Adding new model figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:39 BoogieIcfgContainer [2025-04-26 16:23:39,163 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:39,164 INFO L158 Benchmark]: Toolchain (without parser) took 3503.62ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 86.2MB in the beginning and 94.5MB in the end (delta: -8.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:39,164 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:39,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.63ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 84.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:39,166 INFO L158 Benchmark]: Boogie Preprocessor took 15.14ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 83.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:39,166 INFO L158 Benchmark]: RCFGBuilder took 164.94ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 73.9MB in the end (delta: 9.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:23:39,166 INFO L158 Benchmark]: BuchiAutomizer took 3286.23ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.9MB in the beginning and 94.5MB in the end (delta: -20.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:39,168 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.13ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.63ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 84.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 15.14ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 83.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 164.94ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 73.9MB in the end (delta: 9.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3286.23ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.9MB in the beginning and 94.5MB in the end (delta: -20.6MB). 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 3.1s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 2.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 75 StatesRemovedByMinimization, 7 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 [6, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 168 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 165 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 131 IncrementalHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 121 mSDtfsCounter, 131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax100 hnf100 lsp61 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (2 trivial, 7 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N1 + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function counter and consists of 3 locations. One deterministic module has affine ranking function -1 * i2 + N2 and consists of 4 locations. One deterministic module has affine ranking function counter and consists of 3 locations. One deterministic module has affine ranking function counter and consists of 3 locations. One deterministic module has affine ranking function counter and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + N2 and consists of 4 locations. One nondeterministic module has affine ranking function counter and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these 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:39,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...