/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/lswitch.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:45:33,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:45:33,898 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:45:33,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:45:33,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:45:33,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:45:33,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:45:33,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:45:33,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:45:33,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:45:33,922 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:45:33,922 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:45:33,922 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:45:33,923 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:45:33,923 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:45:33,923 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:45:33,923 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:45:33,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:45:33,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:45:33,923 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:45:33,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:45:33,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:45:33,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:45:33,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:45:33,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:45:33,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:45:33,923 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:45:33,923 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:45:33,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:45:33,923 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:45:33,924 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:45:33,924 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:45:33,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:45:33,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:45:33,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:45:33,924 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:45:33,924 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-02-17 22:45:34,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:45:34,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:45:34,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:45:34,157 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:45:34,158 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:45:34,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/lswitch.c.bpl [2025-02-17 22:45:34,158 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/lswitch.c.bpl' [2025-02-17 22:45:34,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:45:34,171 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:45:34,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:34,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:45:34,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:45:34,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "lswitch.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:34" (1/1) ... [2025-02-17 22:45:34,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "lswitch.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:34" (1/1) ... [2025-02-17 22:45:34,187 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:45:34,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:34,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:45:34,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:45:34,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:45:34,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "lswitch.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:34" (1/1) ... [2025-02-17 22:45:34,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "lswitch.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:34" (1/1) ... [2025-02-17 22:45:34,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "lswitch.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:34" (1/1) ... [2025-02-17 22:45:34,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "lswitch.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:34" (1/1) ... [2025-02-17 22:45:34,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "lswitch.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:34" (1/1) ... [2025-02-17 22:45:34,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "lswitch.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:34" (1/1) ... [2025-02-17 22:45:34,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "lswitch.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:34" (1/1) ... [2025-02-17 22:45:34,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "lswitch.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:34" (1/1) ... [2025-02-17 22:45:34,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "lswitch.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:34" (1/1) ... [2025-02-17 22:45:34,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:45:34,198 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:45:34,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:45:34,198 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:45:34,199 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "lswitch.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:34" (1/1) ... [2025-02-17 22:45:34,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:34,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:34,227 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:45:34,229 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:45:34,248 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:45:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:45:34,248 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:45:34,248 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:45:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:45:34,248 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:45:34,248 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:45:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:45:34,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:45:34,249 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:45:34,298 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:45:34,302 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:45:34,353 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:45:34,353 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:45:34,359 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:45:34,359 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:45:34,360 INFO L201 PluginConnector]: Adding new model lswitch.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:34 BoogieIcfgContainer [2025-02-17 22:45:34,360 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:45:34,361 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:45:34,361 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:45:34,364 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:45:34,365 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:34,365 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "lswitch.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:34" (1/2) ... [2025-02-17 22:45:34,366 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@431dd84 and model type lswitch.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:45:34, skipping insertion in model container [2025-02-17 22:45:34,366 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:34,366 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "lswitch.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:34" (2/2) ... [2025-02-17 22:45:34,367 INFO L363 chiAutomizerObserver]: Analyzing ICFG lswitch.c.bpl [2025-02-17 22:45:34,418 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:45:34,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 25 transitions, 64 flow [2025-02-17 22:45:34,480 INFO L124 PetriNetUnfolderBase]: 4/21 cut-off events. [2025-02-17 22:45:34,481 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:45:34,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 4/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 19. Up to 3 conditions per place. [2025-02-17 22:45:34,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 25 transitions, 64 flow [2025-02-17 22:45:34,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 21 transitions, 54 flow [2025-02-17 22:45:34,500 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:45:34,500 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:45:34,501 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:45:34,501 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:45:34,501 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:45:34,501 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:45:34,502 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:45:34,502 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:45:34,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-02-17 22:45:34,540 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 48 [2025-02-17 22:45:34,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:34,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:34,543 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:45:34,544 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:34,544 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:45:34,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 61 states, but on-demand construction may add more states [2025-02-17 22:45:34,553 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 48 [2025-02-17 22:45:34,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:34,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:34,553 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:45:34,553 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:34,558 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" [2025-02-17 22:45:34,558 INFO L754 eck$LassoCheckResult]: Loop: "[58] L21-->L23: Formula: (< v_x2_1 v_w_1) InVars {x2=v_x2_1, w=v_w_1} OutVars{x2=v_x2_1, w=v_w_1} AuxVars[] AssignedVars[]" "[60] L23-->L24: Formula: (= (+ v_d_2 v_d_1) 0) InVars {d=v_d_2} OutVars{d=v_d_1} AuxVars[] AssignedVars[d]" "[61] L24-->L21: 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:45:34,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash 109, now seen corresponding path program 1 times [2025-02-17 22:45:34,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:34,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896173761] [2025-02-17 22:45:34,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:34,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:34,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:45:34,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:45:34,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:34,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:34,623 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:34,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:45:34,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:45:34,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:34,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:34,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:34,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:34,643 INFO L85 PathProgramCache]: Analyzing trace with hash 87450, now seen corresponding path program 1 times [2025-02-17 22:45:34,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:34,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702072056] [2025-02-17 22:45:34,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:34,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:34,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:34,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:34,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:34,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:34,657 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:34,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:34,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:34,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:34,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:34,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:34,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:34,663 INFO L85 PathProgramCache]: Analyzing trace with hash 3304878, now seen corresponding path program 1 times [2025-02-17 22:45:34,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:34,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754695646] [2025-02-17 22:45:34,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:34,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:34,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:34,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:34,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:34,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:34,672 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:34,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:34,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:34,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:34,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:34,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:34,753 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:34,754 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:34,754 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:34,754 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:34,754 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:34,755 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:34,755 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:34,755 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:34,755 INFO L132 ssoRankerPreferences]: Filename of dumped script: lswitch.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:34,755 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:34,755 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:34,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:34,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:34,810 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:34,810 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:34,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:34,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:34,814 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:45:34,815 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:45:34,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:34,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:34,845 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:45:34,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:34,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:34,847 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:45:34,850 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:45:34,852 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:34,852 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:34,926 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:34,931 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:45:34,934 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:34,934 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:34,934 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:34,934 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:34,934 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:34,934 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:34,934 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:34,934 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:34,934 INFO L132 ssoRankerPreferences]: Filename of dumped script: lswitch.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:34,935 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:34,935 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:34,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:34,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:34,988 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:34,991 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:34,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:34,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:34,993 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:45:34,994 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:45:34,995 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:45:35,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:35,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:35,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:35,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:35,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:35,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:35,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:35,023 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:35,028 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:35,028 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:35,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:35,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:35,032 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:45:35,034 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:45:35,035 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:35,035 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:35,035 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:35,036 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x2) = 1*w - 1*x2 Supporting invariants [] [2025-02-17 22:45:35,042 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:45:35,044 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:35,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:35,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:45:35,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:45:35,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:35,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:35,084 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:35,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:35,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:35,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:35,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:35,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:35,099 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:35,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:35,128 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:45:35,147 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:45:35,150 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 61 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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:45:35,192 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:45:35,237 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 61 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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 158 states and 385 transitions. Complement of second has 6 states. [2025-02-17 22:45:35,239 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:45:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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:45:35,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-02-17 22:45:35,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 1 letters. Loop has 3 letters. [2025-02-17 22:45:35,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:35,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 4 letters. Loop has 3 letters. [2025-02-17 22:45:35,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:35,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 1 letters. Loop has 6 letters. [2025-02-17 22:45:35,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:35,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 385 transitions. [2025-02-17 22:45:35,258 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 36 [2025-02-17 22:45:35,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 99 states and 249 transitions. [2025-02-17 22:45:35,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-02-17 22:45:35,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2025-02-17 22:45:35,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 249 transitions. [2025-02-17 22:45:35,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:35,277 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 249 transitions. [2025-02-17 22:45:35,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 249 transitions. [2025-02-17 22:45:35,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2025-02-17 22:45:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 2.4936708860759493) internal successors, (197), 78 states have internal predecessors, (197), 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:45:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 197 transitions. [2025-02-17 22:45:35,310 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 197 transitions. [2025-02-17 22:45:35,310 INFO L432 stractBuchiCegarLoop]: Abstraction has 79 states and 197 transitions. [2025-02-17 22:45:35,310 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:45:35,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 197 transitions. [2025-02-17 22:45:35,312 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 36 [2025-02-17 22:45:35,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:35,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:35,313 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:45:35,313 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-17 22:45:35,313 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[75] L12-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[62] $Ultimate##0-->L39-1: Formula: (< 0 v_d_3) InVars {d=v_d_3} OutVars{d=v_d_3} AuxVars[] AssignedVars[]" [2025-02-17 22:45:35,314 INFO L754 eck$LassoCheckResult]: Loop: "[64] L39-1-->L34: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[66] L34-->L35: Formula: (= v_x1_5 (+ v_x1_6 v_d_4)) InVars {x1=v_x1_6, d=v_d_4} OutVars{x1=v_x1_5, d=v_d_4} AuxVars[] AssignedVars[x1]" "[68] L35-->L35-2: Formula: (< v_z_2 v_x1_2) InVars {x1=v_x1_2, z=v_z_2} OutVars{x1=v_x1_2, z=v_z_2} AuxVars[] AssignedVars[]" "[71] L35-2-->L39-1: Formula: (< v_x1_4 v_y_2) InVars {y=v_y_2, x1=v_x1_4} OutVars{y=v_y_2, x1=v_x1_4} AuxVars[] AssignedVars[]" [2025-02-17 22:45:35,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:35,314 INFO L85 PathProgramCache]: Analyzing trace with hash 107136, now seen corresponding path program 1 times [2025-02-17 22:45:35,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:35,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785622766] [2025-02-17 22:45:35,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:35,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:35,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:35,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:35,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:35,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:35,331 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:35,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:35,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:35,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:35,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:35,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:35,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2895750, now seen corresponding path program 1 times [2025-02-17 22:45:35,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:35,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930383224] [2025-02-17 22:45:35,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:35,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:35,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:35,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:35,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:35,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:35,362 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:35,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:35,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:35,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:35,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:35,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:35,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:35,365 INFO L85 PathProgramCache]: Analyzing trace with hash 160070277, now seen corresponding path program 1 times [2025-02-17 22:45:35,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:35,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638698187] [2025-02-17 22:45:35,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:35,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:35,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:45:35,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:45:35,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:35,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:35,369 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:35,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:45:35,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:45:35,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:35,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:35,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:35,451 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:35,451 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:35,451 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:35,451 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:35,451 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:35,451 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:35,451 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:35,451 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:35,451 INFO L132 ssoRankerPreferences]: Filename of dumped script: lswitch.c.bpl_petrified1_Iteration2_Lasso [2025-02-17 22:45:35,452 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:35,452 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:35,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:35,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:35,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:35,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:35,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:35,524 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:35,525 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:35,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:35,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:35,528 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:45:35,530 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:45:35,530 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:35,530 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:35,548 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:35,548 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f=1} Honda state: {f=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:35,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-17 22:45:35,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:35,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:35,556 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:45:35,558 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:45:35,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:35,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:35,572 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:35,572 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar1=0} Honda state: {thread2Thread1of1ForFork0_thidvar1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:35,578 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:45:35,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:35,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:35,581 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:45:35,582 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:45:35,584 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:35,584 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:35,595 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:35,595 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar0=0} Honda state: {thread2Thread1of1ForFork0_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:35,600 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:45:35,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:35,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:35,603 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:45:35,603 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:45:35,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:35,606 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:35,624 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:35,625 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_thidvar0=0} Honda state: {thread1Thread1of1ForFork1_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:35,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:35,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:35,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:35,632 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:45:35,633 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:45:35,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:35,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:35,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:35,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:35,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:35,655 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:45:35,656 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:45:35,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:35,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:35,852 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:35,859 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:45:35,859 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:35,859 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:35,859 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:35,859 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:35,860 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:35,860 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:35,860 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:35,860 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:35,860 INFO L132 ssoRankerPreferences]: Filename of dumped script: lswitch.c.bpl_petrified1_Iteration2_Lasso [2025-02-17 22:45:35,860 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:35,860 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:35,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:35,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:35,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:35,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:35,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:35,922 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:35,923 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:35,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:35,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:35,925 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:45:35,926 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:45:35,927 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:45:35,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:35,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:35,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:35,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:35,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:35,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:35,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:35,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-17 22:45:35,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:35,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:35,956 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:45:35,958 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:45:35,959 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:45:35,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:35,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:35,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:35,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:35,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:35,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:35,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:35,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:35,977 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:45:35,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:35,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:36,009 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:45:36,011 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:45:36,011 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:45:36,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:36,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:36,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:36,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:36,027 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:36,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:36,030 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:36,036 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:45:36,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:36,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:36,038 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:45:36,040 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:45:36,041 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:45:36,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:36,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:36,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:36,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:36,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:36,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:36,063 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:36,068 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:45:36,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:36,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:36,070 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:45:36,072 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:45:36,074 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:45:36,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:36,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:36,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:36,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:36,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:36,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:36,095 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:36,101 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-17 22:45:36,101 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:36,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:36,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:36,104 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:45:36,106 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:45:36,106 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:36,117 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:45:36,117 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:36,117 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, d, x1) = 1*y - 1*d - 1*x1 Supporting invariants [1*d - 1 >= 0] [2025-02-17 22:45:36,123 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:45:36,130 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:45:36,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:36,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:36,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:36,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:36,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:36,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:45:36,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:36,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:36,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:36,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:36,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:36,176 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:36,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:36,223 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:45:36,224 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:45:36,224 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 197 transitions. cyclomatic complexity: 127 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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:45:36,294 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 197 transitions. cyclomatic complexity: 127. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 279 states and 672 transitions. Complement of second has 7 states. [2025-02-17 22:45:36,297 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:45:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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:45:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2025-02-17 22:45:36,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:45:36,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:36,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 7 letters. Loop has 4 letters. [2025-02-17 22:45:36,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:36,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 3 letters. Loop has 8 letters. [2025-02-17 22:45:36,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:36,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 279 states and 672 transitions. [2025-02-17 22:45:36,304 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 72 [2025-02-17 22:45:36,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 279 states to 279 states and 672 transitions. [2025-02-17 22:45:36,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2025-02-17 22:45:36,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2025-02-17 22:45:36,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 672 transitions. [2025-02-17 22:45:36,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:36,310 INFO L218 hiAutomatonCegarLoop]: Abstraction has 279 states and 672 transitions. [2025-02-17 22:45:36,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 672 transitions. [2025-02-17 22:45:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 232. [2025-02-17 22:45:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 232 states have (on average 2.4870689655172415) internal successors, (577), 231 states have internal predecessors, (577), 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:45:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 577 transitions. [2025-02-17 22:45:36,325 INFO L240 hiAutomatonCegarLoop]: Abstraction has 232 states and 577 transitions. [2025-02-17 22:45:36,325 INFO L432 stractBuchiCegarLoop]: Abstraction has 232 states and 577 transitions. [2025-02-17 22:45:36,325 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:45:36,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 232 states and 577 transitions. [2025-02-17 22:45:36,327 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 72 [2025-02-17 22:45:36,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:36,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:36,328 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:45:36,328 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:45:36,328 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[75] L12-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[62] $Ultimate##0-->L39-1: Formula: (< 0 v_d_3) InVars {d=v_d_3} OutVars{d=v_d_3} AuxVars[] AssignedVars[]" "[64] L39-1-->L34: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-02-17 22:45:36,328 INFO L754 eck$LassoCheckResult]: Loop: "[66] L34-->L35: Formula: (= v_x1_5 (+ v_x1_6 v_d_4)) InVars {x1=v_x1_6, d=v_d_4} OutVars{x1=v_x1_5, d=v_d_4} AuxVars[] AssignedVars[x1]" "[68] L35-->L35-2: Formula: (< v_z_2 v_x1_2) InVars {x1=v_x1_2, z=v_z_2} OutVars{x1=v_x1_2, z=v_z_2} AuxVars[] AssignedVars[]" "[70] L35-2-->L41: Formula: (<= v_y_1 v_x1_3) InVars {y=v_y_1, x1=v_x1_3} OutVars{y=v_y_1, x1=v_x1_3} AuxVars[] AssignedVars[]" "[72] L41-->L39-1: Formula: (= v_f_2 0) InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[64] L39-1-->L34: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-02-17 22:45:36,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:36,330 INFO L85 PathProgramCache]: Analyzing trace with hash 3321280, now seen corresponding path program 1 times [2025-02-17 22:45:36,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:36,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113852409] [2025-02-17 22:45:36,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:36,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:36,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:36,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:36,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:36,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:36,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:36,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:36,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:36,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:36,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:36,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:36,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:36,341 INFO L85 PathProgramCache]: Analyzing trace with hash 91676891, now seen corresponding path program 1 times [2025-02-17 22:45:36,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:36,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691091948] [2025-02-17 22:45:36,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:36,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:36,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:36,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:36,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:36,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:36,369 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:45:36,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:45:36,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691091948] [2025-02-17 22:45:36,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691091948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:45:36,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:45:36,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:45:36,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370826381] [2025-02-17 22:45:36,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:45:36,373 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-17 22:45:36,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:45:36,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:45:36,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:45:36,383 INFO L87 Difference]: Start difference. First operand 232 states and 577 transitions. cyclomatic complexity: 372 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:45:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:45:36,399 INFO L93 Difference]: Finished difference Result 332 states and 775 transitions. [2025-02-17 22:45:36,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 775 transitions. [2025-02-17 22:45:36,402 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2025-02-17 22:45:36,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 108 states and 235 transitions. [2025-02-17 22:45:36,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-02-17 22:45:36,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2025-02-17 22:45:36,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 235 transitions. [2025-02-17 22:45:36,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:36,406 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 235 transitions. [2025-02-17 22:45:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 235 transitions. [2025-02-17 22:45:36,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-17 22:45:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 2.175925925925926) internal successors, (235), 107 states have internal predecessors, (235), 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:45:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 235 transitions. [2025-02-17 22:45:36,410 INFO L240 hiAutomatonCegarLoop]: Abstraction has 108 states and 235 transitions. [2025-02-17 22:45:36,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:45:36,411 INFO L432 stractBuchiCegarLoop]: Abstraction has 108 states and 235 transitions. [2025-02-17 22:45:36,411 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:45:36,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 235 transitions. [2025-02-17 22:45:36,412 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2025-02-17 22:45:36,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:36,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:36,412 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:45:36,412 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-17 22:45:36,412 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[58] L21-->L23: Formula: (< v_x2_1 v_w_1) InVars {x2=v_x2_1, w=v_w_1} OutVars{x2=v_x2_1, w=v_w_1} AuxVars[] AssignedVars[]" "[75] L12-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[62] $Ultimate##0-->L39-1: Formula: (< 0 v_d_3) InVars {d=v_d_3} OutVars{d=v_d_3} AuxVars[] AssignedVars[]" "[60] L23-->L24: Formula: (= (+ v_d_2 v_d_1) 0) InVars {d=v_d_2} OutVars{d=v_d_1} AuxVars[] AssignedVars[d]" [2025-02-17 22:45:36,413 INFO L754 eck$LassoCheckResult]: Loop: "[64] L39-1-->L34: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[66] L34-->L35: Formula: (= v_x1_5 (+ v_x1_6 v_d_4)) InVars {x1=v_x1_6, d=v_d_4} OutVars{x1=v_x1_5, d=v_d_4} AuxVars[] AssignedVars[x1]" "[68] L35-->L35-2: Formula: (< v_z_2 v_x1_2) InVars {x1=v_x1_2, z=v_z_2} OutVars{x1=v_x1_2, z=v_z_2} AuxVars[] AssignedVars[]" "[71] L35-2-->L39-1: Formula: (< v_x1_4 v_y_2) InVars {y=v_y_2, x1=v_x1_4} OutVars{y=v_y_2, x1=v_x1_4} AuxVars[] AssignedVars[]" [2025-02-17 22:45:36,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:36,413 INFO L85 PathProgramCache]: Analyzing trace with hash 102465724, now seen corresponding path program 1 times [2025-02-17 22:45:36,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:36,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027275552] [2025-02-17 22:45:36,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:36,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:36,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:36,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:36,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:36,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:36,416 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:36,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:36,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:36,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:36,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:36,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:36,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:36,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2895750, now seen corresponding path program 2 times [2025-02-17 22:45:36,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:36,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825862757] [2025-02-17 22:45:36,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:45:36,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:36,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:36,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:36,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:45:36,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:36,422 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:36,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:36,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:36,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:36,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:36,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:36,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:36,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1764566335, now seen corresponding path program 1 times [2025-02-17 22:45:36,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:36,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916777171] [2025-02-17 22:45:36,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:36,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:36,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:45:36,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:45:36,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:36,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:36,428 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:36,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:45:36,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:45:36,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:36,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:36,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:36,479 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:36,479 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:36,479 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:36,479 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:36,479 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:36,479 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:36,479 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:36,479 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:36,479 INFO L132 ssoRankerPreferences]: Filename of dumped script: lswitch.c.bpl_petrified1_Iteration4_Lasso [2025-02-17 22:45:36,479 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:36,480 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:36,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:36,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:36,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:36,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:36,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:36,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:36,558 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:36,558 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:36,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:36,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:36,560 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:36,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-17 22:45:36,562 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:36,562 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:36,578 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:36,578 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f=1} Honda state: {f=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:36,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-17 22:45:36,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:36,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:36,585 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:36,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-17 22:45:36,587 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:36,587 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:36,598 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:36,598 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_thidvar0=0} Honda state: {thread1Thread1of1ForFork1_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:36,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-17 22:45:36,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:36,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:36,607 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:36,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-17 22:45:36,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:36,609 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:36,621 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:36,621 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar0=0} Honda state: {thread2Thread1of1ForFork0_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:36,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-17 22:45:36,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:36,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:36,628 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:36,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-17 22:45:36,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:36,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:36,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-17 22:45:36,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:36,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:36,653 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:36,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-17 22:45:36,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:36,656 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:36,854 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:36,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:36,860 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:36,860 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:36,860 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:36,860 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:36,860 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:36,860 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:36,861 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:36,861 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:36,861 INFO L132 ssoRankerPreferences]: Filename of dumped script: lswitch.c.bpl_petrified1_Iteration4_Lasso [2025-02-17 22:45:36,861 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:36,861 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:36,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:36,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:36,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:36,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:36,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:36,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:36,950 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:36,951 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:36,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:36,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:36,954 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:36,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-17 22:45:36,956 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:45:36,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:36,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:36,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:36,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:36,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:36,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:36,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:36,970 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:36,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:36,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:36,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:36,981 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:36,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-17 22:45:36,983 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:45:36,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:36,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:36,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:36,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:36,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:36,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:37,003 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:37,012 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:37,012 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:37,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:37,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:37,015 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:37,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-17 22:45:37,017 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:37,027 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:45:37,027 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:37,028 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, d, x1) = -1*z + 1*d + 1*x1 Supporting invariants [-1*d - 1 >= 0] [2025-02-17 22:45:37,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-17 22:45:37,036 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:45:37,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:37,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:37,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:37,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:37,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:37,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:37,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:37,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:37,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:37,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:37,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:37,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:37,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:37,110 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:37,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:37,179 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:45:37,180 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-02-17 22:45:37,180 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 108 states and 235 transitions. cyclomatic complexity: 141 Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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:45:37,271 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 108 states and 235 transitions. cyclomatic complexity: 141. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 283 states and 596 transitions. Complement of second has 9 states. [2025-02-17 22:45:37,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-17 22:45:37,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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:45:37,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2025-02-17 22:45:37,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-17 22:45:37,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:37,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 9 letters. Loop has 4 letters. [2025-02-17 22:45:37,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:37,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 5 letters. Loop has 8 letters. [2025-02-17 22:45:37,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:37,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 283 states and 596 transitions. [2025-02-17 22:45:37,275 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2025-02-17 22:45:37,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 283 states to 203 states and 434 transitions. [2025-02-17 22:45:37,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2025-02-17 22:45:37,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2025-02-17 22:45:37,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 203 states and 434 transitions. [2025-02-17 22:45:37,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:37,277 INFO L218 hiAutomatonCegarLoop]: Abstraction has 203 states and 434 transitions. [2025-02-17 22:45:37,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states and 434 transitions. [2025-02-17 22:45:37,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 197. [2025-02-17 22:45:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 197 states have (on average 2.1472081218274113) internal successors, (423), 196 states have internal predecessors, (423), 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:45:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 423 transitions. [2025-02-17 22:45:37,288 INFO L240 hiAutomatonCegarLoop]: Abstraction has 197 states and 423 transitions. [2025-02-17 22:45:37,288 INFO L432 stractBuchiCegarLoop]: Abstraction has 197 states and 423 transitions. [2025-02-17 22:45:37,288 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:45:37,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 197 states and 423 transitions. [2025-02-17 22:45:37,290 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2025-02-17 22:45:37,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:37,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:37,290 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2025-02-17 22:45:37,290 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-17 22:45:37,290 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[58] L21-->L23: Formula: (< v_x2_1 v_w_1) InVars {x2=v_x2_1, w=v_w_1} OutVars{x2=v_x2_1, w=v_w_1} AuxVars[] AssignedVars[]" "[75] L12-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[60] L23-->L24: Formula: (= (+ v_d_2 v_d_1) 0) InVars {d=v_d_2} OutVars{d=v_d_1} AuxVars[] AssignedVars[d]" "[61] L24-->L21: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[58] L21-->L23: Formula: (< v_x2_1 v_w_1) InVars {x2=v_x2_1, w=v_w_1} OutVars{x2=v_x2_1, w=v_w_1} AuxVars[] AssignedVars[]" "[62] $Ultimate##0-->L39-1: Formula: (< 0 v_d_3) InVars {d=v_d_3} OutVars{d=v_d_3} AuxVars[] AssignedVars[]" "[60] L23-->L24: Formula: (= (+ v_d_2 v_d_1) 0) InVars {d=v_d_2} OutVars{d=v_d_1} AuxVars[] AssignedVars[d]" [2025-02-17 22:45:37,290 INFO L754 eck$LassoCheckResult]: Loop: "[64] L39-1-->L34: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[66] L34-->L35: Formula: (= v_x1_5 (+ v_x1_6 v_d_4)) InVars {x1=v_x1_6, d=v_d_4} OutVars{x1=v_x1_5, d=v_d_4} AuxVars[] AssignedVars[x1]" "[68] L35-->L35-2: Formula: (< v_z_2 v_x1_2) InVars {x1=v_x1_2, z=v_z_2} OutVars{x1=v_x1_2, z=v_z_2} AuxVars[] AssignedVars[]" "[71] L35-2-->L39-1: Formula: (< v_x1_4 v_y_2) InVars {y=v_y_2, x1=v_x1_4} OutVars{y=v_y_2, x1=v_x1_4} AuxVars[] AssignedVars[]" [2025-02-17 22:45:37,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:37,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1167123303, now seen corresponding path program 1 times [2025-02-17 22:45:37,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:37,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343236618] [2025-02-17 22:45:37,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:37,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:37,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:37,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:37,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:37,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:37,297 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:37,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:37,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:37,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:37,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:37,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:37,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:37,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2895750, now seen corresponding path program 3 times [2025-02-17 22:45:37,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:37,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552057702] [2025-02-17 22:45:37,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-17 22:45:37,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:37,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:37,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:37,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-17 22:45:37,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:37,308 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:37,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:37,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:37,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:37,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:37,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:37,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:37,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2114666526, now seen corresponding path program 1 times [2025-02-17 22:45:37,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:37,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635754035] [2025-02-17 22:45:37,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:37,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:37,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-17 22:45:37,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-17 22:45:37,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:37,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:37,322 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:37,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-17 22:45:37,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-17 22:45:37,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:37,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:37,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:37,405 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:37,405 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:37,405 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:37,405 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:37,405 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:37,405 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:37,405 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:37,405 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:37,405 INFO L132 ssoRankerPreferences]: Filename of dumped script: lswitch.c.bpl_petrified1_Iteration5_Lasso [2025-02-17 22:45:37,405 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:37,405 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:37,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:37,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:37,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:37,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:37,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:37,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:37,495 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:37,496 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:37,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:37,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:37,498 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:37,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-17 22:45:37,499 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:37,499 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:37,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-17 22:45:37,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:37,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:37,518 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:37,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-17 22:45:37,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:37,520 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:37,738 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:37,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-17 22:45:37,745 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:37,745 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:37,745 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:37,745 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:37,746 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:37,746 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:37,746 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:37,746 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:37,746 INFO L132 ssoRankerPreferences]: Filename of dumped script: lswitch.c.bpl_petrified1_Iteration5_Lasso [2025-02-17 22:45:37,746 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:37,746 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:37,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:37,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:37,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:37,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:37,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:37,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:37,816 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:37,817 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:37,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:37,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:37,819 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:37,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-17 22:45:37,820 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:45:37,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:37,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:37,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:37,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:37,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:37,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:37,841 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:37,848 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:37,848 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:37,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:37,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:37,850 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:37,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-17 22:45:37,852 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:37,863 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:45:37,863 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:37,863 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, d, z) = 1*x1 + 1*d - 1*z Supporting invariants [-1*d - 1 >= 0] [2025-02-17 22:45:37,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-17 22:45:37,877 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:45:37,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:37,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:37,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:37,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:37,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:37,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:37,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:37,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:37,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:37,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:37,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:37,926 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:37,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:37,970 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:45:37,970 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-02-17 22:45:37,971 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 197 states and 423 transitions. cyclomatic complexity: 247 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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:45:38,035 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 197 states and 423 transitions. cyclomatic complexity: 247. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 274 states and 580 transitions. Complement of second has 9 states. [2025-02-17 22:45:38,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-17 22:45:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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:45:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2025-02-17 22:45:38,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:45:38,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:38,037 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-17 22:45:38,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:38,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:38,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:38,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:38,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:38,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:38,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:38,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:38,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:38,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:38,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:38,095 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:38,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:38,132 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2025-02-17 22:45:38,133 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 197 states and 423 transitions. cyclomatic complexity: 247 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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:45:38,197 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 197 states and 423 transitions. cyclomatic complexity: 247. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 308 states and 647 transitions. Complement of second has 11 states. [2025-02-17 22:45:38,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 3 non-accepting loop states 2 accepting loop states [2025-02-17 22:45:38,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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:45:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2025-02-17 22:45:38,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:45:38,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:38,198 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-17 22:45:38,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:38,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:38,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:38,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:38,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:38,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:38,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:38,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:38,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:38,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:38,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:38,256 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:38,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:38,294 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:45:38,295 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-02-17 22:45:38,295 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 197 states and 423 transitions. cyclomatic complexity: 247 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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:45:38,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-02-17 22:45:38,384 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 197 states and 423 transitions. cyclomatic complexity: 247. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 418 states and 877 transitions. Complement of second has 9 states. [2025-02-17 22:45:38,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-17 22:45:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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:45:38,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2025-02-17 22:45:38,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:45:38,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:38,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 12 letters. Loop has 4 letters. [2025-02-17 22:45:38,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:38,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 8 letters. Loop has 8 letters. [2025-02-17 22:45:38,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:38,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 418 states and 877 transitions. [2025-02-17 22:45:38,389 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2025-02-17 22:45:38,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 418 states to 260 states and 542 transitions. [2025-02-17 22:45:38,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2025-02-17 22:45:38,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2025-02-17 22:45:38,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 260 states and 542 transitions. [2025-02-17 22:45:38,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:38,394 INFO L218 hiAutomatonCegarLoop]: Abstraction has 260 states and 542 transitions. [2025-02-17 22:45:38,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states and 542 transitions. [2025-02-17 22:45:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 143. [2025-02-17 22:45:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 143 states have (on average 2.13986013986014) internal successors, (306), 142 states have internal predecessors, (306), 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:45:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 306 transitions. [2025-02-17 22:45:38,399 INFO L240 hiAutomatonCegarLoop]: Abstraction has 143 states and 306 transitions. [2025-02-17 22:45:38,399 INFO L432 stractBuchiCegarLoop]: Abstraction has 143 states and 306 transitions. [2025-02-17 22:45:38,399 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:45:38,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 306 transitions. [2025-02-17 22:45:38,400 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2025-02-17 22:45:38,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:38,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:38,400 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2025-02-17 22:45:38,400 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-17 22:45:38,401 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[58] L21-->L23: Formula: (< v_x2_1 v_w_1) InVars {x2=v_x2_1, w=v_w_1} OutVars{x2=v_x2_1, w=v_w_1} AuxVars[] AssignedVars[]" "[75] L12-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[62] $Ultimate##0-->L39-1: Formula: (< 0 v_d_3) InVars {d=v_d_3} OutVars{d=v_d_3} AuxVars[] AssignedVars[]" "[60] L23-->L24: Formula: (= (+ v_d_2 v_d_1) 0) InVars {d=v_d_2} OutVars{d=v_d_1} AuxVars[] AssignedVars[d]" "[61] L24-->L21: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[58] L21-->L23: Formula: (< v_x2_1 v_w_1) InVars {x2=v_x2_1, w=v_w_1} OutVars{x2=v_x2_1, w=v_w_1} AuxVars[] AssignedVars[]" "[60] L23-->L24: Formula: (= (+ v_d_2 v_d_1) 0) InVars {d=v_d_2} OutVars{d=v_d_1} AuxVars[] AssignedVars[d]" [2025-02-17 22:45:38,401 INFO L754 eck$LassoCheckResult]: Loop: "[64] L39-1-->L34: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[66] L34-->L35: Formula: (= v_x1_5 (+ v_x1_6 v_d_4)) InVars {x1=v_x1_6, d=v_d_4} OutVars{x1=v_x1_5, d=v_d_4} AuxVars[] AssignedVars[x1]" "[68] L35-->L35-2: Formula: (< v_z_2 v_x1_2) InVars {x1=v_x1_2, z=v_z_2} OutVars{x1=v_x1_2, z=v_z_2} AuxVars[] AssignedVars[]" "[71] L35-2-->L39-1: Formula: (< v_x1_4 v_y_2) InVars {y=v_y_2, x1=v_x1_4} OutVars{y=v_y_2, x1=v_x1_4} AuxVars[] AssignedVars[]" [2025-02-17 22:45:38,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:38,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1165303293, now seen corresponding path program 2 times [2025-02-17 22:45:38,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:38,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911417137] [2025-02-17 22:45:38,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:45:38,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:38,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-17 22:45:38,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:38,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-17 22:45:38,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:38,406 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:38,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:38,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:38,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:38,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:38,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:38,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:38,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2895750, now seen corresponding path program 4 times [2025-02-17 22:45:38,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:38,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563880706] [2025-02-17 22:45:38,412 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-17 22:45:38,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:38,414 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-02-17 22:45:38,418 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:38,418 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-17 22:45:38,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:38,419 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:38,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:38,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:38,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:38,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:38,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:38,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash -695058296, now seen corresponding path program 2 times [2025-02-17 22:45:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:38,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21554291] [2025-02-17 22:45:38,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:45:38,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:38,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-17 22:45:38,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-17 22:45:38,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-17 22:45:38,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:38,433 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:38,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-17 22:45:38,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-17 22:45:38,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:38,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:38,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:38,498 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:38,498 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:38,498 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:38,498 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:38,498 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:38,498 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:38,498 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:38,498 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:38,498 INFO L132 ssoRankerPreferences]: Filename of dumped script: lswitch.c.bpl_petrified1_Iteration6_Lasso [2025-02-17 22:45:38,498 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:38,498 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:38,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:38,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:38,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:38,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:38,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:38,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:38,569 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:38,569 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:38,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:38,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:38,572 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:38,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-17 22:45:38,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:38,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:38,593 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:38,593 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f=1} Honda state: {f=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:38,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:38,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:38,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:38,600 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:38,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-17 22:45:38,603 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:38,603 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:38,615 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:38,615 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar0=0} Honda state: {thread2Thread1of1ForFork0_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:38,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-02-17 22:45:38,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:38,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:38,624 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:38,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-17 22:45:38,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:38,626 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:38,644 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:38,644 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {w=-5, x2=-7} Honda state: {w=-5, x2=-6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:38,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-02-17 22:45:38,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:38,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:38,651 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:38,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-17 22:45:38,653 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:38,653 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:38,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-02-17 22:45:38,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:38,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:38,671 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:38,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-17 22:45:38,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:38,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:38,871 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:38,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-02-17 22:45:38,877 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:38,877 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:38,877 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:38,877 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:38,877 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:38,877 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:38,877 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:38,877 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:38,877 INFO L132 ssoRankerPreferences]: Filename of dumped script: lswitch.c.bpl_petrified1_Iteration6_Lasso [2025-02-17 22:45:38,877 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:38,877 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:38,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:38,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:38,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:38,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:38,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:38,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:38,951 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:38,951 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:38,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:38,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:38,953 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:38,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-17 22:45:38,955 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:45:38,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:38,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:38,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:38,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:38,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:38,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:38,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:38,967 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:38,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-17 22:45:38,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:38,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:38,976 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:38,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-17 22:45:38,978 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:45:38,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:38,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:38,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:38,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:38,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:38,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:38,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:38,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:38,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:39,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:39,001 INFO L229 MonitoredProcess]: Starting monitored process 37 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:45:39,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-17 22:45:39,004 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:45:39,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:39,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:39,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:39,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:39,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:39,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:39,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:39,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:39,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:39,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:39,028 INFO L229 MonitoredProcess]: Starting monitored process 38 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:45:39,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-17 22:45:39,030 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:45:39,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:39,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:39,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:39,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:39,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:39,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:39,048 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:39,053 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:39,053 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:39,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:39,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:39,055 INFO L229 MonitoredProcess]: Starting monitored process 39 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:45:39,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-02-17 22:45:39,056 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:39,067 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:45:39,067 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:39,067 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(d, x1, y) = -1*d - 1*x1 + 1*y Supporting invariants [1*d - 1 >= 0] [2025-02-17 22:45:39,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:39,075 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:45:39,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:39,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:39,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:39,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:39,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:39,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:39,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:39,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:39,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:39,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:39,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:39,128 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:39,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:39,150 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:45:39,151 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-02-17 22:45:39,151 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 306 transitions. cyclomatic complexity: 180 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:45:39,207 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 306 transitions. cyclomatic complexity: 180. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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 217 states and 458 transitions. Complement of second has 9 states. [2025-02-17 22:45:39,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-17 22:45:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:45:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2025-02-17 22:45:39,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:45:39,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:39,208 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-17 22:45:39,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:39,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:39,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:39,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:39,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:39,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:39,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:39,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:39,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:39,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:39,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:39,259 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:39,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:39,285 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:45:39,286 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2025-02-17 22:45:39,286 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 306 transitions. cyclomatic complexity: 180 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:45:39,334 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 306 transitions. cyclomatic complexity: 180. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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 217 states and 458 transitions. Complement of second has 9 states. [2025-02-17 22:45:39,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-17 22:45:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:45:39,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2025-02-17 22:45:39,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:45:39,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:39,335 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-17 22:45:39,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:39,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:39,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:39,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:39,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:39,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:39,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:39,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:39,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:39,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:39,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:39,395 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:39,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:39,419 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:45:39,419 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-02-17 22:45:39,419 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 306 transitions. cyclomatic complexity: 180 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:45:39,494 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 306 transitions. cyclomatic complexity: 180. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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 364 states and 762 transitions. Complement of second has 11 states. [2025-02-17 22:45:39,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-17 22:45:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:45:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2025-02-17 22:45:39,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 55 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:45:39,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:39,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 55 transitions. Stem has 12 letters. Loop has 4 letters. [2025-02-17 22:45:39,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:39,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 55 transitions. Stem has 8 letters. Loop has 8 letters. [2025-02-17 22:45:39,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:39,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 364 states and 762 transitions. [2025-02-17 22:45:39,498 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2025-02-17 22:45:39,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 364 states to 246 states and 505 transitions. [2025-02-17 22:45:39,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2025-02-17 22:45:39,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2025-02-17 22:45:39,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 505 transitions. [2025-02-17 22:45:39,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:39,500 INFO L218 hiAutomatonCegarLoop]: Abstraction has 246 states and 505 transitions. [2025-02-17 22:45:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 505 transitions. [2025-02-17 22:45:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 194. [2025-02-17 22:45:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 194 states have (on average 2.1082474226804124) internal successors, (409), 193 states have internal predecessors, (409), 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:45:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 409 transitions. [2025-02-17 22:45:39,504 INFO L240 hiAutomatonCegarLoop]: Abstraction has 194 states and 409 transitions. [2025-02-17 22:45:39,505 INFO L432 stractBuchiCegarLoop]: Abstraction has 194 states and 409 transitions. [2025-02-17 22:45:39,505 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-17 22:45:39,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 409 transitions. [2025-02-17 22:45:39,506 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2025-02-17 22:45:39,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:39,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:39,506 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1] [2025-02-17 22:45:39,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-17 22:45:39,506 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[58] L21-->L23: Formula: (< v_x2_1 v_w_1) InVars {x2=v_x2_1, w=v_w_1} OutVars{x2=v_x2_1, w=v_w_1} AuxVars[] AssignedVars[]" "[75] L12-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[62] $Ultimate##0-->L39-1: Formula: (< 0 v_d_3) InVars {d=v_d_3} OutVars{d=v_d_3} AuxVars[] AssignedVars[]" "[60] L23-->L24: Formula: (= (+ v_d_2 v_d_1) 0) InVars {d=v_d_2} OutVars{d=v_d_1} AuxVars[] AssignedVars[d]" "[61] L24-->L21: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[58] L21-->L23: Formula: (< v_x2_1 v_w_1) InVars {x2=v_x2_1, w=v_w_1} OutVars{x2=v_x2_1, w=v_w_1} AuxVars[] AssignedVars[]" "[60] L23-->L24: Formula: (= (+ v_d_2 v_d_1) 0) InVars {d=v_d_2} OutVars{d=v_d_1} AuxVars[] AssignedVars[d]" "[61] L24-->L21: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[58] L21-->L23: Formula: (< v_x2_1 v_w_1) InVars {x2=v_x2_1, w=v_w_1} OutVars{x2=v_x2_1, w=v_w_1} AuxVars[] AssignedVars[]" "[60] L23-->L24: Formula: (= (+ v_d_2 v_d_1) 0) InVars {d=v_d_2} OutVars{d=v_d_1} AuxVars[] AssignedVars[d]" [2025-02-17 22:45:39,506 INFO L754 eck$LassoCheckResult]: Loop: "[64] L39-1-->L34: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[66] L34-->L35: Formula: (= v_x1_5 (+ v_x1_6 v_d_4)) InVars {x1=v_x1_6, d=v_d_4} OutVars{x1=v_x1_5, d=v_d_4} AuxVars[] AssignedVars[x1]" "[68] L35-->L35-2: Formula: (< v_z_2 v_x1_2) InVars {x1=v_x1_2, z=v_z_2} OutVars{x1=v_x1_2, z=v_z_2} AuxVars[] AssignedVars[]" "[71] L35-2-->L39-1: Formula: (< v_x1_4 v_y_2) InVars {y=v_y_2, x1=v_x1_4} OutVars{y=v_y_2, x1=v_x1_4} AuxVars[] AssignedVars[]" [2025-02-17 22:45:39,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:39,507 INFO L85 PathProgramCache]: Analyzing trace with hash 670312284, now seen corresponding path program 3 times [2025-02-17 22:45:39,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:39,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824004962] [2025-02-17 22:45:39,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-17 22:45:39,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:39,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 3 equivalence classes. [2025-02-17 22:45:39,510 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:45:39,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-17 22:45:39,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:39,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:39,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:45:39,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:45:39,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:39,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:39,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:39,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:39,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2895750, now seen corresponding path program 5 times [2025-02-17 22:45:39,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:39,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030654343] [2025-02-17 22:45:39,514 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-17 22:45:39,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:39,516 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:39,516 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:39,516 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:45:39,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:39,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:39,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:39,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:39,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:39,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:39,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:39,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:39,519 INFO L85 PathProgramCache]: Analyzing trace with hash 951529825, now seen corresponding path program 3 times [2025-02-17 22:45:39,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:39,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847007072] [2025-02-17 22:45:39,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-17 22:45:39,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:39,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 3 equivalence classes. [2025-02-17 22:45:39,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-02-17 22:45:39,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-17 22:45:39,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:39,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:39,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-17 22:45:39,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-17 22:45:39,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:39,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:39,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:39,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-02-17 22:45:39,609 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:39,610 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:39,610 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:39,610 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:39,610 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:39,610 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:39,610 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:39,610 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:39,610 INFO L132 ssoRankerPreferences]: Filename of dumped script: lswitch.c.bpl_petrified1_Iteration7_Lasso [2025-02-17 22:45:39,610 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:39,610 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:39,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:39,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:39,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:39,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:39,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:39,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:39,679 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:39,679 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:39,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:39,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:39,681 INFO L229 MonitoredProcess]: Starting monitored process 40 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:45:39,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-02-17 22:45:39,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:39,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:39,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-02-17 22:45:39,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:39,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:39,702 INFO L229 MonitoredProcess]: Starting monitored process 41 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:45:39,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-02-17 22:45:39,704 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:39,704 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:39,908 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:39,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-02-17 22:45:39,916 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:39,916 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:39,916 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:39,916 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:39,916 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:39,916 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:39,916 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:39,916 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:39,916 INFO L132 ssoRankerPreferences]: Filename of dumped script: lswitch.c.bpl_petrified1_Iteration7_Lasso [2025-02-17 22:45:39,916 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:39,916 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:39,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:39,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:39,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:39,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:39,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:39,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:39,984 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:39,984 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:39,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:39,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:39,988 INFO L229 MonitoredProcess]: Starting monitored process 42 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:45:39,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-02-17 22:45:39,990 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:45:40,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:40,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:40,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:40,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:40,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:40,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:40,007 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:40,018 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-17 22:45:40,018 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:40,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:40,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:40,020 INFO L229 MonitoredProcess]: Starting monitored process 43 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:45:40,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-02-17 22:45:40,021 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:40,032 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:45:40,032 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:40,032 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(d, x1, z) = 1*d + 1*x1 - 1*z Supporting invariants [-1*d - 1 >= 0] [2025-02-17 22:45:40,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-02-17 22:45:40,040 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:45:40,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:40,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:45:40,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:45:40,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:40,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:40,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-17 22:45:40,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:40,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:40,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:40,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:40,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:40,095 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:40,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:40,136 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:45:40,136 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2025-02-17 22:45:40,136 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 194 states and 409 transitions. cyclomatic complexity: 232 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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:45:40,189 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 194 states and 409 transitions. cyclomatic complexity: 232. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 277 states and 582 transitions. Complement of second has 9 states. [2025-02-17 22:45:40,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-17 22:45:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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:45:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2025-02-17 22:45:40,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 11 letters. Loop has 4 letters. [2025-02-17 22:45:40,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:40,190 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-17 22:45:40,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:40,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:45:40,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:45:40,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:40,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:40,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-17 22:45:40,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:40,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:40,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:40,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:40,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:40,255 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:40,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:40,283 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:45:40,283 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 3 loop predicates [2025-02-17 22:45:40,284 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 194 states and 409 transitions. cyclomatic complexity: 232 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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:45:40,339 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 194 states and 409 transitions. cyclomatic complexity: 232. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 295 states and 617 transitions. Complement of second has 11 states. [2025-02-17 22:45:40,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 3 non-accepting loop states 2 accepting loop states [2025-02-17 22:45:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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:45:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2025-02-17 22:45:40,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 11 letters. Loop has 4 letters. [2025-02-17 22:45:40,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:40,340 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-17 22:45:40,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:40,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:45:40,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:45:40,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:40,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:40,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-17 22:45:40,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:40,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:40,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:40,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:40,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:40,405 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:40,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:40,436 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:45:40,436 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2025-02-17 22:45:40,436 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 194 states and 409 transitions. cyclomatic complexity: 232 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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:45:40,494 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 194 states and 409 transitions. cyclomatic complexity: 232. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 316 states and 668 transitions. Complement of second has 10 states. [2025-02-17 22:45:40,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-17 22:45:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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:45:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2025-02-17 22:45:40,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 50 transitions. Stem has 11 letters. Loop has 4 letters. [2025-02-17 22:45:40,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:40,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 50 transitions. Stem has 15 letters. Loop has 4 letters. [2025-02-17 22:45:40,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:40,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 50 transitions. Stem has 11 letters. Loop has 8 letters. [2025-02-17 22:45:40,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:40,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 668 transitions. [2025-02-17 22:45:40,498 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:40,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 0 states and 0 transitions. [2025-02-17 22:45:40,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:45:40,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:45:40,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:45:40,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:45:40,498 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:40,498 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:40,498 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:40,498 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-17 22:45:40,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:45:40,498 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:40,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:45:40,505 INFO L201 PluginConnector]: Adding new model lswitch.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:45:40 BoogieIcfgContainer [2025-02-17 22:45:40,505 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:45:40,505 INFO L158 Benchmark]: Toolchain (without parser) took 6334.34ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 50.8MB in the end (delta: 33.0MB). Peak memory consumption was 34.5MB. Max. memory is 8.0GB. [2025-02-17 22:45:40,506 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:40,506 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.13ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 82.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:40,506 INFO L158 Benchmark]: Boogie Preprocessor took 9.59ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 81.9MB in the end (delta: 563.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:40,506 INFO L158 Benchmark]: RCFGBuilder took 161.87ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 73.1MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:45:40,506 INFO L158 Benchmark]: BuchiAutomizer took 6144.54ms. Allocated memory is still 155.2MB. Free memory was 73.0MB in the beginning and 50.8MB in the end (delta: 22.2MB). Peak memory consumption was 26.1MB. Max. memory is 8.0GB. [2025-02-17 22:45:40,507 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.14ms. Allocated memory is still 155.2MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 16.13ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 82.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 9.59ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 81.9MB in the end (delta: 563.6kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 161.87ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 73.1MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 6144.54ms. Allocated memory is still 155.2MB. Free memory was 73.0MB in the beginning and 50.8MB in the end (delta: 22.2MB). Peak memory consumption was 26.1MB. 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 7 terminating modules (1 trivial, 3 deterministic, 3 nondeterministic). One deterministic module has affine ranking function w + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * d + -1 * x1 + y and consists of 4 locations. One deterministic module has affine ranking function -1 * z + x1 + d and consists of 6 locations. One nondeterministic module has affine ranking function -1 * z + x1 + d and consists of 6 locations. One nondeterministic module has affine ranking function -1 * d + -1 * x1 + y and consists of 7 locations. One nondeterministic module has affine ranking function -1 * z + x1 + d and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 3.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 242 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 333 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 491 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 252 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 414 IncrementalHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 239 mSDtfsCounter, 414 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf100 lsp57 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq143 hnf94 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.4s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:45:40,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-02-17 22:45:40,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...