/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/m11.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:43:58,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:43:58,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:43:58,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:43:58,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:43:58,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:43:58,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:43:58,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:43:58,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:43:58,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:43:58,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:43:58,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:43:58,383 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:43:58,384 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:43:58,384 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:43:58,384 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:43:58,384 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:43:58,384 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:43:58,384 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:43:58,384 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:43:58,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:43:58,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:43:58,384 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:43:58,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:43:58,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:43:58,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:43:58,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:43:58,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:43:58,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:43:58,384 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:43:58,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:43:58,385 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:43:58,385 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:43:58,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:43:58,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:43:58,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:43:58,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:43:58,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:43:58,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:43:58,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:43:58,385 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:43:58,385 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:43:58,385 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:43:58,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:43:58,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:43:58,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:43:58,611 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:43:58,611 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:43:58,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/m11.c.bpl [2025-04-26 18:43:58,612 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/m11.c.bpl' [2025-04-26 18:43:58,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:43:58,628 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:43:58,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:43:58,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:43:58,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:43:58,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:58" (1/1) ... [2025-04-26 18:43:58,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:58" (1/1) ... [2025-04-26 18:43:58,659 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:43:58,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:43:58,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:43:58,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:43:58,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:43:58,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:58" (1/1) ... [2025-04-26 18:43:58,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:58" (1/1) ... [2025-04-26 18:43:58,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:58" (1/1) ... [2025-04-26 18:43:58,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:58" (1/1) ... [2025-04-26 18:43:58,675 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:58" (1/1) ... [2025-04-26 18:43:58,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:58" (1/1) ... [2025-04-26 18:43:58,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:58" (1/1) ... [2025-04-26 18:43:58,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:58" (1/1) ... [2025-04-26 18:43:58,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:58" (1/1) ... [2025-04-26 18:43:58,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:43:58,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:43:58,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:43:58,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:43:58,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:58" (1/1) ... [2025-04-26 18:43:58,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:43:58,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:58,719 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:43:58,724 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:43:58,743 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:43:58,744 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:43:58,744 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:43:58,744 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:43:58,744 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:43:58,744 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:43:58,744 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:43:58,744 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:43:58,744 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:43:58,744 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:43:58,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:43:58,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:43:58,744 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:43:58,744 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:43:58,744 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:43:58,744 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 18:43:58,744 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 18:43:58,744 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 18:43:58,744 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 18:43:58,745 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 18:43:58,745 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 18:43:58,745 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:43:58,781 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:43:58,782 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:43:58,863 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:43:58,863 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:43:58,875 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:43:58,875 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:43:58,876 INFO L201 PluginConnector]: Adding new model m11.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:43:58 BoogieIcfgContainer [2025-04-26 18:43:58,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:43:58,879 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:43:58,879 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:43:58,887 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:43:58,887 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:43:58,887 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:58" (1/2) ... [2025-04-26 18:43:58,888 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d5947ed and model type m11.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:43:58, skipping insertion in model container [2025-04-26 18:43:58,888 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:43:58,888 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m11.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:43:58" (2/2) ... [2025-04-26 18:43:58,889 INFO L376 chiAutomizerObserver]: Analyzing ICFG m11.c.bpl [2025-04-26 18:43:58,957 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 18:43:58,991 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:43:58,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:43:58,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:58,995 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:43:58,996 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:43:59,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 52 transitions, 146 flow [2025-04-26 18:43:59,071 INFO L116 PetriNetUnfolderBase]: 6/40 cut-off events. [2025-04-26 18:43:59,073 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 18:43:59,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 40 events. 6/40 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2025-04-26 18:43:59,079 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 52 transitions, 146 flow [2025-04-26 18:43:59,083 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 40 transitions, 116 flow [2025-04-26 18:43:59,083 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 53 places, 40 transitions, 116 flow [2025-04-26 18:43:59,084 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 40 transitions, 116 flow [2025-04-26 18:43:59,589 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10154 states, 10153 states have (on average 5.886043533930858) internal successors, (in total 59761), 10153 states have internal predecessors, (59761), 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:43:59,621 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 10154 states, 10153 states have (on average 5.886043533930858) internal successors, (in total 59761), 10153 states have internal predecessors, (59761), 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:43:59,623 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:44:00,600 WARN L140 AmpleReduction]: Number of pruned transitions: 23308 [2025-04-26 18:44:00,601 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:44:00,601 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 4439 [2025-04-26 18:44:00,601 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:41 [2025-04-26 18:44:00,602 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:5281 [2025-04-26 18:44:00,602 WARN L145 AmpleReduction]: Times succ was already a loop node:12263 [2025-04-26 18:44:00,602 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:1819 [2025-04-26 18:44:00,602 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:44:00,630 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 9762 states, 9761 states have (on average 3.5262780452822455) internal successors, (in total 34420), 9761 states have internal predecessors, (34420), 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:00,638 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:44:00,638 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:44:00,638 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:44:00,638 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:44:00,639 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:44:00,639 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:44:00,639 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:44:00,639 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:44:00,660 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9762 states, 9761 states have (on average 3.5262780452822455) internal successors, (in total 34420), 9761 states have internal predecessors, (34420), 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:00,877 INFO L131 ngComponentsAnalysis]: Automaton has 1738 accepting balls. 8898 [2025-04-26 18:44:00,878 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:00,878 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:00,883 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:44:00,883 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:00,883 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:44:00,902 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9762 states, 9761 states have (on average 3.5262780452822455) internal successors, (in total 34420), 9761 states have internal predecessors, (34420), 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:01,070 INFO L131 ngComponentsAnalysis]: Automaton has 1738 accepting balls. 8898 [2025-04-26 18:44:01,071 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:01,071 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:01,072 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:44:01,072 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:01,078 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:44:01,078 INFO L754 eck$LassoCheckResult]: Loop: "[100] L32-->L34: Formula: (< v_x5_1 v_w_1) InVars {x5=v_x5_1, w=v_w_1} OutVars{x5=v_x5_1, w=v_w_1} AuxVars[] AssignedVars[]" "[102] L34-->L32: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" [2025-04-26 18:44:01,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:01,085 INFO L85 PathProgramCache]: Analyzing trace with hash 3878, now seen corresponding path program 1 times [2025-04-26 18:44:01,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:01,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288029795] [2025-04-26 18:44:01,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:01,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:01,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:01,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:01,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:01,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:01,145 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:01,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:01,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:01,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:01,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:01,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:01,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:01,193 INFO L85 PathProgramCache]: Analyzing trace with hash 4163, now seen corresponding path program 1 times [2025-04-26 18:44:01,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:01,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323414299] [2025-04-26 18:44:01,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:01,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:01,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:01,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:01,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:01,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:01,204 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:01,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:01,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:01,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:01,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:01,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:01,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:01,212 INFO L85 PathProgramCache]: Analyzing trace with hash 3729960, now seen corresponding path program 1 times [2025-04-26 18:44:01,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:01,212 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670750697] [2025-04-26 18:44:01,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:01,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:01,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:44:01,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:44:01,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:01,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:01,222 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:01,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:44:01,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:44:01,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:01,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:01,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:01,292 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:01,300 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:01,300 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:01,300 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:01,300 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:01,300 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:01,300 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:01,301 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:01,301 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:44:01,301 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:01,301 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:01,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:01,390 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:01,396 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:01,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:01,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:01,404 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:01,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:01,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:01,418 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:01,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:01,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:01,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:01,444 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:01,446 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:01,448 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:01,449 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:01,518 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:01,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:44:01,523 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:01,523 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:01,523 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:01,523 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:01,523 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:01,524 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:01,524 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:01,524 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:01,524 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:44:01,524 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:01,524 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:01,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:01,551 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:01,554 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:01,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:01,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:01,557 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:01,559 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:01,561 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:01,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:01,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:01,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:01,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:01,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:01,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:01,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:01,580 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:01,585 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:01,585 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:01,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:01,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:01,588 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:01,589 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:01,591 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:01,593 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:44:01,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:44:01,595 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:01,595 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:01,595 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x5) = 1*w - 1*x5 Supporting invariants [] [2025-04-26 18:44:01,601 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:01,604 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:01,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:01,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:01,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:01,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:01,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:01,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:01,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:01,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:01,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:01,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:01,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:01,653 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:01,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:01,672 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:01,686 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:01,703 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 9762 states, 9761 states have (on average 3.5262780452822455) internal successors, (in total 34420), 9761 states have internal predecessors, (34420), 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:02,263 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 9762 states, 9761 states have (on average 3.5262780452822455) internal successors, (in total 34420), 9761 states have internal predecessors, (34420), 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 23777 states and 84350 transitions. Complement of second has 6 states. [2025-04-26 18:44:02,265 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:02,268 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:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-04-26 18:44:02,274 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:44:02,274 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:02,274 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:44:02,274 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:02,274 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:44:02,276 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:02,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23777 states and 84350 transitions. [2025-04-26 18:44:02,658 INFO L131 ngComponentsAnalysis]: Automaton has 1212 accepting balls. 5144 [2025-04-26 18:44:02,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23777 states to 13668 states and 48107 transitions. [2025-04-26 18:44:02,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5921 [2025-04-26 18:44:02,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8848 [2025-04-26 18:44:02,909 INFO L74 IsDeterministic]: Start isDeterministic. Operand 13668 states and 48107 transitions. [2025-04-26 18:44:02,909 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:02,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13668 states and 48107 transitions. [2025-04-26 18:44:02,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13668 states and 48107 transitions. [2025-04-26 18:44:03,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13668 to 11609. [2025-04-26 18:44:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11609 states, 11609 states have (on average 3.56258075630976) internal successors, (in total 41358), 11608 states have internal predecessors, (41358), 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:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11609 states to 11609 states and 41358 transitions. [2025-04-26 18:44:03,394 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11609 states and 41358 transitions. [2025-04-26 18:44:03,394 INFO L438 stractBuchiCegarLoop]: Abstraction has 11609 states and 41358 transitions. [2025-04-26 18:44:03,394 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:44:03,394 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11609 states and 41358 transitions. [2025-04-26 18:44:03,484 INFO L131 ngComponentsAnalysis]: Automaton has 1212 accepting balls. 5144 [2025-04-26 18:44:03,484 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:03,484 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:03,485 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:44:03,485 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:03,486 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L32-->thread1FINAL: Formula: (<= v_w_2 v_x5_4) InVars {x5=v_x5_4, w=v_w_2} OutVars{x5=v_x5_4, w=v_w_2} AuxVars[] AssignedVars[]" "[101] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L15-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:44:03,486 INFO L754 eck$LassoCheckResult]: Loop: "[104] L41-->L43: Formula: (< v_x4_1 v_w_3) InVars {x4=v_x4_1, w=v_w_3} OutVars{x4=v_x4_1, w=v_w_3} AuxVars[] AssignedVars[]" "[106] L43-->L41: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 18:44:03,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,487 INFO L85 PathProgramCache]: Analyzing trace with hash 115627898, now seen corresponding path program 1 times [2025-04-26 18:44:03,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:03,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467678977] [2025-04-26 18:44:03,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:03,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:03,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:44:03,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:44:03,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,492 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:03,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:44:03,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:44:03,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:03,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,496 INFO L85 PathProgramCache]: Analyzing trace with hash 4291, now seen corresponding path program 1 times [2025-04-26 18:44:03,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:03,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935484945] [2025-04-26 18:44:03,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:03,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:03,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:03,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:03,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,499 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:03,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:03,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:03,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:03,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,504 INFO L85 PathProgramCache]: Analyzing trace with hash -550736388, now seen corresponding path program 1 times [2025-04-26 18:44:03,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:03,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83503375] [2025-04-26 18:44:03,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:03,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:03,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:44:03,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:44:03,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,514 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:03,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:44:03,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:44:03,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:03,538 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:03,538 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:03,538 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:03,538 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:03,538 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:03,538 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,538 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:03,538 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:03,538 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:44:03,538 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:03,538 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:03,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:03,672 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:03,673 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:03,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,675 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:03,676 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:03,678 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:03,678 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:03,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:44:03,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,699 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:03,700 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:03,701 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:03,701 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:03,771 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:03,777 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:03,777 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:03,777 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:03,777 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:03,777 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:03,777 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:03,777 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,777 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:03,777 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:03,777 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:44:03,777 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:03,777 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:03,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:03,801 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:03,801 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:03,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,803 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:03,806 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:03,807 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:03,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:03,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:03,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:03,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:03,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:03,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:03,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:03,822 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:03,825 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:03,825 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:03,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,827 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:03,829 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:03,830 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:03,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:44:03,834 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:03,834 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:03,834 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x4) = 1*w - 1*x4 Supporting invariants [] [2025-04-26 18:44:03,840 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:03,841 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:03,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:44:03,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:44:03,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:03,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:03,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:03,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:03,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:03,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:03,877 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:03,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:03,892 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:03,892 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:03,892 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11609 states and 41358 transitions. cyclomatic complexity: 31439 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:04,326 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11609 states and 41358 transitions. cyclomatic complexity: 31439. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 30696 states and 109668 transitions. Complement of second has 6 states. [2025-04-26 18:44:04,327 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:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-04-26 18:44:04,328 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:44:04,328 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,328 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:44:04,328 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,328 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:44:04,328 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30696 states and 109668 transitions. [2025-04-26 18:44:04,749 INFO L131 ngComponentsAnalysis]: Automaton has 736 accepting balls. 2532 [2025-04-26 18:44:04,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30696 states to 18983 states and 66463 transitions. [2025-04-26 18:44:04,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6536 [2025-04-26 18:44:04,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8898 [2025-04-26 18:44:04,970 INFO L74 IsDeterministic]: Start isDeterministic. Operand 18983 states and 66463 transitions. [2025-04-26 18:44:04,970 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:04,970 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18983 states and 66463 transitions. [2025-04-26 18:44:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18983 states and 66463 transitions. [2025-04-26 18:44:05,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18983 to 16658. [2025-04-26 18:44:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16658 states, 16658 states have (on average 3.555168687717613) internal successors, (in total 59222), 16657 states have internal predecessors, (59222), 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:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16658 states to 16658 states and 59222 transitions. [2025-04-26 18:44:05,719 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16658 states and 59222 transitions. [2025-04-26 18:44:05,719 INFO L438 stractBuchiCegarLoop]: Abstraction has 16658 states and 59222 transitions. [2025-04-26 18:44:05,719 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:44:05,719 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16658 states and 59222 transitions. [2025-04-26 18:44:05,845 INFO L131 ngComponentsAnalysis]: Automaton has 736 accepting balls. 2532 [2025-04-26 18:44:05,845 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:05,845 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:05,846 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:05,846 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:05,847 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L32-->thread1FINAL: Formula: (<= v_w_2 v_x5_4) InVars {x5=v_x5_4, w=v_w_2} OutVars{x5=v_x5_4, w=v_w_2} AuxVars[] AssignedVars[]" "[101] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L15-1-->L41: 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]" "[103] L41-->thread2FINAL: Formula: (<= v_w_4 v_x4_4) InVars {x4=v_x4_4, w=v_w_4} OutVars{x4=v_x4_4, w=v_w_4} AuxVars[] AssignedVars[]" "[105] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[133] L16-->L50: 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]" [2025-04-26 18:44:05,847 INFO L754 eck$LassoCheckResult]: Loop: "[108] L50-->L52: Formula: (< v_x2_1 v_w_5) InVars {x2=v_x2_1, w=v_w_5} OutVars{x2=v_x2_1, w=v_w_5} AuxVars[] AssignedVars[]" "[110] L52-->L50: 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:05,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:05,847 INFO L85 PathProgramCache]: Analyzing trace with hash 107040297, now seen corresponding path program 1 times [2025-04-26 18:44:05,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:05,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035391787] [2025-04-26 18:44:05,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:05,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:05,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:44:05,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:44:05,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:05,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:05,852 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:05,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:44:05,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:44:05,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:05,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:05,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:05,857 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:05,857 INFO L85 PathProgramCache]: Analyzing trace with hash 4419, now seen corresponding path program 1 times [2025-04-26 18:44:05,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:05,857 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162493495] [2025-04-26 18:44:05,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:05,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:05,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:05,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:05,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:05,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:05,860 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:05,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:05,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:05,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:05,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:05,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:05,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:05,868 INFO L85 PathProgramCache]: Analyzing trace with hash -213486229, now seen corresponding path program 1 times [2025-04-26 18:44:05,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:05,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188350726] [2025-04-26 18:44:05,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:05,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:05,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:05,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:05,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:05,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:05,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:05,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:05,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:05,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:05,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:05,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:05,903 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:05,903 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:05,903 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:05,903 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:05,903 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:05,903 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:05,903 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:05,903 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:05,903 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:05,903 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:05,903 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:05,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:05,921 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:05,921 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:05,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:05,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:05,923 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:05,925 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:05,926 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:05,926 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:05,944 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:05,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:05,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:05,946 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:05,947 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:05,949 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:05,949 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:06,018 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:06,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:44:06,023 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:06,023 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:06,023 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:06,023 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:06,023 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:06,023 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:06,023 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:06,023 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:06,023 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:06,023 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:06,023 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:06,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:06,041 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:06,041 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:06,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:06,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:06,043 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:06,045 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:06,046 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:06,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:06,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:06,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:06,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:06,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:06,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:06,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:06,060 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:06,063 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:06,063 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:06,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:06,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:06,065 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:06,067 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:06,068 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:06,071 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:06,072 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:06,072 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:06,072 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x2) = 1*w - 1*x2 Supporting invariants [] [2025-04-26 18:44:06,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:06,079 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:06,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:06,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:44:06,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:44:06,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:06,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:06,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:06,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:06,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:06,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:06,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:06,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:06,120 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:06,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:06,135 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:06,136 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:06,136 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16658 states and 59222 transitions. cyclomatic complexity: 44309 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:06,733 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16658 states and 59222 transitions. cyclomatic complexity: 44309. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 44802 states and 158530 transitions. Complement of second has 6 states. [2025-04-26 18:44:06,734 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:06,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:06,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-04-26 18:44:06,734 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:44:06,735 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:06,735 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:44:06,735 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:06,735 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:44:06,735 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:06,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44802 states and 158530 transitions. [2025-04-26 18:44:07,362 INFO L131 ngComponentsAnalysis]: Automaton has 378 accepting balls. 1044 [2025-04-26 18:44:07,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44802 states to 26589 states and 92284 transitions. [2025-04-26 18:44:07,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7512 [2025-04-26 18:44:07,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8871 [2025-04-26 18:44:07,770 INFO L74 IsDeterministic]: Start isDeterministic. Operand 26589 states and 92284 transitions. [2025-04-26 18:44:07,770 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:07,770 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26589 states and 92284 transitions. [2025-04-26 18:44:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26589 states and 92284 transitions. [2025-04-26 18:44:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26589 to 24896. [2025-04-26 18:44:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24896 states, 24896 states have (on average 3.4373393316195373) internal successors, (in total 85576), 24895 states have internal predecessors, (85576), 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,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24896 states to 24896 states and 85576 transitions. [2025-04-26 18:44:08,595 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24896 states and 85576 transitions. [2025-04-26 18:44:08,595 INFO L438 stractBuchiCegarLoop]: Abstraction has 24896 states and 85576 transitions. [2025-04-26 18:44:08,595 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:44:08,595 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24896 states and 85576 transitions. [2025-04-26 18:44:08,868 INFO L131 ngComponentsAnalysis]: Automaton has 378 accepting balls. 1044 [2025-04-26 18:44:08,868 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:08,868 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:08,869 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:08,869 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:08,870 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L32-->L34: Formula: (< v_x5_1 v_w_1) InVars {x5=v_x5_1, w=v_w_1} OutVars{x5=v_x5_1, w=v_w_1} AuxVars[] AssignedVars[]" "[130] L15-1-->L41: 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] L34-->L32: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" "[133] L16-->L50: 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]" "[99] L32-->thread1FINAL: Formula: (<= v_w_2 v_x5_4) InVars {x5=v_x5_4, w=v_w_2} OutVars{x5=v_x5_4, w=v_w_2} AuxVars[] AssignedVars[]" "[136] L17-->L59: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[103] L41-->thread2FINAL: Formula: (<= v_w_4 v_x4_4) InVars {x4=v_x4_4, w=v_w_4} OutVars{x4=v_x4_4, w=v_w_4} AuxVars[] AssignedVars[]" "[107] L50-->thread3FINAL: Formula: (<= v_w_6 v_x2_4) InVars {x2=v_x2_4, w=v_w_6} OutVars{x2=v_x2_4, w=v_w_6} AuxVars[] AssignedVars[]" [2025-04-26 18:44:08,870 INFO L754 eck$LassoCheckResult]: Loop: "[112] L59-->L61: Formula: (< v_x3_1 v_w_7) InVars {w=v_w_7, x3=v_x3_1} OutVars{w=v_w_7, x3=v_x3_1} AuxVars[] AssignedVars[]" "[114] L61-->L59: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 18:44:08,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:08,870 INFO L85 PathProgramCache]: Analyzing trace with hash 723040460, now seen corresponding path program 1 times [2025-04-26 18:44:08,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:08,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753954877] [2025-04-26 18:44:08,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:08,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:08,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:08,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:08,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,881 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:08,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:08,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:08,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:08,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:08,898 INFO L85 PathProgramCache]: Analyzing trace with hash 4547, now seen corresponding path program 1 times [2025-04-26 18:44:08,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:08,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831555351] [2025-04-26 18:44:08,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:08,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:08,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:08,921 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,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:08,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:08,922 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,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:08,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:08,929 INFO L85 PathProgramCache]: Analyzing trace with hash -942816306, now seen corresponding path program 1 times [2025-04-26 18:44:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:08,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466272490] [2025-04-26 18:44:08,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:08,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:08,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:44:08,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:44:08,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,944 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:08,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:44:08,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:44:08,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:08,993 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:08,993 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:08,993 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:08,993 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:08,993 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:08,993 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:08,993 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:08,993 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:08,993 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:08,993 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:08,993 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:08,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:09,036 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:09,036 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:09,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:09,041 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:09,042 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:09,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:09,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:09,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:44:09,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:09,088 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:09,091 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:09,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:09,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:09,200 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:09,207 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:09,208 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:09,208 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:09,208 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:09,208 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:09,208 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:09,208 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,208 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:09,208 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:09,208 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:09,208 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:09,208 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:09,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:09,225 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:09,225 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:09,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:09,227 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:09,229 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:09,230 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,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:09,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:09,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:09,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:09,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:09,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:09,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:09,243 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:09,248 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:09,248 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:09,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:09,250 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:09,252 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:09,253 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:09,256 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:09,256 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:09,257 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:09,257 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x3) = 1*w - 1*x3 Supporting invariants [] [2025-04-26 18:44:09,262 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:09,263 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:09,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:09,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:09,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:09,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:09,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:09,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:09,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:09,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:09,305 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,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:09,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:09,306 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:09,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:09,322 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,323 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,323 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24896 states and 85576 transitions. cyclomatic complexity: 62685 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:09,823 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24896 states and 85576 transitions. cyclomatic complexity: 62685. 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 45677 states and 153082 transitions. Complement of second has 6 states. [2025-04-26 18:44:09,823 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,824 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:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2025-04-26 18:44:09,824 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:44:09,824 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:09,824 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:44:09,824 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:09,824 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 18:44:09,824 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:09,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45677 states and 153082 transitions. [2025-04-26 18:44:10,470 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 258 [2025-04-26 18:44:10,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45677 states to 32669 states and 107967 transitions. [2025-04-26 18:44:10,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9225 [2025-04-26 18:44:10,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10280 [2025-04-26 18:44:10,843 INFO L74 IsDeterministic]: Start isDeterministic. Operand 32669 states and 107967 transitions. [2025-04-26 18:44:10,843 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:10,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32669 states and 107967 transitions. [2025-04-26 18:44:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32669 states and 107967 transitions. [2025-04-26 18:44:11,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32669 to 30592. [2025-04-26 18:44:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30592 states, 30592 states have (on average 3.366795240585774) internal successors, (in total 102997), 30591 states have internal predecessors, (102997), 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,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30592 states to 30592 states and 102997 transitions. [2025-04-26 18:44:11,824 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30592 states and 102997 transitions. [2025-04-26 18:44:11,824 INFO L438 stractBuchiCegarLoop]: Abstraction has 30592 states and 102997 transitions. [2025-04-26 18:44:11,824 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:44:11,824 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30592 states and 102997 transitions. [2025-04-26 18:44:12,027 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 258 [2025-04-26 18:44:12,027 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:12,027 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:12,028 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:12,028 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:12,028 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L32-->thread1FINAL: Formula: (<= v_w_2 v_x5_4) InVars {x5=v_x5_4, w=v_w_2} OutVars{x5=v_x5_4, w=v_w_2} AuxVars[] AssignedVars[]" "[101] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L15-1-->L41: 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]" "[103] L41-->thread2FINAL: Formula: (<= v_w_4 v_x4_4) InVars {x4=v_x4_4, w=v_w_4} OutVars{x4=v_x4_4, w=v_w_4} AuxVars[] AssignedVars[]" "[105] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[133] L16-->L50: 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]" "[107] L50-->thread3FINAL: Formula: (<= v_w_6 v_x2_4) InVars {x2=v_x2_4, w=v_w_6} OutVars{x2=v_x2_4, w=v_w_6} AuxVars[] AssignedVars[]" "[109] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[136] L17-->L59: 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]" "[111] L59-->thread4FINAL: Formula: (<= v_w_8 v_x3_4) InVars {w=v_w_8, x3=v_x3_4} OutVars{w=v_w_8, x3=v_x3_4} AuxVars[] AssignedVars[]" "[113] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[139] L18-->L68: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" [2025-04-26 18:44:12,028 INFO L754 eck$LassoCheckResult]: Loop: "[116] L68-->L70: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[118] L70-->L68: 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:12,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:12,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1432639788, now seen corresponding path program 1 times [2025-04-26 18:44:12,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:12,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906630676] [2025-04-26 18:44:12,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:12,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:12,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:44:12,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:44:12,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:12,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:12,041 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:12,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:44:12,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:44:12,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:12,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:12,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:12,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:12,050 INFO L85 PathProgramCache]: Analyzing trace with hash 4675, now seen corresponding path program 1 times [2025-04-26 18:44:12,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:12,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706398021] [2025-04-26 18:44:12,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:12,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:12,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:12,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:12,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:12,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:12,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:12,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:12,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:12,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:12,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:12,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:12,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:12,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1917662034, now seen corresponding path program 1 times [2025-04-26 18:44:12,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:12,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266952919] [2025-04-26 18:44:12,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:12,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:12,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:44:12,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:44:12,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:12,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:12,069 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:12,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:44:12,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:44:12,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:12,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:12,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:12,092 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:12,092 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:12,092 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:12,092 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:12,093 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:12,093 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:12,093 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:12,093 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:12,093 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:12,093 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:12,093 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:12,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:12,114 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:12,114 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:12,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:12,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:12,116 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:12,118 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:12,119 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:12,119 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:12,138 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:12,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:12,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:12,140 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:12,141 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:12,143 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:12,143 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:12,212 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:12,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:12,218 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:12,218 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:12,218 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:12,218 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:12,218 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:12,218 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:12,218 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:12,218 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:12,218 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:12,218 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:12,218 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:12,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:12,244 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:12,244 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:12,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:12,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:12,246 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:12,250 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:12,251 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:12,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:12,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:12,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:12,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:12,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:12,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:12,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:12,268 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:12,272 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:12,272 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:12,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:12,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:12,274 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:12,276 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:12,277 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:12,280 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:44:12,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:12,281 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:12,281 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:12,281 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:44:12,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:44:12,288 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:12,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:12,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:44:12,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:44:12,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:12,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:12,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:12,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:12,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:12,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:12,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:12,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:12,329 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:12,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:12,345 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:12,346 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:12,346 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30592 states and 102997 transitions. cyclomatic complexity: 74760 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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:13,431 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30592 states and 102997 transitions. cyclomatic complexity: 74760. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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 97137 states and 321849 transitions. Complement of second has 7 states. [2025-04-26 18:44:13,431 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:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-04-26 18:44:13,432 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:44:13,432 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:13,432 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 18:44:13,432 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:13,433 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 18:44:13,433 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:13,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97137 states and 321849 transitions. [2025-04-26 18:44:14,846 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 254 [2025-04-26 18:44:15,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97137 states to 62266 states and 207942 transitions. [2025-04-26 18:44:15,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16006 [2025-04-26 18:44:15,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16166 [2025-04-26 18:44:15,493 INFO L74 IsDeterministic]: Start isDeterministic. Operand 62266 states and 207942 transitions. [2025-04-26 18:44:15,493 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:15,493 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62266 states and 207942 transitions. [2025-04-26 18:44:15,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62266 states and 207942 transitions. [2025-04-26 18:44:16,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62266 to 52567. [2025-04-26 18:44:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52567 states, 52567 states have (on average 3.276561340765119) internal successors, (in total 172239), 52566 states have internal predecessors, (172239), 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:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52567 states to 52567 states and 172239 transitions. [2025-04-26 18:44:17,160 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52567 states and 172239 transitions. [2025-04-26 18:44:17,160 INFO L438 stractBuchiCegarLoop]: Abstraction has 52567 states and 172239 transitions. [2025-04-26 18:44:17,160 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:44:17,160 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52567 states and 172239 transitions. [2025-04-26 18:44:17,795 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 254 [2025-04-26 18:44:17,795 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:17,795 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:17,796 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:17,796 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:17,797 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L32-->L34: Formula: (< v_x5_1 v_w_1) InVars {x5=v_x5_1, w=v_w_1} OutVars{x5=v_x5_1, w=v_w_1} AuxVars[] AssignedVars[]" "[130] L15-1-->L41: 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] L34-->L32: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" "[133] L16-->L50: 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]" "[100] L32-->L34: Formula: (< v_x5_1 v_w_1) InVars {x5=v_x5_1, w=v_w_1} OutVars{x5=v_x5_1, w=v_w_1} AuxVars[] AssignedVars[]" "[136] L17-->L59: 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]" "[102] L34-->L32: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" "[139] L18-->L68: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[99] L32-->thread1FINAL: Formula: (<= v_w_2 v_x5_4) InVars {x5=v_x5_4, w=v_w_2} OutVars{x5=v_x5_4, w=v_w_2} AuxVars[] AssignedVars[]" "[115] L68-->L72: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[103] L41-->thread2FINAL: Formula: (<= v_w_4 v_x4_4) InVars {x4=v_x4_4, w=v_w_4} OutVars{x4=v_x4_4, w=v_w_4} AuxVars[] AssignedVars[]" "[117] L72-->thread5FINAL: Formula: (= v_f_2 (+ v_f_3 1)) InVars {f=v_f_3} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[107] L50-->thread3FINAL: Formula: (<= v_w_6 v_x2_4) InVars {x2=v_x2_4, w=v_w_6} OutVars{x2=v_x2_4, w=v_w_6} AuxVars[] AssignedVars[]" "[142] L19-->$Ultimate##0: Formula: (and (= v_thread6Thread1of1ForFork5_thidvar3_2 6) (= v_thread6Thread1of1ForFork5_thidvar5_2 6) (= v_thread6Thread1of1ForFork5_thidvar4_2 6) (= v_thread6Thread1of1ForFork5_thidvar2_2 6) (= v_thread6Thread1of1ForFork5_thidvar0_2 6) (= v_thread6Thread1of1ForFork5_thidvar1_2 6)) InVars {} OutVars{thread6Thread1of1ForFork5_thidvar0=v_thread6Thread1of1ForFork5_thidvar0_2, thread6Thread1of1ForFork5_thidvar1=v_thread6Thread1of1ForFork5_thidvar1_2, thread6Thread1of1ForFork5_thidvar2=v_thread6Thread1of1ForFork5_thidvar2_2, thread6Thread1of1ForFork5_thidvar3=v_thread6Thread1of1ForFork5_thidvar3_2, thread6Thread1of1ForFork5_thidvar4=v_thread6Thread1of1ForFork5_thidvar4_2, thread6Thread1of1ForFork5_thidvar5=v_thread6Thread1of1ForFork5_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_thidvar0, thread6Thread1of1ForFork5_thidvar1, thread6Thread1of1ForFork5_thidvar2, thread6Thread1of1ForFork5_thidvar3, thread6Thread1of1ForFork5_thidvar4, thread6Thread1of1ForFork5_thidvar5]" "[120] $Ultimate##0-->L79-1: Formula: (< 0 v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" "[111] L59-->thread4FINAL: Formula: (<= v_w_8 v_x3_4) InVars {w=v_w_8, x3=v_x3_4} OutVars{w=v_w_8, x3=v_x3_4} AuxVars[] AssignedVars[]" [2025-04-26 18:44:17,797 INFO L754 eck$LassoCheckResult]: Loop: "[122] L79-1-->L81: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[124] L81-->L79-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:17,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:17,797 INFO L85 PathProgramCache]: Analyzing trace with hash 726067012, now seen corresponding path program 1 times [2025-04-26 18:44:17,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:17,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317779254] [2025-04-26 18:44:17,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:17,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:17,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:44:17,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:44:17,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:17,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:17,808 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:17,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:44:17,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:44:17,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:17,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:17,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:17,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:17,814 INFO L85 PathProgramCache]: Analyzing trace with hash 4867, now seen corresponding path program 1 times [2025-04-26 18:44:17,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:17,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683561183] [2025-04-26 18:44:17,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:17,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:17,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:17,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:17,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:17,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:17,817 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:17,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:17,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:17,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:17,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:17,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:17,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:17,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1965700486, now seen corresponding path program 1 times [2025-04-26 18:44:17,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:17,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939737814] [2025-04-26 18:44:17,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:17,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:17,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:44:17,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:44:17,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:17,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:17,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:17,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:44:17,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:44:17,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:17,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:17,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:17,856 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:17,856 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:17,856 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:17,856 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:17,856 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:17,856 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:17,856 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:17,856 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:17,856 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:44:17,856 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:17,856 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:17,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:17,873 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:17,873 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:17,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:17,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:17,875 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:17,877 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:17,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:17,878 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:17,894 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:17,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:17,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:17,896 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:17,897 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:17,898 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:17,898 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:17,971 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:17,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:44:17,975 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:17,975 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:17,975 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:17,975 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:17,975 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:17,975 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:17,975 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:17,975 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:17,975 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:44:17,975 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:17,975 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:17,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:17,993 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:17,993 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:17,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:17,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:17,995 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:17,997 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:17,998 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:18,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:18,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:18,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:18,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:18,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:18,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:18,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:18,011 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:18,014 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:18,014 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:18,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:18,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:18,016 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:18,017 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:18,018 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:18,021 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:18,021 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:18,021 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:18,021 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, x1) = -1*y + 1*x1 Supporting invariants [] [2025-04-26 18:44:18,026 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:18,026 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:18,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:18,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:44:18,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:44:18,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:18,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:18,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:18,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:18,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:18,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:18,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:18,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:18,084 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:18,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:18,095 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:18,096 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:18,096 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52567 states and 172239 transitions. cyclomatic complexity: 124147 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 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:19,156 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52567 states and 172239 transitions. cyclomatic complexity: 124147. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 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 111850 states and 347822 transitions. Complement of second has 7 states. [2025-04-26 18:44:19,156 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:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 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:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-04-26 18:44:19,157 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 112 transitions. Stem has 18 letters. Loop has 2 letters. [2025-04-26 18:44:19,157 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:19,157 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 112 transitions. Stem has 20 letters. Loop has 2 letters. [2025-04-26 18:44:19,157 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:19,157 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 112 transitions. Stem has 18 letters. Loop has 4 letters. [2025-04-26 18:44:19,157 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:19,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111850 states and 347822 transitions. [2025-04-26 18:44:20,854 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 254 [2025-04-26 18:44:21,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111850 states to 69978 states and 214825 transitions. [2025-04-26 18:44:21,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17271 [2025-04-26 18:44:21,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17543 [2025-04-26 18:44:21,469 INFO L74 IsDeterministic]: Start isDeterministic. Operand 69978 states and 214825 transitions. [2025-04-26 18:44:21,469 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:21,469 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69978 states and 214825 transitions. [2025-04-26 18:44:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69978 states and 214825 transitions. [2025-04-26 18:44:22,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69978 to 55072. [2025-04-26 18:44:22,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55072 states, 55072 states have (on average 3.1578115920976177) internal successors, (in total 173907), 55071 states have internal predecessors, (173907), 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:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55072 states to 55072 states and 173907 transitions. [2025-04-26 18:44:22,690 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55072 states and 173907 transitions. [2025-04-26 18:44:22,690 INFO L438 stractBuchiCegarLoop]: Abstraction has 55072 states and 173907 transitions. [2025-04-26 18:44:22,690 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:44:22,691 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55072 states and 173907 transitions. [2025-04-26 18:44:23,230 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 254 [2025-04-26 18:44:23,230 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:23,230 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:23,231 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:23,231 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:23,232 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L32-->thread1FINAL: Formula: (<= v_w_2 v_x5_4) InVars {x5=v_x5_4, w=v_w_2} OutVars{x5=v_x5_4, w=v_w_2} AuxVars[] AssignedVars[]" "[101] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L15-1-->L41: 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]" "[103] L41-->thread2FINAL: Formula: (<= v_w_4 v_x4_4) InVars {x4=v_x4_4, w=v_w_4} OutVars{x4=v_x4_4, w=v_w_4} AuxVars[] AssignedVars[]" "[105] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[133] L16-->L50: 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]" "[107] L50-->thread3FINAL: Formula: (<= v_w_6 v_x2_4) InVars {x2=v_x2_4, w=v_w_6} OutVars{x2=v_x2_4, w=v_w_6} AuxVars[] AssignedVars[]" "[109] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[136] L17-->L59: 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]" "[111] L59-->thread4FINAL: Formula: (<= v_w_8 v_x3_4) InVars {w=v_w_8, x3=v_x3_4} OutVars{w=v_w_8, x3=v_x3_4} AuxVars[] AssignedVars[]" "[113] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[139] L18-->L68: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[116] L68-->L70: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[118] L70-->L68: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[115] L68-->L72: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[117] L72-->thread5FINAL: Formula: (= v_f_2 (+ v_f_3 1)) InVars {f=v_f_3} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[119] thread5FINAL-->thread5EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[142] L19-->$Ultimate##0: Formula: (and (= v_thread6Thread1of1ForFork5_thidvar3_2 6) (= v_thread6Thread1of1ForFork5_thidvar5_2 6) (= v_thread6Thread1of1ForFork5_thidvar4_2 6) (= v_thread6Thread1of1ForFork5_thidvar2_2 6) (= v_thread6Thread1of1ForFork5_thidvar0_2 6) (= v_thread6Thread1of1ForFork5_thidvar1_2 6)) InVars {} OutVars{thread6Thread1of1ForFork5_thidvar0=v_thread6Thread1of1ForFork5_thidvar0_2, thread6Thread1of1ForFork5_thidvar1=v_thread6Thread1of1ForFork5_thidvar1_2, thread6Thread1of1ForFork5_thidvar2=v_thread6Thread1of1ForFork5_thidvar2_2, thread6Thread1of1ForFork5_thidvar3=v_thread6Thread1of1ForFork5_thidvar3_2, thread6Thread1of1ForFork5_thidvar4=v_thread6Thread1of1ForFork5_thidvar4_2, thread6Thread1of1ForFork5_thidvar5=v_thread6Thread1of1ForFork5_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_thidvar0, thread6Thread1of1ForFork5_thidvar1, thread6Thread1of1ForFork5_thidvar2, thread6Thread1of1ForFork5_thidvar3, thread6Thread1of1ForFork5_thidvar4, thread6Thread1of1ForFork5_thidvar5]" "[120] $Ultimate##0-->L79-1: Formula: (< 0 v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" [2025-04-26 18:44:23,232 INFO L754 eck$LassoCheckResult]: Loop: "[122] L79-1-->L81: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[124] L81-->L79-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:23,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:23,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2107866833, now seen corresponding path program 1 times [2025-04-26 18:44:23,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:23,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749032885] [2025-04-26 18:44:23,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:23,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:23,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:44:23,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:44:23,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:23,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:23,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:23,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:44:23,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:44:23,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:23,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:23,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:23,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:23,248 INFO L85 PathProgramCache]: Analyzing trace with hash 4867, now seen corresponding path program 2 times [2025-04-26 18:44:23,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:23,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825081906] [2025-04-26 18:44:23,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:44:23,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:23,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:23,253 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:23,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:44:23,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:23,253 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:23,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:23,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:23,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:23,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:23,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:23,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:23,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1564533293, now seen corresponding path program 1 times [2025-04-26 18:44:23,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:23,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506852769] [2025-04-26 18:44:23,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:23,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:23,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:44:23,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:44:23,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:23,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:23,263 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:23,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:44:23,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:44:23,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:23,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:23,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:23,282 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:23,282 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:23,282 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:23,282 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:23,282 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:23,282 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:23,282 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:23,282 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:23,282 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration7_Loop [2025-04-26 18:44:23,282 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:23,282 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:23,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:23,298 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:23,298 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:23,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:23,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:23,300 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:23,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 18:44:23,303 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:23,303 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:23,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 18:44:23,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:23,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:23,320 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:23,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 18:44:23,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:23,321 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:23,386 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:23,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 18:44:23,390 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:23,390 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:23,390 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:23,390 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:23,390 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:23,390 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:23,391 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:23,391 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:23,391 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration7_Loop [2025-04-26 18:44:23,391 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:23,391 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:23,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:23,404 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:23,404 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:23,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:23,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:23,406 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:23,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 18:44:23,408 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:23,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:23,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:23,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:23,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:23,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:23,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:23,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:23,421 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:23,424 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:23,424 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:23,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:23,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:23,426 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:23,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 18:44:23,428 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:23,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 18:44:23,430 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:23,430 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:23,431 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, y) = 1*x1 - 1*y Supporting invariants [] [2025-04-26 18:44:23,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 18:44:23,435 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:23,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:23,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:44:23,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:44:23,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:23,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:23,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:23,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:23,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:23,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:23,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:23,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:23,482 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:23,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:23,491 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:23,491 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:23,492 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55072 states and 173907 transitions. cyclomatic complexity: 124182 Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (in total 23), 3 states have internal predecessors, (23), 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:24,861 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55072 states and 173907 transitions. cyclomatic complexity: 124182. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (in total 23), 3 states have internal predecessors, (23), 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 146558 states and 456745 transitions. Complement of second has 7 states. [2025-04-26 18:44:24,862 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:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (in total 23), 3 states have internal predecessors, (23), 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:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-04-26 18:44:24,862 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 21 letters. Loop has 2 letters. [2025-04-26 18:44:24,862 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:24,862 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 23 letters. Loop has 2 letters. [2025-04-26 18:44:24,863 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:24,863 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 21 letters. Loop has 4 letters. [2025-04-26 18:44:24,863 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:24,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146558 states and 456745 transitions. [2025-04-26 18:44:26,708 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 254 [2025-04-26 18:44:27,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146558 states to 105293 states and 325299 transitions. [2025-04-26 18:44:27,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24344 [2025-04-26 18:44:27,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24744 [2025-04-26 18:44:27,759 INFO L74 IsDeterministic]: Start isDeterministic. Operand 105293 states and 325299 transitions. [2025-04-26 18:44:27,759 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:27,759 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105293 states and 325299 transitions. [2025-04-26 18:44:27,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105293 states and 325299 transitions. [2025-04-26 18:44:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105293 to 62424. [2025-04-26 18:44:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62424 states, 62424 states have (on average 3.186723055235166) internal successors, (in total 198928), 62423 states have internal predecessors, (198928), 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:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62424 states to 62424 states and 198928 transitions. [2025-04-26 18:44:29,437 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62424 states and 198928 transitions. [2025-04-26 18:44:29,437 INFO L438 stractBuchiCegarLoop]: Abstraction has 62424 states and 198928 transitions. [2025-04-26 18:44:29,437 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:44:29,437 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62424 states and 198928 transitions. [2025-04-26 18:44:30,037 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 254 [2025-04-26 18:44:30,037 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:30,037 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:30,038 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:30,038 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:30,039 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L32-->L34: Formula: (< v_x5_1 v_w_1) InVars {x5=v_x5_1, w=v_w_1} OutVars{x5=v_x5_1, w=v_w_1} AuxVars[] AssignedVars[]" "[130] L15-1-->L41: 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] L34-->L32: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" "[133] L16-->L50: 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]" "[99] L32-->thread1FINAL: Formula: (<= v_w_2 v_x5_4) InVars {x5=v_x5_4, w=v_w_2} OutVars{x5=v_x5_4, w=v_w_2} AuxVars[] AssignedVars[]" "[136] L17-->L59: 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]" "[104] L41-->L43: Formula: (< v_x4_1 v_w_3) InVars {x4=v_x4_1, w=v_w_3} OutVars{x4=v_x4_1, w=v_w_3} AuxVars[] AssignedVars[]" "[139] L18-->L68: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[106] L43-->L41: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" "[142] L19-->$Ultimate##0: Formula: (and (= v_thread6Thread1of1ForFork5_thidvar3_2 6) (= v_thread6Thread1of1ForFork5_thidvar5_2 6) (= v_thread6Thread1of1ForFork5_thidvar4_2 6) (= v_thread6Thread1of1ForFork5_thidvar2_2 6) (= v_thread6Thread1of1ForFork5_thidvar0_2 6) (= v_thread6Thread1of1ForFork5_thidvar1_2 6)) InVars {} OutVars{thread6Thread1of1ForFork5_thidvar0=v_thread6Thread1of1ForFork5_thidvar0_2, thread6Thread1of1ForFork5_thidvar1=v_thread6Thread1of1ForFork5_thidvar1_2, thread6Thread1of1ForFork5_thidvar2=v_thread6Thread1of1ForFork5_thidvar2_2, thread6Thread1of1ForFork5_thidvar3=v_thread6Thread1of1ForFork5_thidvar3_2, thread6Thread1of1ForFork5_thidvar4=v_thread6Thread1of1ForFork5_thidvar4_2, thread6Thread1of1ForFork5_thidvar5=v_thread6Thread1of1ForFork5_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_thidvar0, thread6Thread1of1ForFork5_thidvar1, thread6Thread1of1ForFork5_thidvar2, thread6Thread1of1ForFork5_thidvar3, thread6Thread1of1ForFork5_thidvar4, thread6Thread1of1ForFork5_thidvar5]" "[103] L41-->thread2FINAL: Formula: (<= v_w_4 v_x4_4) InVars {x4=v_x4_4, w=v_w_4} OutVars{x4=v_x4_4, w=v_w_4} AuxVars[] AssignedVars[]" "[120] $Ultimate##0-->L79-1: Formula: (< 0 v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" "[107] L50-->thread3FINAL: Formula: (<= v_w_6 v_x2_4) InVars {x2=v_x2_4, w=v_w_6} OutVars{x2=v_x2_4, w=v_w_6} AuxVars[] AssignedVars[]" "[122] L79-1-->L81: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[112] L59-->L61: Formula: (< v_x3_1 v_w_7) InVars {w=v_w_7, x3=v_x3_1} OutVars{w=v_w_7, x3=v_x3_1} AuxVars[] AssignedVars[]" "[124] L81-->L79-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" "[114] L61-->L59: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[121] L79-1-->thread6FINAL: Formula: (<= v_x1_8 v_y_2) InVars {y=v_y_2, x1=v_x1_8} OutVars{y=v_y_2, x1=v_x1_8} AuxVars[] AssignedVars[]" "[111] L59-->thread4FINAL: Formula: (<= v_w_8 v_x3_4) InVars {w=v_w_8, x3=v_x3_4} OutVars{w=v_w_8, x3=v_x3_4} AuxVars[] AssignedVars[]" [2025-04-26 18:44:30,039 INFO L754 eck$LassoCheckResult]: Loop: "[116] L68-->L70: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[118] L70-->L68: 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:30,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:30,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1637967731, now seen corresponding path program 1 times [2025-04-26 18:44:30,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:30,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657303764] [2025-04-26 18:44:30,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:30,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:30,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:44:30,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:44:30,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:30,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:30,093 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:30,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:44:30,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657303764] [2025-04-26 18:44:30,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657303764] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:44:30,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:44:30,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:44:30,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121334456] [2025-04-26 18:44:30,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:44:30,098 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:44:30,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:30,098 INFO L85 PathProgramCache]: Analyzing trace with hash 4675, now seen corresponding path program 2 times [2025-04-26 18:44:30,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:30,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722219322] [2025-04-26 18:44:30,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:44:30,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:30,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:30,100 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:30,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:44:30,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:30,100 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:30,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:30,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:30,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:30,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:30,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:30,115 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:30,115 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:30,115 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:30,115 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:30,115 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:30,115 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:30,115 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:30,115 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:30,115 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration8_Loop [2025-04-26 18:44:30,115 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:30,115 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:30,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:30,127 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:30,127 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:30,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:30,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:30,129 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:30,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 18:44:30,132 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:30,132 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:30,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 18:44:30,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:30,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:30,149 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:30,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 18:44:30,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:30,151 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:30,221 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:30,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 18:44:30,226 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:30,226 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:30,226 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:30,226 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:30,226 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:30,226 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:30,226 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:30,226 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:30,226 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration8_Loop [2025-04-26 18:44:30,226 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:30,226 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:30,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:30,238 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:30,238 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:30,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:30,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:30,240 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:30,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 18:44:30,242 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:30,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:30,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:30,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:30,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:30,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:30,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:30,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:30,255 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:30,257 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:30,257 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:30,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:30,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:30,259 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:30,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 18:44:30,260 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:30,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 18:44:30,263 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:30,263 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:30,263 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:44:30,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 18:44:30,268 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:30,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:30,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:44:30,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:44:30,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:30,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:30,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:30,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:30,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:30,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:30,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:30,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:30,316 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:30,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:30,326 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:30,326 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:30,326 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62424 states and 198928 transitions. cyclomatic complexity: 142365 Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (in total 23), 3 states have internal predecessors, (23), 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:31,562 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62424 states and 198928 transitions. cyclomatic complexity: 142365. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (in total 23), 3 states have internal predecessors, (23), 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 136699 states and 417896 transitions. Complement of second has 7 states. [2025-04-26 18:44:31,563 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:31,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (in total 23), 3 states have internal predecessors, (23), 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:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-04-26 18:44:31,563 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 21 letters. Loop has 2 letters. [2025-04-26 18:44:31,563 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:31,563 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 23 letters. Loop has 2 letters. [2025-04-26 18:44:31,564 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:31,564 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 21 letters. Loop has 4 letters. [2025-04-26 18:44:31,564 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:31,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136699 states and 417896 transitions. [2025-04-26 18:44:33,155 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 254 [2025-04-26 18:44:33,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136699 states to 94386 states and 284452 transitions. [2025-04-26 18:44:33,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21479 [2025-04-26 18:44:34,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22032 [2025-04-26 18:44:34,007 INFO L74 IsDeterministic]: Start isDeterministic. Operand 94386 states and 284452 transitions. [2025-04-26 18:44:34,008 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:34,008 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94386 states and 284452 transitions. [2025-04-26 18:44:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94386 states and 284452 transitions. [2025-04-26 18:44:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94386 to 64657. [2025-04-26 18:44:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64657 states, 64657 states have (on average 3.131787741466508) internal successors, (in total 202492), 64656 states have internal predecessors, (202492), 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:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64657 states to 64657 states and 202492 transitions. [2025-04-26 18:44:35,560 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64657 states and 202492 transitions. [2025-04-26 18:44:35,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:44:35,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:44:35,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:44:35,563 INFO L87 Difference]: Start difference. First operand 64657 states and 202492 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 2 states have internal predecessors, (21), 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:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:44:35,692 INFO L93 Difference]: Finished difference Result 20218 states and 58184 transitions. [2025-04-26 18:44:35,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20218 states and 58184 transitions. [2025-04-26 18:44:36,115 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:44:36,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20218 states to 0 states and 0 transitions. [2025-04-26 18:44:36,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:44:36,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:44:36,115 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:44:36,115 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:44:36,115 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:36,115 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:36,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:44:36,120 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:36,120 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:44:36,120 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:44:36,120 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:44:36,120 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:44:36,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:44:36,131 INFO L201 PluginConnector]: Adding new model m11.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:44:36 BoogieIcfgContainer [2025-04-26 18:44:36,131 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:44:36,131 INFO L158 Benchmark]: Toolchain (without parser) took 37503.27ms. Allocated memory was 155.2MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 85.0MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2025-04-26 18:44:36,131 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:44:36,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.17ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 83.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:44:36,132 INFO L158 Benchmark]: Boogie Preprocessor took 31.92ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 82.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:44:36,132 INFO L158 Benchmark]: RCFGBuilder took 181.10ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 72.1MB in the end (delta: 9.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:44:36,132 INFO L158 Benchmark]: BuchiAutomizer took 37251.90ms. Allocated memory was 155.2MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 71.9MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2025-04-26 18:44:36,133 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.13ms. Allocated memory is still 155.2MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.17ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 83.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 31.92ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 82.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 181.10ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 72.1MB in the end (delta: 9.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 37251.90ms. Allocated memory was 155.2MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 71.9MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 37.1s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. Construction of modules took 0.3s. Büchi inclusion checks took 7.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 9.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 105357 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 13.1s Buchi closure took 0.3s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [8, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 637 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 629 mSDsluCounter, 820 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 406 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 544 IncrementalHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 414 mSDtfsCounter, 544 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT7 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s InitialAbstractionConstructionTime: 1.6s InitialAbstraction: Time to compute Ample Reduction [ms]: 1614, Number of transitions in reduction automaton: 34420, Number of states in reduction automaton: 9762, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (1 trivial, 8 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x5 + w and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + w and consists of 4 locations. One deterministic module has affine ranking function w + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + w and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * y and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * y and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:44:36,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...