/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/figure1.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:32,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:32,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:32,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:32,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:32,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:32,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:32,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:32,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:32,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:32,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:32,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:32,592 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:32,592 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:32,592 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:32,592 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:32,592 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:32,592 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:32,592 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:32,592 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:32,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:32,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:32,593 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:32,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:32,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:32,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:32,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:32,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:32,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:32,593 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:32,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:32,593 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:32,593 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:32,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:32,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:32,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:32,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:32,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:32,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:32,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:32,595 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:32,595 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:32,595 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:32,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:32,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:32,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:32,865 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:32,866 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:32,868 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.wvr.bpl [2025-04-26 18:41:32,868 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/figure1.wvr.bpl' [2025-04-26 18:41:32,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:32,886 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:32,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:32,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:32,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:32,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:32" (1/1) ... [2025-04-26 18:41:32,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:32" (1/1) ... [2025-04-26 18:41:32,924 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:32,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:32,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:32,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:32,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:32,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:32" (1/1) ... [2025-04-26 18:41:32,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:32" (1/1) ... [2025-04-26 18:41:32,932 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:32" (1/1) ... [2025-04-26 18:41:32,932 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:32" (1/1) ... [2025-04-26 18:41:32,933 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:32" (1/1) ... [2025-04-26 18:41:32,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:32" (1/1) ... [2025-04-26 18:41:32,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:32" (1/1) ... [2025-04-26 18:41:32,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:32" (1/1) ... [2025-04-26 18:41:32,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:32" (1/1) ... [2025-04-26 18:41:32,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:32,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:32,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:32,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:32,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:32" (1/1) ... [2025-04-26 18:41:32,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:32,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:41:32,997 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:32,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:32,997 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:32,998 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:32,998 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:32,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:32,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:32,998 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 18:41:33,034 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:33,036 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:33,111 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:33,111 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:33,133 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:33,134 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:33,135 INFO L201 PluginConnector]: Adding new model figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:33 BoogieIcfgContainer [2025-04-26 18:41:33,135 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:33,136 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:33,136 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:33,140 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:33,141 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:33,141 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:32" (1/2) ... [2025-04-26 18:41:33,142 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@348a3954 and model type figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:33, skipping insertion in model container [2025-04-26 18:41:33,142 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:33,142 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:33" (2/2) ... [2025-04-26 18:41:33,143 INFO L376 chiAutomizerObserver]: Analyzing ICFG figure1.wvr.bpl [2025-04-26 18:41:33,183 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:41:33,215 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:33,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:33,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:33,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:41:33,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 24 transitions, 62 flow [2025-04-26 18:41:33,274 INFO L116 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-04-26 18:41:33,276 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:41:33,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 2/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-26 18:41:33,279 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 24 transitions, 62 flow [2025-04-26 18:41:33,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 20 transitions, 52 flow [2025-04-26 18:41:33,282 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 25 places, 20 transitions, 52 flow [2025-04-26 18:41:33,283 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 20 transitions, 52 flow [2025-04-26 18:41:33,293 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 34 states, 32 states have (on average 1.8125) internal successors, (in total 58), 33 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 18:41:33,294 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 34 states, 32 states have (on average 1.8125) internal successors, (in total 58), 33 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 18:41:33,297 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:33,345 WARN L140 AmpleReduction]: Number of pruned transitions: 10 [2025-04-26 18:41:33,345 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:33,345 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 6 [2025-04-26 18:41:33,345 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:18 [2025-04-26 18:41:33,345 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:9 [2025-04-26 18:41:33,345 WARN L145 AmpleReduction]: Times succ was already a loop node:10 [2025-04-26 18:41:33,346 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:41:33,346 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:33,346 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 34 states, 32 states have (on average 1.5) internal successors, (in total 48), 33 states have internal predecessors, (48), 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 18:41:33,351 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:33,351 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:33,351 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:33,351 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:33,351 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:33,351 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:33,351 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:33,352 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:33,353 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 32 states have (on average 1.5) internal successors, (in total 48), 33 states have internal predecessors, (48), 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 18:41:33,364 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 18:41:33,365 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:33,365 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:33,368 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:33,368 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:33,368 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:33,370 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 32 states have (on average 1.5) internal successors, (in total 48), 33 states have internal predecessors, (48), 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 18:41:33,372 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 18:41:33,372 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:33,373 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:33,373 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:33,373 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:33,377 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L42: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[41] L42-->L43: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[36] L43-->L44: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[33] L44-->L45: Formula: (= v_N2_3 v_N1_3) InVars {N2=v_N2_3, N1=v_N1_3} OutVars{N2=v_N2_3, N1=v_N1_3} AuxVars[] AssignedVars[]" "[62] L45-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:41:33,377 INFO L754 eck$LassoCheckResult]: Loop: "[53] 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[]" "[55] 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 18:41:33,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:33,383 INFO L85 PathProgramCache]: Analyzing trace with hash 72368229, now seen corresponding path program 1 times [2025-04-26 18:41:33,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:33,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674560349] [2025-04-26 18:41:33,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:33,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:33,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:33,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:33,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,442 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:33,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:33,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:33,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:33,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:33,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2659, now seen corresponding path program 1 times [2025-04-26 18:41:33,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:33,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171467892] [2025-04-26 18:41:33,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:33,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:33,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:33,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:33,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,478 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:33,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:33,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:33,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:33,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:33,486 INFO L85 PathProgramCache]: Analyzing trace with hash 826393031, now seen corresponding path program 1 times [2025-04-26 18:41:33,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:33,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026807085] [2025-04-26 18:41:33,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:33,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:33,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:33,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:33,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,496 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:33,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:33,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:33,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:33,585 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:33,586 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:33,586 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:33,586 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:33,586 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:33,586 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,586 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:33,586 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:33,587 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:41:33,587 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:33,587 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:33,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:33,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:33,657 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:33,657 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:33,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,660 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 18:41:33,661 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 18:41:33,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:33,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:33,680 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 18:41:33,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,682 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 18:41:33,683 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 18:41:33,684 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:33,684 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:33,712 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:41:33,712 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 18:41:33,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:41:33,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,720 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 18:41:33,721 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 18:41:33,721 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:33,722 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:33,738 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 18:41:33,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,740 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 18:41:33,741 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 18:41:33,742 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:33,742 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:33,821 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:33,828 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 18:41:33,829 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:33,829 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:33,829 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:33,829 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:33,829 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:33,830 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,833 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:33,835 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:33,835 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:41:33,835 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:33,835 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:33,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:33,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:33,894 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:33,897 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:33,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,900 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 18:41:33,902 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 18:41:33,903 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 18:41:33,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:33,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:33,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:33,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:33,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:33,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:33,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:33,921 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:33,926 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 18:41:33,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,928 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 18:41:33,929 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 18:41:33,930 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 18:41:33,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:33,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:33,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:33,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:33,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:33,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:33,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:33,943 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:33,947 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:41:33,947 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:41:33,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,950 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 18:41:33,951 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 18:41:33,952 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:33,956 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 18:41:33,956 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:33,956 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:33,957 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N1, i1) = 1*N1 - 1*i1 Supporting invariants [] [2025-04-26 18:41:33,964 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 18:41:33,969 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:33,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:33,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:33,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:33,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:33,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:33,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:34,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:34,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:34,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:34,015 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:34,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:34,036 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 18:41:34,051 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 18:41:34,052 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 34 states, 32 states have (on average 1.5) internal successors, (in total 48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:34,116 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 34 states, 32 states have (on average 1.5) internal successors, (in total 48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 68 states and 103 transitions. Complement of second has 7 states. [2025-04-26 18:41:34,117 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 18:41:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:34,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2025-04-26 18:41:34,123 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:41:34,124 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:34,124 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:41:34,124 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:34,124 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:41:34,124 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:34,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 103 transitions. [2025-04-26 18:41:34,128 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:41:34,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 24 states and 35 transitions. [2025-04-26 18:41:34,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-04-26 18:41:34,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-04-26 18:41:34,132 INFO L74 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2025-04-26 18:41:34,132 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:34,133 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2025-04-26 18:41:34,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2025-04-26 18:41:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-04-26 18:41:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (in total 32), 21 states have internal predecessors, (32), 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 18:41:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2025-04-26 18:41:34,149 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 32 transitions. [2025-04-26 18:41:34,149 INFO L438 stractBuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2025-04-26 18:41:34,149 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:34,149 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2025-04-26 18:41:34,150 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:41:34,150 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:34,150 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:34,150 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:34,150 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:34,151 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L42: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[41] L42-->L43: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[36] L43-->L44: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[33] L44-->L45: Formula: (= v_N2_3 v_N1_3) InVars {N2=v_N2_3, N1=v_N1_3} OutVars{N2=v_N2_3, N1=v_N1_3} AuxVars[] AssignedVars[]" "[62] L45-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[52] 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[]" "[54] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[65] L45-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 18:41:34,151 INFO L754 eck$LassoCheckResult]: Loop: "[57] 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[]" "[59] 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 18:41:34,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:34,151 INFO L85 PathProgramCache]: Analyzing trace with hash -151620742, now seen corresponding path program 1 times [2025-04-26 18:41:34,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:34,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805342644] [2025-04-26 18:41:34,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:34,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:34,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:34,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:34,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:34,155 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:34,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:34,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:34,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:34,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:34,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:34,159 INFO L85 PathProgramCache]: Analyzing trace with hash 2787, now seen corresponding path program 1 times [2025-04-26 18:41:34,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:34,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828860332] [2025-04-26 18:41:34,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:34,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:34,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:34,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:34,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:34,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:34,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:34,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:34,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:34,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:34,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:34,165 INFO L85 PathProgramCache]: Analyzing trace with hash 321356828, now seen corresponding path program 1 times [2025-04-26 18:41:34,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:34,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468094350] [2025-04-26 18:41:34,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:34,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:34,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:34,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:34,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:34,208 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 18:41:34,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:34,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468094350] [2025-04-26 18:41:34,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468094350] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:34,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:34,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:41:34,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566690923] [2025-04-26 18:41:34,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:34,246 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:34,246 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:34,246 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:34,246 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:34,246 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:34,246 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,246 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:34,246 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:34,246 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:41:34,246 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:34,246 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:34,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:34,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:34,286 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:34,286 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:34,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:34,288 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 18:41:34,290 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 18:41:34,291 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:34,291 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:34,308 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 18:41:34,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:34,311 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 18:41:34,312 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 18:41:34,312 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:34,312 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:34,335 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:34,342 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 18:41:34,342 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:34,342 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:34,342 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:34,342 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:34,342 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:34,342 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,342 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:34,342 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:34,342 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:41:34,342 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:34,342 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:34,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:34,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:34,388 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:34,388 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:34,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:34,390 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 18:41:34,391 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 18:41:34,392 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 18:41:34,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:34,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:34,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:34,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:34,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:34,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:34,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:34,407 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:34,409 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 18:41:34,409 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:41:34,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:34,412 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 18:41:34,414 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 18:41:34,415 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:34,418 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:41:34,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:41:34,422 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:34,422 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:34,422 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2025-04-26 18:41:34,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:34,429 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:34,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:34,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:34,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:34,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:34,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:34,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:34,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:34,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:34,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:34,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:34,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:34,470 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 18:41:34,471 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 18:41:34,471 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 32 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 18:41:34,486 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 32 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 31 states and 43 transitions. Complement of second has 5 states. [2025-04-26 18:41:34,487 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 18:41:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 18:41:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2025-04-26 18:41:34,488 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:41:34,488 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:34,488 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:41:34,488 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:34,488 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:41:34,488 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:34,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 43 transitions. [2025-04-26 18:41:34,489 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:41:34,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 29 transitions. [2025-04-26 18:41:34,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-04-26 18:41:34,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-04-26 18:41:34,489 INFO L74 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2025-04-26 18:41:34,490 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:34,490 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2025-04-26 18:41:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2025-04-26 18:41:34,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-04-26 18:41:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (in total 28), 19 states have internal predecessors, (28), 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 18:41:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2025-04-26 18:41:34,491 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 28 transitions. [2025-04-26 18:41:34,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:34,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:41:34,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:41:34,493 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 18:41:34,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:34,505 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2025-04-26 18:41:34,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2025-04-26 18:41:34,505 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:41:34,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 31 transitions. [2025-04-26 18:41:34,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-04-26 18:41:34,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-04-26 18:41:34,506 INFO L74 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2025-04-26 18:41:34,506 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:34,506 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2025-04-26 18:41:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2025-04-26 18:41:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-04-26 18:41:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (in total 28), 19 states have internal predecessors, (28), 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 18:41:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2025-04-26 18:41:34,507 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 28 transitions. [2025-04-26 18:41:34,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:41:34,509 INFO L438 stractBuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2025-04-26 18:41:34,510 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:34,510 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2025-04-26 18:41:34,510 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:41:34,510 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:34,510 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:34,510 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:34,510 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:34,511 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L42: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[41] L42-->L43: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[36] L43-->L44: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[33] L44-->L45: Formula: (= v_N2_3 v_N1_3) InVars {N2=v_N2_3, N1=v_N1_3} OutVars{N2=v_N2_3, N1=v_N1_3} AuxVars[] AssignedVars[]" "[62] L45-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[53] 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[]" "[65] L45-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-->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]" "[52] 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 18:41:34,511 INFO L754 eck$LassoCheckResult]: Loop: "[57] 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[]" "[59] 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 18:41:34,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:34,511 INFO L85 PathProgramCache]: Analyzing trace with hash -405235602, now seen corresponding path program 1 times [2025-04-26 18:41:34,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:34,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338820150] [2025-04-26 18:41:34,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:34,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:34,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:34,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:34,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:34,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:34,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:34,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:34,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:34,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:34,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:34,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2787, now seen corresponding path program 2 times [2025-04-26 18:41:34,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:34,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257162708] [2025-04-26 18:41:34,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:34,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:34,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:34,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:34,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:34,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:34,532 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:34,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:34,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:34,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:34,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:34,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:34,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1410612240, now seen corresponding path program 1 times [2025-04-26 18:41:34,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:34,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717500274] [2025-04-26 18:41:34,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:34,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:34,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:34,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:34,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:34,540 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:34,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:34,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:34,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:34,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:34,577 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:34,577 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:34,577 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:34,577 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:34,577 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:34,577 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,577 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:34,577 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:34,577 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:41:34,577 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:34,577 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:34,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:34,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:34,607 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:34,608 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:34,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:34,610 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 18:41:34,611 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 18:41:34,613 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:34,613 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:34,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:41:34,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:34,635 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 18:41:34,637 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 18:41:34,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:34,638 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:34,704 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:34,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:34,709 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:34,709 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:34,709 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:34,709 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:34,709 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:34,709 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,709 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:34,709 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:34,709 INFO L132 ssoRankerPreferences]: Filename of dumped script: figure1.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:41:34,709 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:34,709 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:34,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:34,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:34,738 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:34,739 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:34,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:34,740 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 18:41:34,742 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 18:41:34,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 18:41:34,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:34,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:34,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:34,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:34,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:34,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:34,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:34,757 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:34,762 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:41:34,762 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:41:34,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:34,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:34,768 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 18:41:34,769 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 18:41:34,769 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:34,772 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:41:34,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:41:34,773 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:34,773 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:34,773 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N2, i2) = 1*N2 - 1*i2 Supporting invariants [] [2025-04-26 18:41:34,778 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 18:41:34,779 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:34,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:34,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:34,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:34,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:34,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:34,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:34,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:34,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:34,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:34,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:34,823 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:34,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:34,837 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 18:41:34,838 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 18:41:34,838 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 18:41:34,865 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 38 states and 53 transitions. Complement of second has 6 states. [2025-04-26 18:41:34,865 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 18:41:34,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 18:41:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2025-04-26 18:41:34,866 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:41:34,866 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:34,866 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:41:34,866 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:34,866 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:41:34,867 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:34,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2025-04-26 18:41:34,867 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:34,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2025-04-26 18:41:34,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:34,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:34,867 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:34,868 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:34,868 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:34,868 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:34,868 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:34,868 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:34,868 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:34,868 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:34,868 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:34,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:34,878 INFO L201 PluginConnector]: Adding new model figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:34 BoogieIcfgContainer [2025-04-26 18:41:34,878 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:34,879 INFO L158 Benchmark]: Toolchain (without parser) took 1993.36ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 85.2MB in the beginning and 44.2MB in the end (delta: 41.0MB). Peak memory consumption was 21.6MB. Max. memory is 8.0GB. [2025-04-26 18:41:34,879 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.70ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:34,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.24ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 83.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:34,880 INFO L158 Benchmark]: Boogie Preprocessor took 20.18ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 82.4MB in the end (delta: 910.0kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:41:34,880 INFO L158 Benchmark]: RCFGBuilder took 185.98ms. Allocated memory is still 159.4MB. Free memory was 82.3MB in the beginning and 73.2MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:34,880 INFO L158 Benchmark]: BuchiAutomizer took 1742.76ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.1MB in the beginning and 44.2MB in the end (delta: 28.9MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2025-04-26 18:41:34,881 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.70ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.24ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 83.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 20.18ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 82.4MB in the end (delta: 910.0kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 185.98ms. Allocated memory is still 159.4MB. Free memory was 82.3MB in the beginning and 73.2MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1742.76ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.1MB in the beginning and 44.2MB in the end (delta: 28.9MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 35 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax100 hnf100 lsp63 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 134, Number of transitions in reduction automaton: 48, Number of states in reduction automaton: 34, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N1 + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function counter and consists of 3 locations. One deterministic module has affine ranking function -1 * i2 + N2 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:34,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...