/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/4_plus_thr/me1-5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:26:02,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:26:02,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:26:02,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:26:02,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:26:02,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:26:02,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:26:02,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:26:02,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:26:02,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:26:02,163 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:26:02,163 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:26:02,163 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:26:02,163 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:26:02,164 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:26:02,164 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:26:02,164 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:26:02,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:26:02,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:26:02,164 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:26:02,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:26:02,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:26:02,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:26:02,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:26:02,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:26:02,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:26:02,164 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:26:02,164 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:26:02,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:26:02,164 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:26:02,164 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:26:02,165 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:26:02,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:26:02,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:26:02,165 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:26:02,165 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:26:02,165 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:26:02,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:26:02,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:26:02,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:26:02,409 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:26:02,409 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:26:02,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/me1-5.c.bpl [2025-04-26 16:26:02,412 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/me1-5.c.bpl' [2025-04-26 16:26:02,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:26:02,429 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:26:02,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:26:02,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:26:02,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:26:02,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:02" (1/1) ... [2025-04-26 16:26:02,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:02" (1/1) ... [2025-04-26 16:26:02,470 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:26:02,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:26:02,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:26:02,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:26:02,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:26:02,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:02" (1/1) ... [2025-04-26 16:26:02,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:02" (1/1) ... [2025-04-26 16:26:02,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:02" (1/1) ... [2025-04-26 16:26:02,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:02" (1/1) ... [2025-04-26 16:26:02,481 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:02" (1/1) ... [2025-04-26 16:26:02,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:02" (1/1) ... [2025-04-26 16:26:02,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:02" (1/1) ... [2025-04-26 16:26:02,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:02" (1/1) ... [2025-04-26 16:26:02,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:02" (1/1) ... [2025-04-26 16:26:02,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:26:02,501 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:26:02,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:26:02,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:26:02,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:02" (1/1) ... [2025-04-26 16:26:02,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:02,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:02,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:26:02,552 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:26:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:26:02,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:26:02,552 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:26:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:26:02,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:26:02,552 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:26:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:26:02,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:26:02,552 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:26:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:26:02,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:26:02,553 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:26:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:26:02,553 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:26:02,553 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:26:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:26:02,553 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:26:02,553 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:26:02,592 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:26:02,594 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:26:02,682 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:26:02,682 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:26:02,690 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:26:02,690 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:26:02,691 INFO L201 PluginConnector]: Adding new model me1-5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:26:02 BoogieIcfgContainer [2025-04-26 16:26:02,692 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:26:02,692 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:26:02,692 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:26:02,697 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:26:02,698 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:26:02,698 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:02" (1/2) ... [2025-04-26 16:26:02,701 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@597d739d and model type me1-5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:26:02, skipping insertion in model container [2025-04-26 16:26:02,701 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:26:02,701 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:26:02" (2/2) ... [2025-04-26 16:26:02,702 INFO L376 chiAutomizerObserver]: Analyzing ICFG me1-5.c.bpl [2025-04-26 16:26:02,752 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 16:26:02,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 127 flow [2025-04-26 16:26:02,801 INFO L116 PetriNetUnfolderBase]: 5/36 cut-off events. [2025-04-26 16:26:02,804 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 16:26:02,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 36 events. 5/36 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-04-26 16:26:02,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 46 transitions, 127 flow [2025-04-26 16:26:02,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 36 transitions, 102 flow [2025-04-26 16:26:02,815 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 47 places, 36 transitions, 102 flow [2025-04-26 16:26:02,823 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:26:02,823 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:26:02,823 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:26:02,823 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:26:02,823 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:26:02,823 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:26:02,824 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:26:02,824 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:26:02,825 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:26:03,318 INFO L131 ngComponentsAnalysis]: Automaton has 1001 accepting balls. 3542 [2025-04-26 16:26:03,319 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:03,319 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:03,322 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:26:03,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:03,323 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:26:03,323 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 3907 states, but on-demand construction may add more states [2025-04-26 16:26:03,405 INFO L131 ngComponentsAnalysis]: Automaton has 1001 accepting balls. 3542 [2025-04-26 16:26:03,405 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:03,405 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:03,405 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:26:03,406 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:03,410 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:26:03,410 INFO L754 eck$LassoCheckResult]: Loop: "[90] L33-->L35: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[92] L35-->L33: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:26:03,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,415 INFO L85 PathProgramCache]: Analyzing trace with hash 3680, now seen corresponding path program 1 times [2025-04-26 16:26:03,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:03,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108136191] [2025-04-26 16:26:03,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:03,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:03,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,483 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:03,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:03,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,511 INFO L85 PathProgramCache]: Analyzing trace with hash 3843, now seen corresponding path program 1 times [2025-04-26 16:26:03,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:03,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497151215] [2025-04-26 16:26:03,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:03,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:03,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:03,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:03,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,531 INFO L85 PathProgramCache]: Analyzing trace with hash 3539362, now seen corresponding path program 1 times [2025-04-26 16:26:03,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:03,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788110213] [2025-04-26 16:26:03,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:03,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:03,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:03,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:03,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,542 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:03,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:03,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:03,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:03,595 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:03,596 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:03,596 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:03,597 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:03,597 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:03,597 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,598 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:03,598 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:03,598 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:26:03,598 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:03,598 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:03,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:03,663 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:03,664 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:03,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:03,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:26:03,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:03,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:03,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:26:03,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,700 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:03,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:26:03,703 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:03,703 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:03,776 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:03,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:26:03,781 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:03,781 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:03,781 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:03,781 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:03,781 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:03,781 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,781 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:03,781 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:03,781 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:26:03,781 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:03,782 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:03,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:03,808 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:03,811 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:03,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:03,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:26:03,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:26:03,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:03,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:03,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:03,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:03,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:03,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:03,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:03,843 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:03,852 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:03,852 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:03,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:03,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:26:03,859 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:03,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:26:03,863 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:03,863 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:03,865 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-04-26 16:26:03,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:26:03,878 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:03,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:03,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:03,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:03,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:03,974 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:03,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:03,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:26:04,038 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:26:04,041 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 3907 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:04,354 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 3907 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 10934 states and 58472 transitions. Complement of second has 6 states. [2025-04-26 16:26:04,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:26:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-26 16:26:04,365 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:26:04,365 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:04,365 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:26:04,366 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:04,366 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:26:04,366 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:04,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10934 states and 58472 transitions. [2025-04-26 16:26:04,695 INFO L131 ngComponentsAnalysis]: Automaton has 1100 accepting balls. 3300 [2025-04-26 16:26:04,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10934 states to 8172 states and 44013 transitions. [2025-04-26 16:26:04,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3704 [2025-04-26 16:26:04,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5938 [2025-04-26 16:26:04,903 INFO L74 IsDeterministic]: Start isDeterministic. Operand 8172 states and 44013 transitions. [2025-04-26 16:26:04,903 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:04,903 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8172 states and 44013 transitions. [2025-04-26 16:26:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8172 states and 44013 transitions. [2025-04-26 16:26:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8172 to 5940. [2025-04-26 16:26:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5940 states, 5940 states have (on average 5.548484848484849) internal successors, (in total 32958), 5939 states have internal predecessors, (32958), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5940 states to 5940 states and 32958 transitions. [2025-04-26 16:26:05,238 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5940 states and 32958 transitions. [2025-04-26 16:26:05,238 INFO L438 stractBuchiCegarLoop]: Abstraction has 5940 states and 32958 transitions. [2025-04-26 16:26:05,238 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:26:05,238 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5940 states and 32958 transitions. [2025-04-26 16:26:05,313 INFO L131 ngComponentsAnalysis]: Automaton has 1100 accepting balls. 3300 [2025-04-26 16:26:05,314 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:05,314 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:05,315 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:26:05,315 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:05,315 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] L18-1-->L42: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:26:05,316 INFO L754 eck$LassoCheckResult]: Loop: "[94] L42-->L44: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[96] L44-->L42: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:26:05,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:05,317 INFO L85 PathProgramCache]: Analyzing trace with hash 114198, now seen corresponding path program 1 times [2025-04-26 16:26:05,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:05,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695812514] [2025-04-26 16:26:05,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:05,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:05,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:05,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:05,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:05,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:05,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:05,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:05,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:05,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:05,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:05,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:05,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:05,338 INFO L85 PathProgramCache]: Analyzing trace with hash 3971, now seen corresponding path program 1 times [2025-04-26 16:26:05,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:05,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445016945] [2025-04-26 16:26:05,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:05,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:05,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:05,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:05,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:05,341 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:05,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:05,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:05,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:05,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:05,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:05,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:05,349 INFO L85 PathProgramCache]: Analyzing trace with hash 109747288, now seen corresponding path program 1 times [2025-04-26 16:26:05,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:05,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091181324] [2025-04-26 16:26:05,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:05,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:05,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:05,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:05,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:05,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:05,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:05,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:05,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:05,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:05,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:05,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:05,396 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:05,396 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:05,396 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:05,396 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:05,396 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:05,396 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:05,396 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:05,396 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:05,396 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:26:05,396 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:05,396 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:05,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:05,427 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:05,428 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:05,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:05,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:05,431 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:05,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:26:05,433 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:05,434 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:05,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:05,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:05,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:05,454 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:05,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:26:05,456 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:05,457 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:05,522 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:05,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:26:05,527 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:05,527 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:05,527 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:05,527 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:05,527 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:05,527 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:05,527 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:05,527 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:05,527 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:26:05,527 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:05,527 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:05,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:05,551 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:05,551 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:05,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:05,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:05,554 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:05,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:26:05,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:26:05,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:05,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:05,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:05,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:05,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:05,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:05,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:05,570 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:05,575 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:05,575 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:05,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:05,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:05,577 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:05,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:26:05,579 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:05,582 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:26:05,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:05,583 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:05,583 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:05,583 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 16:26:05,589 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-04-26 16:26:05,590 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:05,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:05,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:05,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:05,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:05,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:05,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:05,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:05,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:05,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:05,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:05,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:05,620 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:05,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:26:05,634 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:26:05,634 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5940 states and 32958 transitions. cyclomatic complexity: 28423 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:06,107 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5940 states and 32958 transitions. cyclomatic complexity: 28423. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 22316 states and 125067 transitions. Complement of second has 7 states. [2025-04-26 16:26:06,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:26:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:06,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-04-26 16:26:06,109 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:26:06,109 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:06,109 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:26:06,109 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:06,109 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:26:06,109 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:06,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22316 states and 125067 transitions. [2025-04-26 16:26:06,568 INFO L131 ngComponentsAnalysis]: Automaton has 1890 accepting balls. 5012 [2025-04-26 16:26:06,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22316 states to 16850 states and 95442 transitions. [2025-04-26 16:26:06,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7505 [2025-04-26 16:26:06,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9720 [2025-04-26 16:26:06,931 INFO L74 IsDeterministic]: Start isDeterministic. Operand 16850 states and 95442 transitions. [2025-04-26 16:26:06,931 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:06,931 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16850 states and 95442 transitions. [2025-04-26 16:26:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16850 states and 95442 transitions. [2025-04-26 16:26:07,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16850 to 11909. [2025-04-26 16:26:07,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11909 states, 11909 states have (on average 5.921991770929549) internal successors, (in total 70525), 11908 states have internal predecessors, (70525), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:07,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11909 states to 11909 states and 70525 transitions. [2025-04-26 16:26:07,451 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11909 states and 70525 transitions. [2025-04-26 16:26:07,451 INFO L438 stractBuchiCegarLoop]: Abstraction has 11909 states and 70525 transitions. [2025-04-26 16:26:07,451 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:26:07,451 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11909 states and 70525 transitions. [2025-04-26 16:26:07,540 INFO L131 ngComponentsAnalysis]: Automaton has 1386 accepting balls. 3874 [2025-04-26 16:26:07,540 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:07,540 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:07,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:26:07,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:07,541 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] L18-1-->L42: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[121] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[124] L20-->L62: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 16:26:07,541 INFO L754 eck$LassoCheckResult]: Loop: "[104] L62-->L64: Formula: (< v_x3_1 v_z3_1) InVars {z3=v_z3_1, x3=v_x3_1} OutVars{z3=v_z3_1, x3=v_x3_1} AuxVars[] AssignedVars[]" "[106] L64-->L62: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:26:07,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:07,542 INFO L85 PathProgramCache]: Analyzing trace with hash 109748153, now seen corresponding path program 1 times [2025-04-26 16:26:07,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:07,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329415796] [2025-04-26 16:26:07,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:07,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:07,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:07,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:07,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:07,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:07,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:07,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:07,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:07,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:07,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:07,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:07,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:07,550 INFO L85 PathProgramCache]: Analyzing trace with hash 4291, now seen corresponding path program 1 times [2025-04-26 16:26:07,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:07,551 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106191707] [2025-04-26 16:26:07,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:07,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:07,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:07,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:07,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:07,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:07,553 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:07,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:07,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:07,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:07,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:07,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:07,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:07,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1906204037, now seen corresponding path program 1 times [2025-04-26 16:26:07,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:07,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400168919] [2025-04-26 16:26:07,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:07,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:07,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:26:07,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:26:07,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:07,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:07,561 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:07,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:26:07,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:26:07,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:07,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:07,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:07,586 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:07,586 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:07,586 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:07,586 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:07,586 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:07,586 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:07,586 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:07,587 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:07,587 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:26:07,587 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:07,587 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:07,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:07,608 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:07,608 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:07,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:07,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:07,610 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:07,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:26:07,613 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:07,613 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:07,634 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-04-26 16:26:07,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:07,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:07,637 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:07,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:26:07,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:07,643 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:07,718 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:07,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:26:07,723 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:07,723 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:07,723 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:07,723 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:07,723 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:07,723 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:07,723 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:07,723 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:07,723 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:26:07,723 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:07,723 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:07,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:07,742 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:07,743 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:07,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:07,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:07,745 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:07,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:26:07,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:26:07,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:07,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:07,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:07,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:07,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:07,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:07,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:07,762 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:07,763 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:26:07,764 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:26:07,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:07,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:07,766 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:07,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:26:07,768 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:07,771 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:26:07,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:26:07,773 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:07,773 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:07,773 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z3, x3) = 1*z3 - 1*x3 Supporting invariants [] [2025-04-26 16:26:07,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:07,779 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:07,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:07,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:07,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:07,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:07,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:07,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:07,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:07,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:07,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:07,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:07,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:07,821 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:07,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:26:07,837 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:26:07,837 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11909 states and 70525 transitions. cyclomatic complexity: 61011 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:08,638 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11909 states and 70525 transitions. cyclomatic complexity: 61011. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 43098 states and 257005 transitions. Complement of second has 7 states. [2025-04-26 16:26:08,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:26:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-04-26 16:26:08,639 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:26:08,639 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:08,639 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:26:08,639 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:08,639 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:26:08,639 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:08,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43098 states and 257005 transitions. [2025-04-26 16:26:09,453 INFO L131 ngComponentsAnalysis]: Automaton has 1886 accepting balls. 4964 [2025-04-26 16:26:09,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43098 states to 31342 states and 188014 transitions. [2025-04-26 16:26:09,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11384 [2025-04-26 16:26:09,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14197 [2025-04-26 16:26:09,956 INFO L74 IsDeterministic]: Start isDeterministic. Operand 31342 states and 188014 transitions. [2025-04-26 16:26:09,956 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:09,956 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31342 states and 188014 transitions. [2025-04-26 16:26:09,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31342 states and 188014 transitions. [2025-04-26 16:26:10,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31342 to 23421. [2025-04-26 16:26:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23421 states, 23421 states have (on average 6.229879168267794) internal successors, (in total 145910), 23420 states have internal predecessors, (145910), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23421 states to 23421 states and 145910 transitions. [2025-04-26 16:26:10,939 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23421 states and 145910 transitions. [2025-04-26 16:26:10,939 INFO L438 stractBuchiCegarLoop]: Abstraction has 23421 states and 145910 transitions. [2025-04-26 16:26:10,939 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:26:10,939 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23421 states and 145910 transitions. [2025-04-26 16:26:11,283 INFO L131 ngComponentsAnalysis]: Automaton has 1514 accepting balls. 4100 [2025-04-26 16:26:11,283 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:11,283 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:11,284 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:26:11,284 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:11,284 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] L18-1-->L42: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[121] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[98] $Ultimate##0-->L53-1: Formula: (< 0 v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" "[93] L42-->L46: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" [2025-04-26 16:26:11,284 INFO L754 eck$LassoCheckResult]: Loop: "[100] L53-1-->L55: Formula: (< v_y2_1 v_x2_5) InVars {y2=v_y2_1, x2=v_x2_5} OutVars{y2=v_y2_1, x2=v_x2_5} AuxVars[] AssignedVars[]" "[102] L55-->L53-1: Formula: (= v_x2_7 (+ v_x2_6 1)) InVars {x2=v_x2_7} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[x2]" [2025-04-26 16:26:11,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:11,285 INFO L85 PathProgramCache]: Analyzing trace with hash -892775266, now seen corresponding path program 1 times [2025-04-26 16:26:11,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:11,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215823418] [2025-04-26 16:26:11,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:11,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:11,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:11,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:11,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:11,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:26:11,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:26:11,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215823418] [2025-04-26 16:26:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215823418] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:26:11,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:26:11,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:26:11,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836119600] [2025-04-26 16:26:11,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:26:11,335 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:26:11,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:11,336 INFO L85 PathProgramCache]: Analyzing trace with hash 4163, now seen corresponding path program 1 times [2025-04-26 16:26:11,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:11,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530018406] [2025-04-26 16:26:11,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:11,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:11,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:11,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:11,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:11,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:11,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:11,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:11,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:11,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:11,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:11,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:11,362 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:11,362 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:11,362 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:11,362 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:11,362 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:11,363 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:11,363 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:11,363 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:11,363 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:26:11,363 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:11,363 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:11,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:11,382 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:11,383 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:11,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:11,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:11,386 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:11,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:26:11,388 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:11,388 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:11,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:26:11,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:11,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:11,411 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:11,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:26:11,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:11,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:11,484 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:11,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:11,488 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:11,488 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:11,488 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:11,488 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:11,488 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:11,488 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:11,488 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:11,488 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:11,489 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:26:11,489 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:11,489 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:11,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:11,508 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:11,508 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:11,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:11,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:11,512 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:11,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:26:11,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:26:11,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:11,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:11,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:11,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:11,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:11,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:11,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:11,528 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:11,533 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:11,533 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:11,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:11,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:11,535 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:11,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:26:11,538 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:11,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:11,542 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:11,542 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:11,542 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y2, x2) = -1*y2 + 1*x2 Supporting invariants [] [2025-04-26 16:26:11,553 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-04-26 16:26:11,554 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:11,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:11,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:11,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:11,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:11,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:11,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:11,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:11,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:11,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:11,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:11,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:11,607 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:11,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:26:11,625 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:26:11,625 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23421 states and 145910 transitions. cyclomatic complexity: 126519 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:12,224 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23421 states and 145910 transitions. cyclomatic complexity: 126519. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 43857 states and 265455 transitions. Complement of second has 6 states. [2025-04-26 16:26:12,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:26:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-04-26 16:26:12,225 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:26:12,225 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:12,225 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:26:12,225 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:12,225 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:26:12,225 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:12,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43857 states and 265455 transitions. [2025-04-26 16:26:13,059 INFO L131 ngComponentsAnalysis]: Automaton has 1330 accepting balls. 3572 [2025-04-26 16:26:13,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43857 states to 34713 states and 208578 transitions. [2025-04-26 16:26:13,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11834 [2025-04-26 16:26:13,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13992 [2025-04-26 16:26:13,712 INFO L74 IsDeterministic]: Start isDeterministic. Operand 34713 states and 208578 transitions. [2025-04-26 16:26:13,712 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:13,712 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34713 states and 208578 transitions. [2025-04-26 16:26:13,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34713 states and 208578 transitions. [2025-04-26 16:26:14,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34713 to 31215. [2025-04-26 16:26:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31215 states, 31215 states have (on average 6.158865929841422) internal successors, (in total 192249), 31214 states have internal predecessors, (192249), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31215 states to 31215 states and 192249 transitions. [2025-04-26 16:26:15,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31215 states and 192249 transitions. [2025-04-26 16:26:15,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:26:15,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:26:15,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:26:15,043 INFO L87 Difference]: Start difference. First operand 31215 states and 192249 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:26:15,193 INFO L93 Difference]: Finished difference Result 11676 states and 63335 transitions. [2025-04-26 16:26:15,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11676 states and 63335 transitions. [2025-04-26 16:26:15,336 INFO L131 ngComponentsAnalysis]: Automaton has 427 accepting balls. 996 [2025-04-26 16:26:15,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11676 states to 10840 states and 58997 transitions. [2025-04-26 16:26:15,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3975 [2025-04-26 16:26:15,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3975 [2025-04-26 16:26:15,499 INFO L74 IsDeterministic]: Start isDeterministic. Operand 10840 states and 58997 transitions. [2025-04-26 16:26:15,500 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:15,500 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10840 states and 58997 transitions. [2025-04-26 16:26:15,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10840 states and 58997 transitions. [2025-04-26 16:26:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10840 to 10840. [2025-04-26 16:26:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10840 states, 10840 states have (on average 5.442527675276753) internal successors, (in total 58997), 10839 states have internal predecessors, (58997), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10840 states to 10840 states and 58997 transitions. [2025-04-26 16:26:15,956 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10840 states and 58997 transitions. [2025-04-26 16:26:15,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:26:15,957 INFO L438 stractBuchiCegarLoop]: Abstraction has 10840 states and 58997 transitions. [2025-04-26 16:26:15,957 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:26:15,957 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10840 states and 58997 transitions. [2025-04-26 16:26:16,021 INFO L131 ngComponentsAnalysis]: Automaton has 427 accepting balls. 996 [2025-04-26 16:26:16,021 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:16,022 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:16,022 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:26:16,022 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:16,023 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] L18-1-->L42: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[121] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[124] L20-->L62: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[103] L62-->L66: Formula: (<= v_z3_2 v_x3_4) InVars {z3=v_z3_2, x3=v_x3_4} OutVars{z3=v_z3_2, x3=v_x3_4} AuxVars[] AssignedVars[]" "[127] L21-->$Ultimate##0: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[108] $Ultimate##0-->L73-1: Formula: (< 0 v_h_4) InVars {h=v_h_4} OutVars{h=v_h_4} AuxVars[] AssignedVars[]" [2025-04-26 16:26:16,023 INFO L754 eck$LassoCheckResult]: Loop: "[110] L73-1-->L75: Formula: (< v_y3_1 v_x3_5) InVars {y3=v_y3_1, x3=v_x3_5} OutVars{y3=v_y3_1, x3=v_x3_5} AuxVars[] AssignedVars[]" "[112] L75-->L73-1: Formula: (= (+ v_x3_6 1) v_x3_7) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-04-26 16:26:16,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:16,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1037216795, now seen corresponding path program 1 times [2025-04-26 16:26:16,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:16,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752280415] [2025-04-26 16:26:16,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:16,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:16,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:26:16,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:26:16,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:16,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:26:16,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:26:16,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752280415] [2025-04-26 16:26:16,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752280415] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:26:16,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:26:16,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:26:16,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327793520] [2025-04-26 16:26:16,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:26:16,052 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:26:16,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:16,053 INFO L85 PathProgramCache]: Analyzing trace with hash 4483, now seen corresponding path program 1 times [2025-04-26 16:26:16,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:16,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056263385] [2025-04-26 16:26:16,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:16,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:16,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:16,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:16,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:16,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:16,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:16,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:16,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:16,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:16,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:16,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:16,079 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:16,079 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:16,079 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:16,079 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:16,079 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:16,079 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:16,079 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:16,079 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:16,079 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:26:16,079 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:16,079 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:16,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:16,096 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:16,096 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:16,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:16,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:16,099 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:16,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:26:16,105 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:16,105 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:16,124 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-04-26 16:26:16,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:16,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:16,126 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:16,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:26:16,131 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:16,131 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:16,205 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:16,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:16,210 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:16,210 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:16,210 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:16,210 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:16,210 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:16,210 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:16,210 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:16,210 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:16,210 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:26:16,210 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:16,210 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:16,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:16,226 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:16,226 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:16,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:16,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:16,228 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:16,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:26:16,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:26:16,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:16,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:16,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:16,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:16,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:16,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:16,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:16,245 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:16,248 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:16,248 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:16,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:16,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:16,250 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:16,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:26:16,253 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:16,256 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:26:16,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:16,257 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:16,257 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:16,257 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y3, x3) = -1*y3 + 1*x3 Supporting invariants [] [2025-04-26 16:26:16,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:16,263 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:16,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:16,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:26:16,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:26:16,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:16,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:16,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:16,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:16,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:16,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:16,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:16,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:16,297 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:16,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:26:16,311 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:26:16,311 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10840 states and 58997 transitions. cyclomatic complexity: 49986 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:16,725 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10840 states and 58997 transitions. cyclomatic complexity: 49986. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 29951 states and 156502 transitions. Complement of second has 7 states. [2025-04-26 16:26:16,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:26:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-04-26 16:26:16,726 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:26:16,726 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:16,726 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:26:16,726 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:16,726 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:26:16,726 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:16,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29951 states and 156502 transitions. [2025-04-26 16:26:17,166 INFO L131 ngComponentsAnalysis]: Automaton has 427 accepting balls. 996 [2025-04-26 16:26:17,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29951 states to 18169 states and 93700 transitions. [2025-04-26 16:26:17,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5567 [2025-04-26 16:26:17,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6062 [2025-04-26 16:26:17,380 INFO L74 IsDeterministic]: Start isDeterministic. Operand 18169 states and 93700 transitions. [2025-04-26 16:26:17,380 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:17,380 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18169 states and 93700 transitions. [2025-04-26 16:26:17,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18169 states and 93700 transitions. [2025-04-26 16:26:17,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18169 to 12440. [2025-04-26 16:26:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12440 states, 12440 states have (on average 5.437057877813505) internal successors, (in total 67637), 12439 states have internal predecessors, (67637), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12440 states to 12440 states and 67637 transitions. [2025-04-26 16:26:17,817 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12440 states and 67637 transitions. [2025-04-26 16:26:17,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:26:17,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:26:17,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:26:17,819 INFO L87 Difference]: Start difference. First operand 12440 states and 67637 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (in total 8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:17,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:26:17,847 INFO L93 Difference]: Finished difference Result 3030 states and 14416 transitions. [2025-04-26 16:26:17,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3030 states and 14416 transitions. [2025-04-26 16:26:17,870 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:26:17,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3030 states to 0 states and 0 transitions. [2025-04-26 16:26:17,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:26:17,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:26:17,870 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:26:17,870 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:26:17,870 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:26:17,870 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:26:17,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:26:17,871 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:26:17,871 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:26:17,871 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:26:17,871 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:26:17,871 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:26:17,876 INFO L201 PluginConnector]: Adding new model me1-5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:26:17 BoogieIcfgContainer [2025-04-26 16:26:17,876 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:26:17,877 INFO L158 Benchmark]: Toolchain (without parser) took 15447.85ms. Allocated memory was 155.2MB in the beginning and 6.0GB in the end (delta: 5.9GB). Free memory was 82.4MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2025-04-26 16:26:17,877 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.82ms. Allocated memory is still 155.2MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:26:17,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.49ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 80.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:26:17,877 INFO L158 Benchmark]: Boogie Preprocessor took 27.03ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 79.5MB in the end (delta: 974.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:26:17,879 INFO L158 Benchmark]: RCFGBuilder took 190.91ms. Allocated memory is still 155.2MB. Free memory was 79.4MB in the beginning and 69.9MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:26:17,879 INFO L158 Benchmark]: BuchiAutomizer took 15184.06ms. Allocated memory was 155.2MB in the beginning and 6.0GB in the end (delta: 5.9GB). Free memory was 69.8MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2025-04-26 16:26:17,880 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.82ms. Allocated memory is still 155.2MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.49ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 80.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.03ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 79.5MB in the end (delta: 974.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 190.91ms. Allocated memory is still 155.2MB. Free memory was 79.4MB in the beginning and 69.9MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 15184.06ms. Allocated memory was 155.2MB in the beginning and 6.0GB in the end (delta: 5.9GB). Free memory was 69.8MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.0s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.2s. Büchi inclusion checks took 3.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 4.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 24321 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 4.9s Buchi closure took 0.1s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 375 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 370 mSDsluCounter, 572 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 268 IncrementalHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 283 mSDtfsCounter, 268 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 51ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (2 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z1 and consists of 4 locations. One deterministic module has affine ranking function z2 + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z3 and consists of 4 locations. One deterministic module has affine ranking function -1 * y2 + x2 and consists of 4 locations. One deterministic module has affine ranking function x3 + -1 * y3 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:26:17,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...