/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf --buchiautomizer.automaton.type.for.concurrent.programs PARTIAL_ORDER_BA -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/3_thr/me1-1p2c.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:49:04,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:49:04,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:49:04,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:49:04,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:49:04,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:49:04,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:49:04,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:49:04,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:49:04,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:49:04,114 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:49:04,115 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:49:04,115 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:49:04,115 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:49:04,115 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:49:04,115 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:49:04,115 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:49:04,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:49:04,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:49:04,115 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:49:04,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:49:04,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:49:04,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:49:04,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:49:04,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:49:04,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:49:04,115 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:49:04,116 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:49:04,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:49:04,116 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:49:04,116 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:49:04,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:49:04,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:49:04,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:49:04,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:49:04,116 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:49:04,116 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> PARTIAL_ORDER_BA [2025-02-17 22:49:04,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:49:04,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:49:04,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:49:04,335 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:49:04,339 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:49:04,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/me1-1p2c.c.bpl [2025-02-17 22:49:04,340 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/me1-1p2c.c.bpl' [2025-02-17 22:49:04,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:49:04,356 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:49:04,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:04,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:49:04,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:49:04,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,373 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:49:04,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:04,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:49:04,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:49:04,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:49:04,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,383 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:49:04,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:49:04,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:49:04,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:49:04,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:04,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:04,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:04,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-17 22:49:04,446 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:49:04,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:49:04,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:49:04,447 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:49:04,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:49:04,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:49:04,447 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:49:04,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:49:04,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:49:04,447 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:49:04,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:49:04,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:49:04,448 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:49:04,485 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:49:04,486 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:49:04,547 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:49:04,548 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:49:04,563 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:49:04,563 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:49:04,563 INFO L201 PluginConnector]: Adding new model me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:04 BoogieIcfgContainer [2025-02-17 22:49:04,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:49:04,564 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:49:04,564 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:49:04,571 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:49:04,571 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:04,571 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/2) ... [2025-02-17 22:49:04,573 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16c21db6 and model type me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:49:04, skipping insertion in model container [2025-02-17 22:49:04,573 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:04,573 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:04" (2/2) ... [2025-02-17 22:49:04,574 INFO L363 chiAutomizerObserver]: Analyzing ICFG me1-1p2c.c.bpl [2025-02-17 22:49:04,633 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-17 22:49:04,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 79 flow [2025-02-17 22:49:04,696 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-02-17 22:49:04,701 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-17 22:49:04,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 3/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-02-17 22:49:04,707 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 79 flow [2025-02-17 22:49:04,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 64 flow [2025-02-17 22:49:04,719 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:49:05,184 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:49:05,184 INFO L101 AmpleReduction]: Number of pruned transitions: 146, Number of non-trivial ample sets: 105 [2025-02-17 22:49:05,184 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 18 [2025-02-17 22:49:05,193 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:49:05,193 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:49:05,193 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:49:05,193 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:49:05,194 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:49:05,194 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:49:05,194 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:49:05,194 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:49:05,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 150 states, 149 states have (on average 1.9395973154362416) internal successors, (289), 149 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:05,239 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 70 [2025-02-17 22:49:05,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:05,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:05,244 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:49:05,244 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:05,244 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:49:05,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 150 states, 149 states have (on average 1.9395973154362416) internal successors, (289), 149 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:05,248 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 70 [2025-02-17 22:49:05,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:05,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:05,249 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:49:05,249 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:05,252 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L14: Formula: (and (= v_g_5 0) (= v_f_1 0)) InVars {g=v_g_5, f=v_f_1} OutVars{g=v_g_5, f=v_f_1} AuxVars[] AssignedVars[]" "[78] L14-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:49:05,252 INFO L754 eck$LassoCheckResult]: Loop: "[62] L25-->L27: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[64] L27-->L25: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:49:05,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:05,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2713, now seen corresponding path program 1 times [2025-02-17 22:49:05,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:05,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254422243] [2025-02-17 22:49:05,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:05,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:05,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:05,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:05,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,311 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:05,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:05,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:05,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:05,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:05,328 INFO L85 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2025-02-17 22:49:05,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:05,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276831665] [2025-02-17 22:49:05,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:05,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:05,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:05,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:05,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,341 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:05,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:05,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:05,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:05,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:05,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2609179, now seen corresponding path program 1 times [2025-02-17 22:49:05,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:05,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887158591] [2025-02-17 22:49:05,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:05,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:05,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:05,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:05,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,351 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:05,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:05,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:05,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:05,387 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:05,388 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:05,388 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:05,388 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:05,388 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:05,388 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,388 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:05,388 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:05,388 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:05,388 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:05,388 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:05,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:05,455 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:05,456 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:05,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:05,460 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:05,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-17 22:49:05,464 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:05,464 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:05,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-17 22:49:05,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:05,490 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-02-17 22:49:05,491 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-02-17 22:49:05,493 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:05,493 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:05,564 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:05,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:05,569 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:05,569 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:05,569 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:05,569 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:05,569 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:05,569 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,569 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:05,569 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:05,569 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:05,569 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:05,569 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:05,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:05,600 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:05,620 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:05,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:05,624 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-02-17 22:49:05,626 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-02-17 22:49:05,630 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-02-17 22:49:05,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:05,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:05,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:05,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:05,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:05,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:05,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:05,663 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:05,667 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:05,667 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:05,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:05,673 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-02-17 22:49:05,674 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-02-17 22:49:05,675 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:05,675 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:05,676 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:05,676 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z2) = -1*x2 + 1*z2 Supporting invariants [] [2025-02-17 22:49:05,682 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-02-17 22:49:05,684 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:05,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:05,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:05,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:05,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:05,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:05,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:05,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:05,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:05,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:05,719 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:05,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:05,748 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-02-17 22:49:05,750 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 150 states, 149 states have (on average 1.9395973154362416) internal successors, (289), 149 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:05,854 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 150 states, 149 states have (on average 1.9395973154362416) internal successors, (289), 149 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 532 states and 1135 transitions. Complement of second has 7 states. [2025-02-17 22:49:05,857 INFO L141 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-02-17 22:49:05,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-02-17 22:49:05,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:49:05,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:05,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:05,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:05,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:49:05,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:05,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 532 states and 1135 transitions. [2025-02-17 22:49:05,875 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 64 [2025-02-17 22:49:05,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 532 states to 386 states and 872 transitions. [2025-02-17 22:49:05,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 241 [2025-02-17 22:49:05,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 313 [2025-02-17 22:49:05,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 872 transitions. [2025-02-17 22:49:05,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:05,889 INFO L218 hiAutomatonCegarLoop]: Abstraction has 386 states and 872 transitions. [2025-02-17 22:49:05,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 872 transitions. [2025-02-17 22:49:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 254. [2025-02-17 22:49:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 254 states have (on average 2.4291338582677167) internal successors, (617), 253 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 617 transitions. [2025-02-17 22:49:05,931 INFO L240 hiAutomatonCegarLoop]: Abstraction has 254 states and 617 transitions. [2025-02-17 22:49:05,931 INFO L432 stractBuchiCegarLoop]: Abstraction has 254 states and 617 transitions. [2025-02-17 22:49:05,931 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:49:05,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 254 states and 617 transitions. [2025-02-17 22:49:05,933 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 64 [2025-02-17 22:49:05,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:05,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:05,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-17 22:49:05,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:05,936 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L14: Formula: (and (= v_g_5 0) (= v_f_1 0)) InVars {g=v_g_5, f=v_f_1} OutVars{g=v_g_5, f=v_f_1} AuxVars[] AssignedVars[]" "[78] L14-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[81] L14-1-->$Ultimate##0: 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]" "[66] $Ultimate##0-->L38-1: Formula: (< 0 v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" "[68] L38-1-->L38: Formula: (< v_y2_2 v_x2_6) InVars {y2=v_y2_2, x2=v_x2_6} OutVars{y2=v_y2_2, x2=v_x2_6} AuxVars[] AssignedVars[]" "[70] L38-->L38-1: Formula: (and (< v_y2_7 v_x2_16) (= (+ v_x2_15 1) v_x2_16)) InVars {y2=v_y2_7, x2=v_x2_16} OutVars{y2=v_y2_7, x2=v_x2_15} AuxVars[] AssignedVars[x2]" [2025-02-17 22:49:05,937 INFO L754 eck$LassoCheckResult]: Loop: "[68] L38-1-->L38: Formula: (< v_y2_2 v_x2_6) InVars {y2=v_y2_2, x2=v_x2_6} OutVars{y2=v_y2_2, x2=v_x2_6} AuxVars[] AssignedVars[]" "[70] L38-->L38-1: Formula: (and (< v_y2_7 v_x2_16) (= (+ v_x2_15 1) v_x2_16)) InVars {y2=v_y2_7, x2=v_x2_16} OutVars{y2=v_y2_7, x2=v_x2_15} AuxVars[] AssignedVars[x2]" [2025-02-17 22:49:05,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:05,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1786976148, now seen corresponding path program 1 times [2025-02-17 22:49:05,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:05,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510282006] [2025-02-17 22:49:05,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:05,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:05,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:05,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:05,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:05,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:49:05,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510282006] [2025-02-17 22:49:05,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510282006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:49:05,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:49:05,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:49:05,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518603538] [2025-02-17 22:49:05,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:49:05,996 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:49:05,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:05,996 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2025-02-17 22:49:05,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:05,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459627341] [2025-02-17 22:49:05,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:05,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:06,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:06,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:06,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:06,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:06,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:06,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:06,025 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:06,025 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:06,025 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:06,025 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:06,025 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:06,025 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,025 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:06,025 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:06,025 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:06,025 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:06,025 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:06,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,043 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:06,043 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:06,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,046 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-02-17 22:49:06,047 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-02-17 22:49:06,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:06,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:06,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:06,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,069 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-02-17 22:49:06,070 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-02-17 22:49:06,072 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:06,072 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:06,145 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:06,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:06,149 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:06,149 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:06,149 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:06,149 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:06,149 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:06,149 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,149 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:06,150 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:06,150 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:06,150 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:06,150 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:06,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,168 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:06,168 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:06,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,171 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-02-17 22:49:06,173 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-02-17 22:49:06,174 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-02-17 22:49:06,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:06,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:06,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:06,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:06,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:06,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:06,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:06,187 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:06,190 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:06,190 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:06,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,192 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-02-17 22:49:06,194 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-02-17 22:49:06,195 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:06,195 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:06,195 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:06,195 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(y2, x2) = -1*y2 + 1*x2 Supporting invariants [] [2025-02-17 22:49:06,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:06,203 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:06,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:06,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:06,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:06,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:06,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:06,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:06,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:06,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:06,237 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:06,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:06,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:06,254 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-02-17 22:49:06,254 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 254 states and 617 transitions. cyclomatic complexity: 406 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:06,334 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 254 states and 617 transitions. cyclomatic complexity: 406. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 745 states and 1664 transitions. Complement of second has 8 states. [2025-02-17 22:49:06,335 INFO L141 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-02-17 22:49:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2025-02-17 22:49:06,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:49:06,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:49:06,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 6 letters. Loop has 4 letters. [2025-02-17 22:49:06,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 745 states and 1664 transitions. [2025-02-17 22:49:06,345 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 100 [2025-02-17 22:49:06,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 745 states to 487 states and 1179 transitions. [2025-02-17 22:49:06,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 309 [2025-02-17 22:49:06,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 355 [2025-02-17 22:49:06,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 487 states and 1179 transitions. [2025-02-17 22:49:06,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:06,351 INFO L218 hiAutomatonCegarLoop]: Abstraction has 487 states and 1179 transitions. [2025-02-17 22:49:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states and 1179 transitions. [2025-02-17 22:49:06,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 402. [2025-02-17 22:49:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 402 states have (on average 2.5323383084577116) internal successors, (1018), 401 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1018 transitions. [2025-02-17 22:49:06,363 INFO L240 hiAutomatonCegarLoop]: Abstraction has 402 states and 1018 transitions. [2025-02-17 22:49:06,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:49:06,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:49:06,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:49:06,365 INFO L87 Difference]: Start difference. First operand 402 states and 1018 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:49:06,382 INFO L93 Difference]: Finished difference Result 48 states and 79 transitions. [2025-02-17 22:49:06,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 79 transitions. [2025-02-17 22:49:06,382 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-02-17 22:49:06,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 45 states and 71 transitions. [2025-02-17 22:49:06,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-02-17 22:49:06,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-02-17 22:49:06,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 71 transitions. [2025-02-17 22:49:06,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:06,383 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 71 transitions. [2025-02-17 22:49:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 71 transitions. [2025-02-17 22:49:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-17 22:49:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 44 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 71 transitions. [2025-02-17 22:49:06,384 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 71 transitions. [2025-02-17 22:49:06,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:49:06,387 INFO L432 stractBuchiCegarLoop]: Abstraction has 45 states and 71 transitions. [2025-02-17 22:49:06,387 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:49:06,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 71 transitions. [2025-02-17 22:49:06,388 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-02-17 22:49:06,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:06,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:06,388 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:06,388 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:06,388 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L14: Formula: (and (= v_g_5 0) (= v_f_1 0)) InVars {g=v_g_5, f=v_f_1} OutVars{g=v_g_5, f=v_f_1} AuxVars[] AssignedVars[]" "[78] L14-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[81] L14-1-->$Ultimate##0: 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]" "[84] L15-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[61] L25-->L29: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[63] L29-->thread1FINAL: Formula: (= v_g_1 (+ v_g_2 1)) InVars {g=v_g_2} OutVars{g=v_g_1} AuxVars[] AssignedVars[g]" "[66] $Ultimate##0-->L38-1: Formula: (< 0 v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" "[71] $Ultimate##0-->L52-1: Formula: (< 0 v_g_4) InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[65] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[85] thread1EXIT-->L17: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" [2025-02-17 22:49:06,388 INFO L754 eck$LassoCheckResult]: Loop: "[73] L52-1-->L52: Formula: (< v_y2_4 v_x2_10) InVars {y2=v_y2_4, x2=v_x2_10} OutVars{y2=v_y2_4, x2=v_x2_10} AuxVars[] AssignedVars[]" "[75] L52-->L52-1: Formula: (and (< v_y2_9 v_x2_20) (= v_x2_20 (+ v_x2_19 1))) InVars {y2=v_y2_9, x2=v_x2_20} OutVars{y2=v_y2_9, x2=v_x2_19} AuxVars[] AssignedVars[x2]" [2025-02-17 22:49:06,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,389 INFO L85 PathProgramCache]: Analyzing trace with hash -290095273, now seen corresponding path program 1 times [2025-02-17 22:49:06,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:06,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407554891] [2025-02-17 22:49:06,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:06,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:06,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:49:06,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:49:06,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,393 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:06,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:49:06,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:49:06,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:06,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,397 INFO L85 PathProgramCache]: Analyzing trace with hash 3299, now seen corresponding path program 1 times [2025-02-17 22:49:06,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:06,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417439932] [2025-02-17 22:49:06,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:06,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:06,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:06,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:06,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:06,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:06,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:06,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:06,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,404 INFO L85 PathProgramCache]: Analyzing trace with hash 391319225, now seen corresponding path program 1 times [2025-02-17 22:49:06,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:06,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661454500] [2025-02-17 22:49:06,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:06,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:06,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-17 22:49:06,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-17 22:49:06,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,409 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:06,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-17 22:49:06,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-17 22:49:06,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:06,434 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:06,434 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:06,434 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:06,434 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:06,434 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:06,434 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,434 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:06,434 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:06,434 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:06,434 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:06,434 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:06,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,454 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:06,454 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:06,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,458 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-02-17 22:49:06,469 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-02-17 22:49:06,470 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:06,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:06,496 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-02-17 22:49:06,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,504 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-02-17 22:49:06,511 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-02-17 22:49:06,511 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:06,511 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:06,587 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:06,591 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-02-17 22:49:06,591 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:06,591 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:06,592 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:06,592 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:06,592 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:06,592 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,592 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:06,592 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:06,592 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:06,592 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:06,592 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:06,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,611 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:06,611 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:06,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,616 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-02-17 22:49:06,617 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-02-17 22:49:06,618 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-02-17 22:49:06,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:06,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:06,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:06,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:06,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:06,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:06,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:06,631 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:06,633 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:06,633 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:06,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,635 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-02-17 22:49:06,638 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-02-17 22:49:06,638 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:06,638 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:06,638 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:06,638 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(y2, x2) = -1*y2 + 1*x2 Supporting invariants [] [2025-02-17 22:49:06,643 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-02-17 22:49:06,644 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:06,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:49:06,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:49:06,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:06,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:06,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:06,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:06,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:06,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:06,677 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:06,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:06,690 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-02-17 22:49:06,690 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 71 transitions. cyclomatic complexity: 35 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:06,716 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 71 transitions. cyclomatic complexity: 35. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 76 states and 126 transitions. Complement of second has 7 states. [2025-02-17 22:49:06,717 INFO L141 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-02-17 22:49:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2025-02-17 22:49:06,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:49:06,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 12 letters. Loop has 2 letters. [2025-02-17 22:49:06,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 10 letters. Loop has 4 letters. [2025-02-17 22:49:06,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 126 transitions. [2025-02-17 22:49:06,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-17 22:49:06,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 22 states and 30 transitions. [2025-02-17 22:49:06,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-02-17 22:49:06,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-17 22:49:06,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2025-02-17 22:49:06,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:06,719 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-02-17 22:49:06,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2025-02-17 22:49:06,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-17 22:49:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2025-02-17 22:49:06,720 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-02-17 22:49:06,720 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-02-17 22:49:06,720 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:49:06,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2025-02-17 22:49:06,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-17 22:49:06,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:06,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:06,723 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:06,723 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:06,723 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L14: Formula: (and (= v_g_5 0) (= v_f_1 0)) InVars {g=v_g_5, f=v_f_1} OutVars{g=v_g_5, f=v_f_1} AuxVars[] AssignedVars[]" "[78] L14-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[81] L14-1-->$Ultimate##0: 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]" "[61] L25-->L29: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[63] L29-->thread1FINAL: Formula: (= v_g_1 (+ v_g_2 1)) InVars {g=v_g_2} OutVars{g=v_g_1} AuxVars[] AssignedVars[g]" "[66] $Ultimate##0-->L38-1: Formula: (< 0 v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" "[65] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[67] L38-1-->thread2FINAL: Formula: (<= v_x2_5 v_y2_1) InVars {y2=v_y2_1, x2=v_x2_5} OutVars{y2=v_y2_1, x2=v_x2_5} AuxVars[] AssignedVars[]" "[69] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[84] L15-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[71] $Ultimate##0-->L52-1: Formula: (< 0 v_g_4) InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" [2025-02-17 22:49:06,723 INFO L754 eck$LassoCheckResult]: Loop: "[73] L52-1-->L52: Formula: (< v_y2_4 v_x2_10) InVars {y2=v_y2_4, x2=v_x2_10} OutVars{y2=v_y2_4, x2=v_x2_10} AuxVars[] AssignedVars[]" "[75] L52-->L52-1: Formula: (and (< v_y2_9 v_x2_20) (= v_x2_20 (+ v_x2_19 1))) InVars {y2=v_y2_9, x2=v_x2_20} OutVars{y2=v_y2_9, x2=v_x2_19} AuxVars[] AssignedVars[x2]" [2025-02-17 22:49:06,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,723 INFO L85 PathProgramCache]: Analyzing trace with hash 26905102, now seen corresponding path program 1 times [2025-02-17 22:49:06,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:06,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185992160] [2025-02-17 22:49:06,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:06,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:06,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:49:06,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:49:06,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:06,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:49:06,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:49:06,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:06,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,740 INFO L85 PathProgramCache]: Analyzing trace with hash 3299, now seen corresponding path program 2 times [2025-02-17 22:49:06,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:06,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933280098] [2025-02-17 22:49:06,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:49:06,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:06,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:06,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:06,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:49:06,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,743 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:06,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:06,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:06,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:06,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,749 INFO L85 PathProgramCache]: Analyzing trace with hash 86001584, now seen corresponding path program 1 times [2025-02-17 22:49:06,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:06,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59464439] [2025-02-17 22:49:06,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:06,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:06,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-17 22:49:06,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-17 22:49:06,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:06,783 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-02-17 22:49:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:06,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:49:06,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59464439] [2025-02-17 22:49:06,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59464439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:49:06,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:49:06,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:49:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537123624] [2025-02-17 22:49:06,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:49:06,786 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-02-17 22:49:06,790 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-02-17 22:49:06,800 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:06,801 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:06,801 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:06,801 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:06,801 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:06,801 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,801 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:06,801 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:06,801 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:06,801 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:06,801 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:06,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,821 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:06,821 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:06,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,823 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-02-17 22:49:06,824 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-02-17 22:49:06,825 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:06,825 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:06,841 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-02-17 22:49:06,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,843 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-02-17 22:49:06,845 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-02-17 22:49:06,846 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:06,846 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:06,914 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:06,919 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-02-17 22:49:06,919 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:06,919 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:06,919 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:06,919 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:06,919 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:06,919 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,919 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:06,919 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:06,919 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:06,919 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:06,919 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:06,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,934 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:06,934 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:06,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,936 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-02-17 22:49:06,937 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-02-17 22:49:06,938 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-02-17 22:49:06,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:06,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:06,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:06,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:06,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:06,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:06,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:06,950 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:06,952 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:06,953 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:06,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,954 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-02-17 22:49:06,955 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-02-17 22:49:06,956 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:06,956 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:06,956 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:06,956 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, y2) = 1*x2 - 1*y2 Supporting invariants [] [2025-02-17 22:49:06,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-17 22:49:06,962 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:06,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:49:06,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:49:06,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:06,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:06,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:06,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:07,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:07,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:07,001 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:07,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:07,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:07,012 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-02-17 22:49:07,012 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:07,025 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 30 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 33 transitions. Complement of second has 4 states. [2025-02-17 22:49:07,025 INFO L141 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-02-17 22:49:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2025-02-17 22:49:07,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2025-02-17 22:49:07,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:07,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 13 letters. Loop has 2 letters. [2025-02-17 22:49:07,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:07,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2025-02-17 22:49:07,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:07,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 33 transitions. [2025-02-17 22:49:07,027 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:07,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2025-02-17 22:49:07,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:07,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:07,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:07,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:07,027 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:07,027 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:07,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:49:07,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:49:07,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:49:07,027 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:07,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:49:07,027 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-02-17 22:49:07,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-02-17 22:49:07,028 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:07,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-02-17 22:49:07,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:07,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:07,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:07,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:07,028 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:07,028 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:07,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-17 22:49:07,028 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:07,028 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:49:07,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:49:07,028 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:07,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:49:07,033 INFO L201 PluginConnector]: Adding new model me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:49:07 BoogieIcfgContainer [2025-02-17 22:49:07,034 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:49:07,034 INFO L158 Benchmark]: Toolchain (without parser) took 2678.64ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 87.5MB in the beginning and 87.3MB in the end (delta: 204.5kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:07,034 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:07,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.51ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 86.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:07,034 INFO L158 Benchmark]: Boogie Preprocessor took 13.48ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 85.6MB in the end (delta: 677.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:07,035 INFO L158 Benchmark]: RCFGBuilder took 173.23ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 76.3MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:49:07,035 INFO L158 Benchmark]: BuchiAutomizer took 2469.40ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 76.1MB in the beginning and 87.3MB in the end (delta: -11.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:07,036 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.22ms. Allocated memory is still 159.4MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.51ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 86.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 13.48ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 85.6MB in the end (delta: 677.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 173.23ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 76.3MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2469.40ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 76.1MB in the beginning and 87.3MB in the end (delta: -11.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function z2 + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * y2 + x2 and consists of 5 locations. One deterministic module has affine ranking function -1 * y2 + x2 and consists of 5 locations. One deterministic module has affine ranking function -1 * y2 + x2 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 217 StatesRemovedByMinimization, 2 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 159 IncrementalHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 70 mSDtfsCounter, 159 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 54ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 523, Trivial Ample Sets caused by loops: 18, Number of non-trivial ample sets: 105, Number of pruned transitions: 146, Number of transitions in reduction automaton: 289, Number of states in reduction automaton: 150, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:49:07,044 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-02-17 22:49:07,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...