/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/me1.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:44:07,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:44:07,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:44:07,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:44:07,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:44:07,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:44:07,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:44:07,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:44:07,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:44:07,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:44:07,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:44:07,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:44:07,141 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:44:07,141 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:44:07,141 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:44:07,142 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:44:07,142 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:44:07,142 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:44:07,142 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:44:07,142 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:44:07,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:44:07,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:44:07,142 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:44:07,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:44:07,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:44:07,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:44:07,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:44:07,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:44:07,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:44:07,142 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:44:07,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:44:07,143 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:44:07,143 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:44:07,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:44:07,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:44:07,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:44:07,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:44:07,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:44:07,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:44:07,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:44:07,143 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:44:07,143 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:44:07,143 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:44:07,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:44:07,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:44:07,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:44:07,387 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:44:07,387 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:44:07,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/me1.c.bpl [2025-04-26 18:44:07,388 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/me1.c.bpl' [2025-04-26 18:44:07,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:44:07,408 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:44:07,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:44:07,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:44:07,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:44:07,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:07" (1/1) ... [2025-04-26 18:44:07,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:07" (1/1) ... [2025-04-26 18:44:07,445 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:44:07,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:44:07,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:44:07,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:44:07,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:44:07,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:07" (1/1) ... [2025-04-26 18:44:07,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:07" (1/1) ... [2025-04-26 18:44:07,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:07" (1/1) ... [2025-04-26 18:44:07,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:07" (1/1) ... [2025-04-26 18:44:07,456 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:07" (1/1) ... [2025-04-26 18:44:07,456 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:07" (1/1) ... [2025-04-26 18:44:07,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:07" (1/1) ... [2025-04-26 18:44:07,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:07" (1/1) ... [2025-04-26 18:44:07,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:07" (1/1) ... [2025-04-26 18:44:07,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:44:07,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:44:07,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:44:07,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:44:07,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:07" (1/1) ... [2025-04-26 18:44:07,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:44:07,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:07,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:07,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:44:07,538 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:44:07,538 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:44:07,539 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:44:07,539 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:44:07,539 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:44:07,539 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:44:07,539 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:44:07,539 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:44:07,539 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:44:07,539 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:44:07,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:44:07,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:44:07,539 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:44:07,539 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:44:07,539 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:44:07,540 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:44:07,580 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:44:07,582 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:44:07,686 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:44:07,686 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:44:07,697 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:44:07,697 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:44:07,697 INFO L201 PluginConnector]: Adding new model me1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:44:07 BoogieIcfgContainer [2025-04-26 18:44:07,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:44:07,698 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:44:07,698 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:44:07,703 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:44:07,704 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:44:07,704 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:07" (1/2) ... [2025-04-26 18:44:07,705 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78e36cbb and model type me1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:44:07, skipping insertion in model container [2025-04-26 18:44:07,705 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:44:07,706 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:44:07" (2/2) ... [2025-04-26 18:44:07,706 INFO L376 chiAutomizerObserver]: Analyzing ICFG me1.c.bpl [2025-04-26 18:44:07,775 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:44:07,812 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:44:07,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:44:07,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:07,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:07,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:44:07,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 38 transitions, 104 flow [2025-04-26 18:44:07,895 INFO L116 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-04-26 18:44:07,900 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:44:07,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 30 events. 4/30 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 67 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-04-26 18:44:07,905 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 38 transitions, 104 flow [2025-04-26 18:44:07,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 30 transitions, 84 flow [2025-04-26 18:44:07,909 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 39 places, 30 transitions, 84 flow [2025-04-26 18:44:07,910 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 84 flow [2025-04-26 18:44:08,023 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 939 states, 938 states have (on average 3.9168443496801704) internal successors, (in total 3674), 938 states have internal predecessors, (3674), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:08,027 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 939 states, 938 states have (on average 3.9168443496801704) internal successors, (in total 3674), 938 states have internal predecessors, (3674), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:08,029 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:44:08,321 WARN L140 AmpleReduction]: Number of pruned transitions: 1372 [2025-04-26 18:44:08,322 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:44:08,322 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 218 [2025-04-26 18:44:08,322 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:40 [2025-04-26 18:44:08,322 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:510 [2025-04-26 18:44:08,322 WARN L145 AmpleReduction]: Times succ was already a loop node:470 [2025-04-26 18:44:08,322 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:44 [2025-04-26 18:44:08,322 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:44:08,325 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 769 states, 768 states have (on average 2.1575520833333335) internal successors, (in total 1657), 768 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:08,333 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:44:08,334 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:44:08,334 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:44:08,334 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:44:08,334 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:44:08,334 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:44:08,334 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:44:08,334 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:44:08,337 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 769 states, 768 states have (on average 2.1575520833333335) internal successors, (in total 1657), 768 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:08,382 INFO L131 ngComponentsAnalysis]: Automaton has 143 accepting balls. 460 [2025-04-26 18:44:08,382 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:08,382 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:08,388 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:44:08,388 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:08,388 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:44:08,390 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 769 states, 768 states have (on average 2.1575520833333335) internal successors, (in total 1657), 768 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:08,403 INFO L131 ngComponentsAnalysis]: Automaton has 143 accepting balls. 460 [2025-04-26 18:44:08,405 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:08,405 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:08,406 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:44:08,406 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:08,411 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:44:08,411 INFO L754 eck$LassoCheckResult]: Loop: "[75] L27-->L29: 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[]" "[77] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:44:08,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash 3165, now seen corresponding path program 1 times [2025-04-26 18:44:08,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:08,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102357068] [2025-04-26 18:44:08,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:08,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:08,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:08,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:08,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,473 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:08,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:08,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:08,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:08,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:08,516 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2025-04-26 18:44:08,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:08,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971820279] [2025-04-26 18:44:08,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:08,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:08,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:08,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:08,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:08,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:08,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:08,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:08,532 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:08,532 INFO L85 PathProgramCache]: Analyzing trace with hash 3043967, now seen corresponding path program 1 times [2025-04-26 18:44:08,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:08,532 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001727459] [2025-04-26 18:44:08,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:08,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:08,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:44:08,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:44:08,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,543 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:08,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:44:08,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:44:08,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:08,638 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:08,641 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:08,641 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:08,641 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:08,641 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:08,641 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:08,641 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:08,641 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:08,642 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:44:08,642 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:08,642 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:08,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:08,692 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:08,692 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:08,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:08,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:08,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:08,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:44:08,700 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:08,700 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:08,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:44:08,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:08,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:08,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:08,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:44:08,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:08,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:08,818 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:08,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:08,824 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:08,825 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:08,825 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:08,825 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:08,825 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:08,825 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:08,825 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:08,825 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:08,825 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:44:08,825 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:08,825 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:08,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:08,860 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:08,864 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:08,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:08,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:08,867 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:08,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:44:08,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:44:08,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:08,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:08,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:08,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:08,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:08,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:08,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:08,895 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:08,901 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:08,901 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:08,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:08,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:08,907 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:08,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:44:08,909 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:08,912 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 18:44:08,913 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:08,913 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:08,914 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-04-26 18:44:08,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:44:08,921 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:08,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:08,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:08,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:08,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:08,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:08,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:08,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:08,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:08,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:08,963 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:08,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:44:09,007 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:44:09,010 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 769 states, 768 states have (on average 2.1575520833333335) internal successors, (in total 1657), 768 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 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 18:44:09,153 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 769 states, 768 states have (on average 2.1575520833333335) internal successors, (in total 1657), 768 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 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 2432 states and 5338 transitions. Complement of second has 7 states. [2025-04-26 18:44:09,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:44:09,158 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 18:44:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-04-26 18:44:09,164 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:44:09,164 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:09,164 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:44:09,164 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:09,164 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:44:09,164 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:09,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2432 states and 5338 transitions. [2025-04-26 18:44:09,198 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 534 [2025-04-26 18:44:09,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2432 states to 1708 states and 3875 transitions. [2025-04-26 18:44:09,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1159 [2025-04-26 18:44:09,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1374 [2025-04-26 18:44:09,229 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1708 states and 3875 transitions. [2025-04-26 18:44:09,229 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:09,229 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1708 states and 3875 transitions. [2025-04-26 18:44:09,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states and 3875 transitions. [2025-04-26 18:44:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1183. [2025-04-26 18:44:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1183 states have (on average 2.4133558748943362) internal successors, (in total 2855), 1182 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 2855 transitions. [2025-04-26 18:44:09,319 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1183 states and 2855 transitions. [2025-04-26 18:44:09,319 INFO L438 stractBuchiCegarLoop]: Abstraction has 1183 states and 2855 transitions. [2025-04-26 18:44:09,319 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:44:09,319 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1183 states and 2855 transitions. [2025-04-26 18:44:09,325 INFO L131 ngComponentsAnalysis]: Automaton has 156 accepting balls. 468 [2025-04-26 18:44:09,325 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:09,325 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:09,325 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:44:09,325 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:09,326 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[74] L27-->L31: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[76] L31-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[79] $Ultimate##0-->L38-1: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 18:44:09,326 INFO L754 eck$LassoCheckResult]: Loop: "[81] L38-1-->L40: Formula: (< v_y1_1 v_x1_5) InVars {y1=v_y1_1, x1=v_x1_5} OutVars{y1=v_y1_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[83] L40-->L38-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 18:44:09,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:09,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1369000473, now seen corresponding path program 1 times [2025-04-26 18:44:09,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:09,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271345598] [2025-04-26 18:44:09,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:09,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:09,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:09,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:09,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:09,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:09,335 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:09,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:09,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:09,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:09,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:09,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:09,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:09,340 INFO L85 PathProgramCache]: Analyzing trace with hash 3555, now seen corresponding path program 1 times [2025-04-26 18:44:09,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:09,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106874531] [2025-04-26 18:44:09,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:09,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:09,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:09,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:09,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:09,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:09,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:09,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:09,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:09,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:09,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:09,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:09,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:09,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1349459383, now seen corresponding path program 1 times [2025-04-26 18:44:09,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:09,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454855701] [2025-04-26 18:44:09,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:09,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:09,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:44:09,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:44:09,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:09,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:09,353 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:09,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:44:09,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:44:09,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:09,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:09,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:09,376 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:09,376 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:09,376 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:09,376 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:09,376 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:09,376 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,376 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:09,376 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:09,376 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:44:09,376 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:09,376 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:09,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:09,399 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:09,399 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:09,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:09,402 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:09,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:44:09,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:09,405 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:09,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:09,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:09,427 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:09,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:44:09,430 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:09,430 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:09,516 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:09,520 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 18:44:09,521 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:09,521 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:09,521 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:09,521 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:09,521 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:09,521 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,521 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:09,521 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:09,521 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:44:09,521 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:09,521 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:09,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:09,545 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:09,545 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:09,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:09,547 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:09,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:44:09,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:44:09,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:09,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:09,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:09,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:09,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:09,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:09,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:09,570 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:09,574 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:09,574 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:09,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:09,576 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:09,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:44:09,581 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:09,586 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 18:44:09,586 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:09,586 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:09,586 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y1, x1) = -1*y1 + 1*x1 Supporting invariants [] [2025-04-26 18:44:09,595 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 18:44:09,596 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:09,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:09,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:09,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:09,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:09,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:09,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:09,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:09,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:09,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:09,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:09,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:09,634 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:09,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:44:09,648 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:44:09,648 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1183 states and 2855 transitions. cyclomatic complexity: 1885 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 18:44:09,745 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1183 states and 2855 transitions. cyclomatic complexity: 1885. 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 3339 states and 7927 transitions. Complement of second has 7 states. [2025-04-26 18:44:09,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:44:09,746 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 18:44:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-04-26 18:44:09,747 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:44:09,747 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:09,747 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:44:09,747 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:09,747 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:44:09,747 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:09,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3339 states and 7927 transitions. [2025-04-26 18:44:09,785 INFO L131 ngComponentsAnalysis]: Automaton has 220 accepting balls. 598 [2025-04-26 18:44:09,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3339 states to 2578 states and 6110 transitions. [2025-04-26 18:44:09,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1349 [2025-04-26 18:44:09,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1597 [2025-04-26 18:44:09,813 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2578 states and 6110 transitions. [2025-04-26 18:44:09,813 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:09,813 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2578 states and 6110 transitions. [2025-04-26 18:44:09,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states and 6110 transitions. [2025-04-26 18:44:09,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1800. [2025-04-26 18:44:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1800 states have (on average 2.5033333333333334) internal successors, (in total 4506), 1799 states have internal predecessors, (4506), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 4506 transitions. [2025-04-26 18:44:09,863 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1800 states and 4506 transitions. [2025-04-26 18:44:09,863 INFO L438 stractBuchiCegarLoop]: Abstraction has 1800 states and 4506 transitions. [2025-04-26 18:44:09,864 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:44:09,864 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1800 states and 4506 transitions. [2025-04-26 18:44:09,874 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 532 [2025-04-26 18:44:09,874 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:09,874 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:09,876 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:09,876 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:09,877 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[79] $Ultimate##0-->L38-1: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[81] L38-1-->L40: Formula: (< v_y1_1 v_x1_5) InVars {y1=v_y1_1, x1=v_x1_5} OutVars{y1=v_y1_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[83] L40-->L38-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" "[80] L38-1-->thread2FINAL: Formula: (<= v_x1_8 v_y1_2) InVars {y1=v_y1_2, x1=v_x1_8} OutVars{y1=v_y1_2, x1=v_x1_8} AuxVars[] AssignedVars[]" [2025-04-26 18:44:09,877 INFO L754 eck$LassoCheckResult]: Loop: "[75] L27-->L29: 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[]" "[77] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:44:09,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:09,877 INFO L85 PathProgramCache]: Analyzing trace with hash 510812261, now seen corresponding path program 1 times [2025-04-26 18:44:09,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:09,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589149561] [2025-04-26 18:44:09,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:09,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:09,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:44:09,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:44:09,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:09,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 18:44:09,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:44:09,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589149561] [2025-04-26 18:44:09,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589149561] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:44:09,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:44:09,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:44:09,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015070033] [2025-04-26 18:44:09,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:44:09,918 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:44:09,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:09,918 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 2 times [2025-04-26 18:44:09,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:09,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399443655] [2025-04-26 18:44:09,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:44:09,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:09,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:09,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:09,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:44:09,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:09,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:09,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:09,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:09,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:09,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:09,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:09,941 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:09,942 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:09,942 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:09,942 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:09,942 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:09,942 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,942 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:09,942 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:09,942 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:09,942 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:09,942 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:09,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:09,963 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:09,963 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:09,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:09,965 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:09,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:44:09,967 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:09,967 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:09,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:44:09,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:09,991 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:09,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:44:09,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:09,992 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:10,065 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:10,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:10,070 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:10,070 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:10,070 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:10,070 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:10,070 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:10,070 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:10,070 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:10,070 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:10,070 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:10,070 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:10,070 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:10,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:10,098 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:10,098 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:10,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:10,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:10,101 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:10,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:44:10,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:44:10,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:10,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:10,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:10,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:10,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:10,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:10,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:10,124 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:10,130 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:10,130 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:10,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:10,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:10,132 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:10,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:44:10,135 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:10,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:44:10,138 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:10,138 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:10,138 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z1) = -1*x1 + 1*z1 Supporting invariants [] [2025-04-26 18:44:10,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:44:10,146 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:10,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:10,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:44:10,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:44:10,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:10,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:10,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:10,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:10,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:10,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:10,187 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:10,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:10,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:44:10,202 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:44:10,202 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1800 states and 4506 transitions. cyclomatic complexity: 3005 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:10,279 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1800 states and 4506 transitions. cyclomatic complexity: 3005. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2752 states and 6853 transitions. Complement of second has 6 states. [2025-04-26 18:44:10,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:44:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-26 18:44:10,281 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:44:10,281 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:10,281 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:44:10,281 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:10,281 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:44:10,282 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:10,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2752 states and 6853 transitions. [2025-04-26 18:44:10,329 INFO L131 ngComponentsAnalysis]: Automaton has 150 accepting balls. 416 [2025-04-26 18:44:10,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2752 states to 2233 states and 5399 transitions. [2025-04-26 18:44:10,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1128 [2025-04-26 18:44:10,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1345 [2025-04-26 18:44:10,349 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2233 states and 5399 transitions. [2025-04-26 18:44:10,349 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:10,349 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2233 states and 5399 transitions. [2025-04-26 18:44:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states and 5399 transitions. [2025-04-26 18:44:10,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 1768. [2025-04-26 18:44:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1768 states have (on average 2.535633484162896) internal successors, (in total 4483), 1767 states have internal predecessors, (4483), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 4483 transitions. [2025-04-26 18:44:10,385 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1768 states and 4483 transitions. [2025-04-26 18:44:10,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:44:10,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:44:10,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:44:10,388 INFO L87 Difference]: Start difference. First operand 1768 states and 4483 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:44:10,419 INFO L93 Difference]: Finished difference Result 514 states and 1137 transitions. [2025-04-26 18:44:10,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 514 states and 1137 transitions. [2025-04-26 18:44:10,423 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 82 [2025-04-26 18:44:10,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 514 states to 477 states and 1063 transitions. [2025-04-26 18:44:10,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 248 [2025-04-26 18:44:10,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 248 [2025-04-26 18:44:10,427 INFO L74 IsDeterministic]: Start isDeterministic. Operand 477 states and 1063 transitions. [2025-04-26 18:44:10,427 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:10,427 INFO L218 hiAutomatonCegarLoop]: Abstraction has 477 states and 1063 transitions. [2025-04-26 18:44:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states and 1063 transitions. [2025-04-26 18:44:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2025-04-26 18:44:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 477 states have (on average 2.2285115303983227) internal successors, (in total 1063), 476 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1063 transitions. [2025-04-26 18:44:10,435 INFO L240 hiAutomatonCegarLoop]: Abstraction has 477 states and 1063 transitions. [2025-04-26 18:44:10,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:44:10,437 INFO L438 stractBuchiCegarLoop]: Abstraction has 477 states and 1063 transitions. [2025-04-26 18:44:10,438 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:44:10,438 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 477 states and 1063 transitions. [2025-04-26 18:44:10,440 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 82 [2025-04-26 18:44:10,440 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:10,440 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:10,440 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:10,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:10,441 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[102] L15-->L47: 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]" "[74] L27-->L31: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[76] L31-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[79] $Ultimate##0-->L38-1: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[80] L38-1-->thread2FINAL: Formula: (<= v_x1_8 v_y1_2) InVars {y1=v_y1_2, x1=v_x1_8} OutVars{y1=v_y1_2, x1=v_x1_8} AuxVars[] AssignedVars[]" "[78] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[82] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:44:10,441 INFO L754 eck$LassoCheckResult]: Loop: "[85] L47-->L49: 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[]" "[87] L49-->L47: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:44:10,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:10,442 INFO L85 PathProgramCache]: Analyzing trace with hash -730133209, now seen corresponding path program 1 times [2025-04-26 18:44:10,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:10,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857089134] [2025-04-26 18:44:10,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:10,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:10,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:10,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:10,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:10,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:10,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:10,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:10,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:10,459 INFO L85 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2025-04-26 18:44:10,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:10,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813517453] [2025-04-26 18:44:10,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:10,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:10,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:10,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:10,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,466 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:10,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:10,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:10,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:10,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:10,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1578341879, now seen corresponding path program 1 times [2025-04-26 18:44:10,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:10,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864623155] [2025-04-26 18:44:10,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:10,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:10,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:44:10,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:44:10,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,484 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:10,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:44:10,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:44:10,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:10,505 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:10,505 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:10,505 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:10,505 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:10,505 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:10,505 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:10,505 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:10,505 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:10,505 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:10,505 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:10,505 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:10,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:10,522 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:10,522 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:10,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:10,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:10,524 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:10,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:44:10,528 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:10,528 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:10,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:10,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:10,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:10,548 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:10,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:44:10,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:10,550 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:10,617 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:10,622 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 18:44:10,622 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:10,622 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:10,622 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:10,622 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:10,623 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:10,623 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:10,623 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:10,623 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:10,623 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:10,623 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:10,623 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:10,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:10,645 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:10,645 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:10,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:10,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:10,648 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:10,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:44:10,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:44:10,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:10,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:10,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:10,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:10,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:10,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:10,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:10,665 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:10,670 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:10,670 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:10,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:10,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:10,672 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 18:44:10,674 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 18:44:10,675 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:10,679 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 18:44:10,679 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:10,679 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:10,679 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 18:44:10,685 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 18:44:10,686 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:10,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:10,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:10,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:10,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:10,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:10,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:10,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:10,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:10,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:10,723 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:10,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:10,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:44:10,737 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:44:10,738 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 477 states and 1063 transitions. cyclomatic complexity: 670 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:10,792 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 477 states and 1063 transitions. cyclomatic complexity: 670. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 613 states and 1315 transitions. Complement of second has 7 states. [2025-04-26 18:44:10,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:44:10,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:10,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-04-26 18:44:10,794 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:44:10,794 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:10,794 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:44:10,794 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:10,794 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 18:44:10,794 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:10,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 613 states and 1315 transitions. [2025-04-26 18:44:10,798 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 66 [2025-04-26 18:44:10,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 613 states to 541 states and 1178 transitions. [2025-04-26 18:44:10,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 264 [2025-04-26 18:44:10,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 291 [2025-04-26 18:44:10,802 INFO L74 IsDeterministic]: Start isDeterministic. Operand 541 states and 1178 transitions. [2025-04-26 18:44:10,802 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:10,802 INFO L218 hiAutomatonCegarLoop]: Abstraction has 541 states and 1178 transitions. [2025-04-26 18:44:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states and 1178 transitions. [2025-04-26 18:44:10,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 499. [2025-04-26 18:44:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 499 states have (on average 2.2284569138276553) internal successors, (in total 1112), 498 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1112 transitions. [2025-04-26 18:44:10,810 INFO L240 hiAutomatonCegarLoop]: Abstraction has 499 states and 1112 transitions. [2025-04-26 18:44:10,810 INFO L438 stractBuchiCegarLoop]: Abstraction has 499 states and 1112 transitions. [2025-04-26 18:44:10,810 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:44:10,810 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 499 states and 1112 transitions. [2025-04-26 18:44:10,812 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 66 [2025-04-26 18:44:10,812 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:10,812 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:10,813 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:10,813 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:10,813 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[102] L15-->L47: 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]" "[75] L27-->L29: 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[]" "[105] L16-->$Ultimate##0: 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]" "[77] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[84] L47-->L51: 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[]" "[86] L51-->thread3FINAL: Formula: (= v_g_1 (+ v_g_2 1)) InVars {g=v_g_2} OutVars{g=v_g_1} AuxVars[] AssignedVars[g]" "[89] $Ultimate##0-->L58-1: Formula: (< 0 v_g_4) InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" [2025-04-26 18:44:10,813 INFO L754 eck$LassoCheckResult]: Loop: "[91] L58-1-->L60: 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[]" "[93] L60-->L58-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 18:44:10,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:10,813 INFO L85 PathProgramCache]: Analyzing trace with hash -674777432, now seen corresponding path program 1 times [2025-04-26 18:44:10,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:10,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001124309] [2025-04-26 18:44:10,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:10,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:10,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:10,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:10,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:10,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:10,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:10,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:10,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:10,832 INFO L85 PathProgramCache]: Analyzing trace with hash 3875, now seen corresponding path program 1 times [2025-04-26 18:44:10,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:10,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442788480] [2025-04-26 18:44:10,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:10,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:10,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:10,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:10,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:10,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:10,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:10,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:10,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash 78952458, now seen corresponding path program 1 times [2025-04-26 18:44:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:10,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654337758] [2025-04-26 18:44:10,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:10,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:10,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:44:10,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:44:10,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,846 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:10,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:44:10,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:44:10,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:10,871 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:10,872 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:10,872 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:10,872 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:10,872 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:10,872 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:10,872 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:10,872 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:10,872 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:10,872 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:10,872 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:10,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:10,895 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:10,896 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:10,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:10,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:10,898 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 18:44:10,911 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 18:44:10,913 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:10,913 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:10,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:44:10,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:10,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:10,933 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 18:44:10,934 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 18:44:10,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:10,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:11,010 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:11,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:44:11,015 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:11,016 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:11,016 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:11,016 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:11,016 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:11,016 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,016 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:11,016 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:11,016 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:11,016 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:11,016 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:11,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:11,033 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:11,033 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:11,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:11,036 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 18:44:11,038 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 18:44:11,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:44:11,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:11,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:11,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:11,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:11,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:11,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:11,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:11,053 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:11,055 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:11,055 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:11,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:11,059 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:11,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:44:11,061 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:11,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:44:11,065 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:11,065 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:11,065 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y2, x2) = -1*y2 + 1*x2 Supporting invariants [] [2025-04-26 18:44:11,072 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 18:44:11,073 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:11,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:11,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:11,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:11,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:11,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:11,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:11,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:11,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:11,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:11,110 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:11,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:44:11,127 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:44:11,127 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 499 states and 1112 transitions. cyclomatic complexity: 693 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:11,175 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 499 states and 1112 transitions. cyclomatic complexity: 693. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1393 states and 3127 transitions. Complement of second has 7 states. [2025-04-26 18:44:11,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:44:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-04-26 18:44:11,177 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:44:11,177 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:11,177 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:44:11,177 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:11,177 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 18:44:11,177 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:11,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1393 states and 3127 transitions. [2025-04-26 18:44:11,186 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 66 [2025-04-26 18:44:11,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1393 states to 770 states and 1722 transitions. [2025-04-26 18:44:11,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2025-04-26 18:44:11,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 329 [2025-04-26 18:44:11,192 INFO L74 IsDeterministic]: Start isDeterministic. Operand 770 states and 1722 transitions. [2025-04-26 18:44:11,192 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:11,192 INFO L218 hiAutomatonCegarLoop]: Abstraction has 770 states and 1722 transitions. [2025-04-26 18:44:11,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states and 1722 transitions. [2025-04-26 18:44:11,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 671. [2025-04-26 18:44:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 671 states have (on average 2.217585692995529) internal successors, (in total 1488), 670 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:11,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1488 transitions. [2025-04-26 18:44:11,206 INFO L240 hiAutomatonCegarLoop]: Abstraction has 671 states and 1488 transitions. [2025-04-26 18:44:11,206 INFO L438 stractBuchiCegarLoop]: Abstraction has 671 states and 1488 transitions. [2025-04-26 18:44:11,206 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:44:11,207 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 671 states and 1488 transitions. [2025-04-26 18:44:11,209 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 66 [2025-04-26 18:44:11,209 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:11,209 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:11,210 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:11,210 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:11,210 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[102] L15-->L47: 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]" "[75] L27-->L29: 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[]" "[105] L16-->$Ultimate##0: 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]" "[77] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[89] $Ultimate##0-->L58-1: Formula: (< 0 v_g_4) InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[75] L27-->L29: 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[]" "[90] L58-1-->thread4FINAL: Formula: (<= v_x2_8 v_y2_2) InVars {y2=v_y2_2, x2=v_x2_8} OutVars{y2=v_y2_2, x2=v_x2_8} AuxVars[] AssignedVars[]" [2025-04-26 18:44:11,210 INFO L754 eck$LassoCheckResult]: Loop: "[85] L47-->L49: 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[]" "[87] L49-->L47: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:44:11,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:11,211 INFO L85 PathProgramCache]: Analyzing trace with hash -674772967, now seen corresponding path program 1 times [2025-04-26 18:44:11,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:11,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730893358] [2025-04-26 18:44:11,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:11,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:11,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:11,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:11,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:11,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:44:11,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:44:11,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730893358] [2025-04-26 18:44:11,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730893358] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:44:11,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:44:11,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:44:11,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22296335] [2025-04-26 18:44:11,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:44:11,239 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:44:11,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:11,240 INFO L85 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 2 times [2025-04-26 18:44:11,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:11,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513353937] [2025-04-26 18:44:11,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:44:11,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:11,241 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:11,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:11,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:44:11,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:11,242 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:11,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:11,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:11,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:11,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:11,263 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:11,263 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:11,263 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:11,263 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:11,263 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:11,263 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,263 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:11,263 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:11,263 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:44:11,263 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:11,263 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:11,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:11,280 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:11,280 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:11,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:11,282 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:11,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:44:11,285 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:11,285 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:11,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 18:44:11,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:11,306 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:11,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:44:11,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:11,309 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:11,380 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:11,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:11,387 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:11,387 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:11,387 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:11,387 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:11,387 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:11,387 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,387 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:11,387 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:11,387 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:44:11,387 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:11,387 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:11,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:11,409 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:11,409 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:11,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:11,411 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:11,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:44:11,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:44:11,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:11,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:11,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:11,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:11,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:11,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:11,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:11,427 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:11,431 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:11,431 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:11,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:11,433 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:11,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:44:11,437 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:11,440 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:44:11,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:11,441 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:11,441 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:11,441 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 18:44:11,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 18:44:11,448 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:11,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:11,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:11,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:11,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:11,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:11,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:11,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:11,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:11,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:11,491 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:11,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:44:11,505 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:44:11,505 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 671 states and 1488 transitions. cyclomatic complexity: 919 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:11,560 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 671 states and 1488 transitions. cyclomatic complexity: 919. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 929 states and 2038 transitions. Complement of second has 6 states. [2025-04-26 18:44:11,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:44:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-04-26 18:44:11,562 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:44:11,562 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:11,562 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:44:11,562 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:11,562 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 18:44:11,562 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:11,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 929 states and 2038 transitions. [2025-04-26 18:44:11,566 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 42 [2025-04-26 18:44:11,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 929 states to 590 states and 1282 transitions. [2025-04-26 18:44:11,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2025-04-26 18:44:11,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2025-04-26 18:44:11,569 INFO L74 IsDeterministic]: Start isDeterministic. Operand 590 states and 1282 transitions. [2025-04-26 18:44:11,569 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:11,569 INFO L218 hiAutomatonCegarLoop]: Abstraction has 590 states and 1282 transitions. [2025-04-26 18:44:11,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 1282 transitions. [2025-04-26 18:44:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-04-26 18:44:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 590 states have (on average 2.1728813559322036) internal successors, (in total 1282), 589 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1282 transitions. [2025-04-26 18:44:11,578 INFO L240 hiAutomatonCegarLoop]: Abstraction has 590 states and 1282 transitions. [2025-04-26 18:44:11,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:44:11,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:44:11,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:44:11,578 INFO L87 Difference]: Start difference. First operand 590 states and 1282 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:44:11,584 INFO L93 Difference]: Finished difference Result 120 states and 229 transitions. [2025-04-26 18:44:11,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 229 transitions. [2025-04-26 18:44:11,585 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:44:11,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 0 states and 0 transitions. [2025-04-26 18:44:11,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:44:11,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:44:11,585 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:44:11,585 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:44:11,585 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:11,585 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:11,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:44:11,586 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:11,586 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:44:11,586 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:44:11,586 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:44:11,586 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:44:11,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:11,598 INFO L201 PluginConnector]: Adding new model me1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:44:11 BoogieIcfgContainer [2025-04-26 18:44:11,598 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:44:11,598 INFO L158 Benchmark]: Toolchain (without parser) took 4190.28ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 94.9MB in the beginning and 55.8MB in the end (delta: 39.1MB). Peak memory consumption was 25.0MB. Max. memory is 8.0GB. [2025-04-26 18:44:11,599 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:44:11,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.43ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 92.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:44:11,599 INFO L158 Benchmark]: Boogie Preprocessor took 24.61ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 91.9MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:44:11,599 INFO L158 Benchmark]: RCFGBuilder took 224.49ms. Allocated memory is still 167.8MB. Free memory was 91.8MB in the beginning and 82.5MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:44:11,599 INFO L158 Benchmark]: BuchiAutomizer took 3899.49ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 82.3MB in the beginning and 55.8MB in the end (delta: 26.5MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2025-04-26 18:44:11,600 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.43ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 92.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.61ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 91.9MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 224.49ms. Allocated memory is still 167.8MB. Free memory was 91.8MB in the beginning and 82.5MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3899.49ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 82.3MB in the beginning and 55.8MB in the end (delta: 26.5MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 1.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 1909 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 352 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 346 mSDsluCounter, 441 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 198 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 261 IncrementalHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 243 mSDtfsCounter, 261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 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: 48ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 516, Number of transitions in reduction automaton: 1657, Number of states in reduction automaton: 769, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (2 trivial, 6 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 -1 * y1 + x1 and consists of 4 locations. 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 * y2 + x2 and consists of 4 locations. One deterministic module has affine ranking function z2 + -1 * x2 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 18:44:11,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...