/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/3_thr/mixed_3.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:35,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:35,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:35,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:35,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:35,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:35,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:35,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:35,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:35,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:35,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:35,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:35,324 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:35,324 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:35,324 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:35,324 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:35,324 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:35,324 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:35,325 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:35,325 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:35,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:35,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:35,325 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:35,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:35,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:35,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:35,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:35,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:35,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:35,325 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:35,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:35,325 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:35,325 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:35,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:35,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:35,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:35,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:35,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:35,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:35,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:35,326 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:35,326 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:35,326 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:35,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:35,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:35,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:35,540 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:35,541 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:35,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/mixed_3.c.bpl [2025-04-26 18:42:35,542 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/mixed_3.c.bpl' [2025-04-26 18:42:35,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:35,557 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:35,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:35,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:35,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:35,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:35" (1/1) ... [2025-04-26 18:42:35,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:35" (1/1) ... [2025-04-26 18:42:35,590 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:35,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:35,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:35,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:35,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:35,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:35" (1/1) ... [2025-04-26 18:42:35,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:35" (1/1) ... [2025-04-26 18:42:35,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:35" (1/1) ... [2025-04-26 18:42:35,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:35" (1/1) ... [2025-04-26 18:42:35,599 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:35" (1/1) ... [2025-04-26 18:42:35,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:35" (1/1) ... [2025-04-26 18:42:35,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:35" (1/1) ... [2025-04-26 18:42:35,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:35" (1/1) ... [2025-04-26 18:42:35,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:35" (1/1) ... [2025-04-26 18:42:35,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:35,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:35,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:35,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:35,611 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:35" (1/1) ... [2025-04-26 18:42:35,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:35,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,636 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:42:35,639 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:42:35,661 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:35,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:35,661 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:35,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:35,661 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:42:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:42:35,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:42:35,661 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:35,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:35,662 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:42:35,697 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:35,698 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:35,762 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:35,762 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:35,770 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:35,770 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:35,772 INFO L201 PluginConnector]: Adding new model mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:35 BoogieIcfgContainer [2025-04-26 18:42:35,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:35,773 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:35,773 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:35,778 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:35,779 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:35,779 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:35" (1/2) ... [2025-04-26 18:42:35,780 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@781ff601 and model type mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:35, skipping insertion in model container [2025-04-26 18:42:35,780 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:35,780 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:35" (2/2) ... [2025-04-26 18:42:35,781 INFO L376 chiAutomizerObserver]: Analyzing ICFG mixed_3.c.bpl [2025-04-26 18:42:35,823 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:42:35,857 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:35,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:35,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,859 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:42:35,860 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:42:35,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 34 transitions, 89 flow [2025-04-26 18:42:35,920 INFO L116 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-04-26 18:42:35,922 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:42:35,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 56 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 27. Up to 4 conditions per place. [2025-04-26 18:42:35,925 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 34 transitions, 89 flow [2025-04-26 18:42:35,928 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 28 transitions, 74 flow [2025-04-26 18:42:35,928 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 32 places, 28 transitions, 74 flow [2025-04-26 18:42:35,929 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 28 transitions, 74 flow [2025-04-26 18:42:35,964 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 273 states, 272 states have (on average 3.338235294117647) internal successors, (in total 908), 272 states have internal predecessors, (908), 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:42:35,965 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 273 states, 272 states have (on average 3.338235294117647) internal successors, (in total 908), 272 states have internal predecessors, (908), 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:42:35,967 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:36,046 WARN L140 AmpleReduction]: Number of pruned transitions: 194 [2025-04-26 18:42:36,047 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:36,048 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 58 [2025-04-26 18:42:36,048 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:19 [2025-04-26 18:42:36,048 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:105 [2025-04-26 18:42:36,048 WARN L145 AmpleReduction]: Times succ was already a loop node:108 [2025-04-26 18:42:36,048 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:26 [2025-04-26 18:42:36,049 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:36,049 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 183 states, 182 states have (on average 2.2472527472527473) internal successors, (in total 409), 182 states have internal predecessors, (409), 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:42:36,055 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:36,056 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:36,056 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:36,056 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:36,056 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:36,056 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:36,056 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:36,056 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:36,058 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 183 states, 182 states have (on average 2.2472527472527473) internal successors, (in total 409), 182 states have internal predecessors, (409), 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:42:36,070 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 137 [2025-04-26 18:42:36,070 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:36,070 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:36,074 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:36,074 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:36,074 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:36,075 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 183 states, 182 states have (on average 2.2472527472527473) internal successors, (in total 409), 182 states have internal predecessors, (409), 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:42:36,081 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 137 [2025-04-26 18:42:36,081 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:36,081 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:36,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:36,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:36,086 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" [2025-04-26 18:42:36,086 INFO L754 eck$LassoCheckResult]: Loop: "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[82] L29-->L29-2: Formula: (= v_x_3 (+ v_tx_2 v_x_2 1)) InVars {tx=v_tx_2, x=v_x_3} OutVars{tx=v_tx_2, x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 18:42:36,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:36,092 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 1 times [2025-04-26 18:42:36,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:36,096 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651765512] [2025-04-26 18:42:36,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:36,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:36,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:36,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:36,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:36,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:36,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:36,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:36,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:36,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:36,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:36,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:36,161 INFO L85 PathProgramCache]: Analyzing trace with hash 3523, now seen corresponding path program 1 times [2025-04-26 18:42:36,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:36,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916009894] [2025-04-26 18:42:36,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:36,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:36,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:36,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:36,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:36,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:36,170 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:36,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:36,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:36,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:36,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:36,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:36,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:36,180 INFO L85 PathProgramCache]: Analyzing trace with hash 4009932, now seen corresponding path program 1 times [2025-04-26 18:42:36,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:36,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578452236] [2025-04-26 18:42:36,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:36,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:36,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:36,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:36,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:36,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:36,188 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:36,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:36,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:36,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:36,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:36,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:36,265 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:36,266 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:36,266 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:36,266 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:36,266 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:36,266 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,266 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:36,266 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:36,267 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:42:36,267 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:36,267 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:36,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:36,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:36,363 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:36,364 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:36,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:36,368 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:42:36,370 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:42:36,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:36,371 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:36,396 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:42:36,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:36,399 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:42:36,400 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:42:36,401 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:36,401 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:36,528 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:36,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:36,535 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:36,535 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:36,535 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:36,535 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:36,535 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:36,535 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,535 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:36,535 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:36,535 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:42:36,535 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:36,535 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:36,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:36,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:36,605 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:36,608 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:36,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:36,611 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:42:36,612 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:42:36,615 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:42:36,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:36,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:36,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:36,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:36,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:36,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:36,646 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:36,655 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:42:36,656 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 18:42:36,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:36,659 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:42:36,661 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:42:36,662 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:36,683 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:42:36,684 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:36,684 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:36,685 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x, y1) = 2*x - 2*y1 + 1 Supporting invariants [1*tx >= 0] [2025-04-26 18:42:36,690 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:42:36,698 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:36,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:36,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:36,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:36,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:36,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:36,753 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:42:36,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:36,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:36,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:36,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:36,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:36,780 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:36,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:36,806 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:42:36,819 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:42:36,821 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 183 states, 182 states have (on average 2.2472527472527473) internal successors, (in total 409), 182 states have internal predecessors, (409), 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:42:36,915 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 183 states, 182 states have (on average 2.2472527472527473) internal successors, (in total 409), 182 states have internal predecessors, (409), 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 469 states and 1041 transitions. Complement of second has 6 states. [2025-04-26 18:42:36,916 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:42:36,919 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:42:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-26 18:42:36,923 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:42:36,924 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:36,924 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:36,924 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:36,924 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:42:36,924 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:36,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 469 states and 1041 transitions. [2025-04-26 18:42:36,934 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 59 [2025-04-26 18:42:36,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 469 states to 276 states and 619 transitions. [2025-04-26 18:42:36,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2025-04-26 18:42:36,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2025-04-26 18:42:36,945 INFO L74 IsDeterministic]: Start isDeterministic. Operand 276 states and 619 transitions. [2025-04-26 18:42:36,945 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:36,945 INFO L218 hiAutomatonCegarLoop]: Abstraction has 276 states and 619 transitions. [2025-04-26 18:42:36,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states and 619 transitions. [2025-04-26 18:42:36,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 221. [2025-04-26 18:42:36,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 221 states have (on average 2.3484162895927603) internal successors, (in total 519), 220 states have internal predecessors, (519), 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:42:36,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 519 transitions. [2025-04-26 18:42:36,976 INFO L240 hiAutomatonCegarLoop]: Abstraction has 221 states and 519 transitions. [2025-04-26 18:42:36,976 INFO L438 stractBuchiCegarLoop]: Abstraction has 221 states and 519 transitions. [2025-04-26 18:42:36,976 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:36,976 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 519 transitions. [2025-04-26 18:42:36,981 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 59 [2025-04-26 18:42:36,981 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:36,981 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:36,981 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:36,981 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:36,982 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[79] L29-2-->thread1FINAL: Formula: (< v_x_4 v_y1_4) InVars {y1=v_y1_4, x=v_x_4} OutVars{y1=v_y1_4, x=v_x_4} AuxVars[] AssignedVars[]" "[81] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[84] $Ultimate##0-->L45: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[86] L45-->L53-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" [2025-04-26 18:42:36,982 INFO L754 eck$LassoCheckResult]: Loop: "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[92] L53-->L59: Formula: (< v_b_4 1) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[94] L59-->L53-2: Formula: (= v_x1_6 (+ v_x1_5 v_t_4)) InVars {x1=v_x1_6, t=v_t_4} OutVars{x1=v_x1_5, t=v_t_4} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:36,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:36,982 INFO L85 PathProgramCache]: Analyzing trace with hash -800050754, now seen corresponding path program 1 times [2025-04-26 18:42:36,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:36,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902072916] [2025-04-26 18:42:36,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:36,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:36,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:36,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:36,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:36,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:36,987 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:36,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:36,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:36,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:36,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:36,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:36,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:36,991 INFO L85 PathProgramCache]: Analyzing trace with hash 118266, now seen corresponding path program 1 times [2025-04-26 18:42:36,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:36,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421779119] [2025-04-26 18:42:36,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:36,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:36,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:36,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:36,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:36,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:36,993 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:36,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:36,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:36,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:36,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:36,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:36,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:36,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1538398435, now seen corresponding path program 1 times [2025-04-26 18:42:36,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:36,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760390730] [2025-04-26 18:42:36,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:36,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:37,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:37,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:37,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:37,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:37,028 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:42:37,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:37,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760390730] [2025-04-26 18:42:37,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760390730] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:37,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:37,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:42:37,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552858626] [2025-04-26 18:42:37,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:37,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:37,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:37,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:37,055 INFO L87 Difference]: Start difference. First operand 221 states and 519 transitions. cyclomatic complexity: 334 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:42:37,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:37,080 INFO L93 Difference]: Finished difference Result 316 states and 733 transitions. [2025-04-26 18:42:37,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 733 transitions. [2025-04-26 18:42:37,083 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 95 [2025-04-26 18:42:37,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 733 transitions. [2025-04-26 18:42:37,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2025-04-26 18:42:37,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2025-04-26 18:42:37,088 INFO L74 IsDeterministic]: Start isDeterministic. Operand 316 states and 733 transitions. [2025-04-26 18:42:37,088 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:37,088 INFO L218 hiAutomatonCegarLoop]: Abstraction has 316 states and 733 transitions. [2025-04-26 18:42:37,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 733 transitions. [2025-04-26 18:42:37,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 277. [2025-04-26 18:42:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 277 states have (on average 2.3826714801444044) internal successors, (in total 660), 276 states have internal predecessors, (660), 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:42:37,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 660 transitions. [2025-04-26 18:42:37,099 INFO L240 hiAutomatonCegarLoop]: Abstraction has 277 states and 660 transitions. [2025-04-26 18:42:37,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:37,100 INFO L438 stractBuchiCegarLoop]: Abstraction has 277 states and 660 transitions. [2025-04-26 18:42:37,100 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:37,100 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 277 states and 660 transitions. [2025-04-26 18:42:37,103 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 79 [2025-04-26 18:42:37,103 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:37,103 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:37,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:37,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:37,104 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[79] L29-2-->thread1FINAL: Formula: (< v_x_4 v_y1_4) InVars {y1=v_y1_4, x=v_x_4} OutVars{y1=v_y1_4, x=v_x_4} AuxVars[] AssignedVars[]" "[81] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[84] $Ultimate##0-->L45: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[86] L45-->L53-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" [2025-04-26 18:42:37,104 INFO L754 eck$LassoCheckResult]: Loop: "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[91] L53-->L55: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[93] L55-->L53-2: Formula: (= (+ v_x1_4 v_t_3) v_x1_3) InVars {x1=v_x1_4, t=v_t_3} OutVars{x1=v_x1_3, t=v_t_3} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:37,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:37,104 INFO L85 PathProgramCache]: Analyzing trace with hash -800050754, now seen corresponding path program 2 times [2025-04-26 18:42:37,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:37,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953478808] [2025-04-26 18:42:37,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:37,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:37,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:37,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:37,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:37,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:37,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:37,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:37,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:37,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:37,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:37,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:37,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:37,115 INFO L85 PathProgramCache]: Analyzing trace with hash 118234, now seen corresponding path program 1 times [2025-04-26 18:42:37,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:37,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864680090] [2025-04-26 18:42:37,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:37,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:37,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:37,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:37,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:37,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:37,121 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:37,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:37,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:37,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:37,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:37,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:37,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:37,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1538398467, now seen corresponding path program 1 times [2025-04-26 18:42:37,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:37,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660020503] [2025-04-26 18:42:37,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:37,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:37,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:37,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:37,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:37,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:37,131 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:37,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:37,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:37,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:37,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:37,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:37,189 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:37,189 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:37,189 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:37,190 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:37,190 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:37,190 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:37,190 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:37,190 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:37,190 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:42:37,190 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:37,190 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:37,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:37,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:37,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:37,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:37,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:37,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:37,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:37,258 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:37,258 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:37,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:37,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:37,260 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:42:37,261 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:42:37,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:37,262 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:37,273 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:37,273 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_thidvar0=0} Honda state: {thread2Thread1of1ForFork1_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:37,278 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:42:37,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:37,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:37,280 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:42:37,282 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:42:37,283 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:37,283 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:37,299 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:37,299 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {tx=0} Honda state: {tx=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:37,304 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:42:37,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:37,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:37,306 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:42:37,307 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:42:37,308 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:37,308 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:37,325 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:37,325 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {y1=1, x=0} Honda state: {y1=1, x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:37,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:42:37,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:37,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:37,333 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:42:37,334 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:42:37,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:37,335 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:37,353 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:37,353 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=1} Honda state: {b=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:37,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:37,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:37,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:37,361 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:42:37,362 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:42:37,365 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:37,365 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:37,377 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:37,377 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:37,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:37,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:37,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:37,385 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:42:37,386 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:42:37,388 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:37,388 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:37,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:37,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:37,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:37,406 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:42:37,406 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:42:37,407 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:37,407 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:37,550 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:37,556 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:42:37,556 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:37,556 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:37,556 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:37,556 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:37,556 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:37,556 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:37,556 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:37,556 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:37,556 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:42:37,556 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:37,556 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:37,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:37,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:37,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:37,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:37,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:37,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:37,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:37,627 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:37,627 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:37,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:37,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:37,629 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:42:37,631 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:42:37,633 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:42:37,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:37,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:37,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:37,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:37,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:37,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:37,647 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:37,653 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:42:37,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:37,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:37,655 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:42:37,657 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:42:37,661 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:42:37,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:37,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:37,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:37,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:37,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:37,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:37,674 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:37,680 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:42:37,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:37,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:37,681 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:42:37,682 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:42:37,684 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:42:37,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:37,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:37,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:37,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:37,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:37,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:37,698 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:37,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:37,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:37,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:37,708 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:42:37,710 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:42:37,717 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:42:37,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:37,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:37,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:37,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:37,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:37,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:37,733 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:37,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:42:37,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:37,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:37,742 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:42:37,743 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:42:37,745 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:42:37,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:37,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:37,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:37,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:37,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:37,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:37,758 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:37,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:37,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:37,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:37,767 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:42:37,767 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:42:37,768 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:42:37,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:37,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:37,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:37,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:37,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:37,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:37,783 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:37,788 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:42:37,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:37,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:37,790 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:42:37,791 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:42:37,792 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:42:37,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:37,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:37,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:37,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:37,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:37,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:37,808 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:37,813 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:42:37,813 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:37,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:37,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:37,815 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:42:37,817 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:42:37,818 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:37,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:37,834 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:37,834 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:37,834 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, n) = -2*x1 + 2*n + 1 Supporting invariants [1*t - 1 >= 0] [2025-04-26 18:42:37,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:42:37,844 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:37,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:37,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:37,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:37,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:37,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:37,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:42:37,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:37,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:37,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:37,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:37,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:37,886 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:37,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:37,913 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:42:37,914 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:42:37,914 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 277 states and 660 transitions. cyclomatic complexity: 433 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:42:37,977 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 277 states and 660 transitions. cyclomatic complexity: 433. 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 606 states and 1417 transitions. Complement of second has 6 states. [2025-04-26 18:42:37,977 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:42:37,978 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:42:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-04-26 18:42:37,978 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 18:42:37,979 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:37,979 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 18:42:37,979 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:37,979 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 7 letters. Loop has 6 letters. [2025-04-26 18:42:37,979 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:37,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 606 states and 1417 transitions. [2025-04-26 18:42:37,983 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 99 [2025-04-26 18:42:37,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 606 states to 442 states and 1041 transitions. [2025-04-26 18:42:37,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2025-04-26 18:42:37,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2025-04-26 18:42:37,987 INFO L74 IsDeterministic]: Start isDeterministic. Operand 442 states and 1041 transitions. [2025-04-26 18:42:37,988 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:37,988 INFO L218 hiAutomatonCegarLoop]: Abstraction has 442 states and 1041 transitions. [2025-04-26 18:42:37,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states and 1041 transitions. [2025-04-26 18:42:38,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 382. [2025-04-26 18:42:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 382 states have (on average 2.4659685863874348) internal successors, (in total 942), 381 states have internal predecessors, (942), 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:42:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 942 transitions. [2025-04-26 18:42:38,005 INFO L240 hiAutomatonCegarLoop]: Abstraction has 382 states and 942 transitions. [2025-04-26 18:42:38,005 INFO L438 stractBuchiCegarLoop]: Abstraction has 382 states and 942 transitions. [2025-04-26 18:42:38,005 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:38,005 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 382 states and 942 transitions. [2025-04-26 18:42:38,007 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 83 [2025-04-26 18:42:38,007 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:38,007 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:38,007 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:38,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:38,008 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[79] L29-2-->thread1FINAL: Formula: (< v_x_4 v_y1_4) InVars {y1=v_y1_4, x=v_x_4} OutVars{y1=v_y1_4, x=v_x_4} AuxVars[] AssignedVars[]" "[81] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[85] $Ultimate##0-->L49: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[87] L49-->L53-2: Formula: (= (+ v_t_2 1) 0) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" [2025-04-26 18:42:38,009 INFO L754 eck$LassoCheckResult]: Loop: "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[92] L53-->L59: Formula: (< v_b_4 1) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[94] L59-->L53-2: Formula: (= v_x1_6 (+ v_x1_5 v_t_4)) InVars {x1=v_x1_6, t=v_t_4} OutVars{x1=v_x1_5, t=v_t_4} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:38,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:38,010 INFO L85 PathProgramCache]: Analyzing trace with hash -800050722, now seen corresponding path program 1 times [2025-04-26 18:42:38,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:38,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87625410] [2025-04-26 18:42:38,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:38,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:38,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:38,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:38,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,017 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:38,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:38,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:38,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:38,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:38,020 INFO L85 PathProgramCache]: Analyzing trace with hash 118266, now seen corresponding path program 2 times [2025-04-26 18:42:38,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:38,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442413477] [2025-04-26 18:42:38,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:38,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:38,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:38,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:38,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:38,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,023 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:38,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:38,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:38,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:38,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:38,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1537445123, now seen corresponding path program 1 times [2025-04-26 18:42:38,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:38,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623659235] [2025-04-26 18:42:38,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:38,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:38,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:38,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:38,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:38,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:38,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:38,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:38,101 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:38,101 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:38,101 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:38,101 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:38,101 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:38,101 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,101 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:38,101 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:38,101 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:42:38,101 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:38,101 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:38,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:38,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:38,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:38,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:38,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:38,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:38,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:38,168 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:38,168 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:38,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,171 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:42:38,173 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:42:38,174 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:38,174 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:38,193 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:38,193 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {y1=1, x=0} Honda state: {y1=1, x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:38,198 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:42:38,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,200 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:42:38,201 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:42:38,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:38,202 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:38,219 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:38,219 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=0} Honda state: {b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:38,224 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:42:38,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,226 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:42:38,227 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:42:38,228 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:38,228 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:38,245 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:38,245 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {tx=0} Honda state: {tx=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:38,251 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:42:38,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,253 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:42:38,254 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:42:38,254 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:38,254 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:38,265 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:38,265 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:38,270 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:42:38,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,272 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:42:38,273 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:42:38,274 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:38,274 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:38,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 18:42:38,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,292 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:42:38,293 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:42:38,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:38,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:38,413 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:38,419 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:42:38,419 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:38,419 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:38,419 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:38,419 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:38,419 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:38,419 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,419 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:38,419 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:38,419 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:42:38,419 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:38,419 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:38,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:38,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:38,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:38,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:38,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:38,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:38,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:38,496 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:38,496 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:38,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,499 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:42:38,500 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:42:38,501 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:42:38,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:38,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:38,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:38,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:38,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:38,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:38,515 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:38,524 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:42:38,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,526 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:42:38,527 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:42:38,529 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:42:38,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:38,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:38,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:38,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:38,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:38,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:38,544 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:38,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:38,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,553 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:42:38,554 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:42:38,555 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:42:38,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:38,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:38,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:38,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:38,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:38,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:38,571 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:38,579 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:42:38,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,581 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:42:38,583 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:42:38,584 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:42:38,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:38,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:38,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:38,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:38,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:38,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:38,600 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:38,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:38,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,608 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:42:38,611 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:42:38,616 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:42:38,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:38,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:38,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:38,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:38,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:38,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:38,633 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:38,640 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:42:38,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,642 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:42:38,644 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:42:38,647 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:42:38,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:38,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:38,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:38,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:38,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:38,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:38,666 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:38,673 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:38,674 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:38,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,676 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:42:38,677 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:42:38,678 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:38,695 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:42:38,695 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:38,695 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:38,695 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, n) = -2*x1 + 2*n + 1 Supporting invariants [-1*t - 1 >= 0] [2025-04-26 18:42:38,701 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:42:38,707 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:38,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:38,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:38,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:38,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:38,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:42:38,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:38,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:38,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:38,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:38,745 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:38,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:38,771 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:42:38,771 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:42:38,772 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 382 states and 942 transitions. cyclomatic complexity: 623 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:42:38,842 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 382 states and 942 transitions. cyclomatic complexity: 623. 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 737 states and 1715 transitions. Complement of second has 7 states. [2025-04-26 18:42:38,843 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:42:38,844 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:42:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-04-26 18:42:38,844 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 18:42:38,844 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:38,844 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 18:42:38,844 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:38,844 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 7 letters. Loop has 6 letters. [2025-04-26 18:42:38,844 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:38,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 737 states and 1715 transitions. [2025-04-26 18:42:38,850 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 91 [2025-04-26 18:42:38,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 737 states to 626 states and 1453 transitions. [2025-04-26 18:42:38,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 272 [2025-04-26 18:42:38,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 300 [2025-04-26 18:42:38,856 INFO L74 IsDeterministic]: Start isDeterministic. Operand 626 states and 1453 transitions. [2025-04-26 18:42:38,856 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:38,856 INFO L218 hiAutomatonCegarLoop]: Abstraction has 626 states and 1453 transitions. [2025-04-26 18:42:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 1453 transitions. [2025-04-26 18:42:38,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 462. [2025-04-26 18:42:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 462 states have (on average 2.465367965367965) internal successors, (in total 1139), 461 states have internal predecessors, (1139), 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:42:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1139 transitions. [2025-04-26 18:42:38,867 INFO L240 hiAutomatonCegarLoop]: Abstraction has 462 states and 1139 transitions. [2025-04-26 18:42:38,867 INFO L438 stractBuchiCegarLoop]: Abstraction has 462 states and 1139 transitions. [2025-04-26 18:42:38,867 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:38,867 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 462 states and 1139 transitions. [2025-04-26 18:42:38,869 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 57 [2025-04-26 18:42:38,869 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:38,869 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:38,869 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:38,869 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:38,870 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[84] $Ultimate##0-->L45: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[83] L29-->L29-2: Formula: (= v_y1_2 (+ v_tx_3 v_y1_3 1)) InVars {y1=v_y1_3, tx=v_tx_3} OutVars{y1=v_y1_2, tx=v_tx_3} AuxVars[] AssignedVars[y1]" "[86] L45-->L53-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[107] L16-->L67: 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:42:38,870 INFO L754 eck$LassoCheckResult]: Loop: "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" "[98] L69-->L67: Formula: (= v_x2_3 (+ v_x2_2 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:38,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:38,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1477847920, now seen corresponding path program 1 times [2025-04-26 18:42:38,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:38,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56897407] [2025-04-26 18:42:38,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:38,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:38,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:38,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:38,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,875 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:38,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:38,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:38,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:38,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:38,888 INFO L85 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 1 times [2025-04-26 18:42:38,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:38,888 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734376652] [2025-04-26 18:42:38,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:38,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:38,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:38,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:38,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,890 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:38,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:38,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:38,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:38,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:38,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1422320782, now seen corresponding path program 1 times [2025-04-26 18:42:38,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:38,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601308336] [2025-04-26 18:42:38,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:38,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:38,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:38,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:38,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,907 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:38,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:38,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:38,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:38,928 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:38,928 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:38,928 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:38,928 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:38,928 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:38,928 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,928 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:38,928 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:38,928 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:38,928 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:38,928 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:38,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:38,939 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:38,940 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:38,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,941 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:38,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 18:42:38,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:38,944 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:38,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:38,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,963 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:38,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 18:42:38,966 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:38,966 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:39,038 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:39,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:39,043 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:39,043 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:39,043 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:39,043 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:39,043 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:39,043 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,043 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:39,043 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:39,043 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:39,043 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:39,043 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:39,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,057 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:39,057 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:39,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,062 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 18:42:39,064 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:42:39,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:39,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:39,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:39,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:39,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:39,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:39,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:39,078 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:39,081 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:39,081 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:39,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,083 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 18:42:39,086 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:39,088 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:42:39,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 18:42:39,090 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:39,090 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:39,090 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = -1*x1 + 1*x2 Supporting invariants [] [2025-04-26 18:42:39,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:39,097 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:39,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:39,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:39,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:39,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:39,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:39,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:39,131 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:39,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:39,141 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:42:39,141 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:42:39,141 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 462 states and 1139 transitions. cyclomatic complexity: 748 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:42:39,196 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 462 states and 1139 transitions. cyclomatic complexity: 748. 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 1183 states and 2818 transitions. Complement of second has 7 states. [2025-04-26 18:42:39,196 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:42:39,197 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:42:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-26 18:42:39,197 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:42:39,197 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:39,197 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:42:39,197 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:39,197 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:42:39,197 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:39,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1183 states and 2818 transitions. [2025-04-26 18:42:39,204 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 57 [2025-04-26 18:42:39,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1183 states to 829 states and 1976 transitions. [2025-04-26 18:42:39,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 281 [2025-04-26 18:42:39,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2025-04-26 18:42:39,231 INFO L74 IsDeterministic]: Start isDeterministic. Operand 829 states and 1976 transitions. [2025-04-26 18:42:39,231 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:39,231 INFO L218 hiAutomatonCegarLoop]: Abstraction has 829 states and 1976 transitions. [2025-04-26 18:42:39,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states and 1976 transitions. [2025-04-26 18:42:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 659. [2025-04-26 18:42:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 659 states have (on average 2.4279210925644916) internal successors, (in total 1600), 658 states have internal predecessors, (1600), 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:42:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1600 transitions. [2025-04-26 18:42:39,242 INFO L240 hiAutomatonCegarLoop]: Abstraction has 659 states and 1600 transitions. [2025-04-26 18:42:39,242 INFO L438 stractBuchiCegarLoop]: Abstraction has 659 states and 1600 transitions. [2025-04-26 18:42:39,243 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:42:39,243 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 659 states and 1600 transitions. [2025-04-26 18:42:39,245 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 57 [2025-04-26 18:42:39,245 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:39,245 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:39,245 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:39,245 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:39,246 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[85] $Ultimate##0-->L49: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[83] L29-->L29-2: Formula: (= v_y1_2 (+ v_tx_3 v_y1_3 1)) InVars {y1=v_y1_3, tx=v_tx_3} OutVars{y1=v_y1_2, tx=v_tx_3} AuxVars[] AssignedVars[y1]" "[87] L49-->L53-2: Formula: (= (+ v_t_2 1) 0) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" "[79] L29-2-->thread1FINAL: Formula: (< v_x_4 v_y1_4) InVars {y1=v_y1_4, x=v_x_4} OutVars{y1=v_y1_4, x=v_x_4} AuxVars[] AssignedVars[]" [2025-04-26 18:42:39,246 INFO L754 eck$LassoCheckResult]: Loop: "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[91] L53-->L55: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[93] L55-->L53-2: Formula: (= (+ v_x1_4 v_t_3) v_x1_3) InVars {x1=v_x1_4, t=v_t_3} OutVars{x1=v_x1_3, t=v_t_3} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:39,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1017533656, now seen corresponding path program 1 times [2025-04-26 18:42:39,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343848888] [2025-04-26 18:42:39,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:39,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:39,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:39,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,249 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:39,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:39,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:39,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,252 INFO L85 PathProgramCache]: Analyzing trace with hash 118234, now seen corresponding path program 2 times [2025-04-26 18:42:39,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435640224] [2025-04-26 18:42:39,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:39,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:39,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:39,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:39,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,254 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:39,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:39,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:39,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,256 INFO L85 PathProgramCache]: Analyzing trace with hash -533940829, now seen corresponding path program 1 times [2025-04-26 18:42:39,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143455296] [2025-04-26 18:42:39,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:39,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:39,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:39,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:39,273 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:42:39,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:39,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143455296] [2025-04-26 18:42:39,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143455296] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:39,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:39,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:42:39,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352532161] [2025-04-26 18:42:39,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:39,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:39,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:39,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:39,287 INFO L87 Difference]: Start difference. First operand 659 states and 1600 transitions. cyclomatic complexity: 1039 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:39,301 INFO L93 Difference]: Finished difference Result 592 states and 1378 transitions. [2025-04-26 18:42:39,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 592 states and 1378 transitions. [2025-04-26 18:42:39,304 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 40 [2025-04-26 18:42:39,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 592 states to 460 states and 1043 transitions. [2025-04-26 18:42:39,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2025-04-26 18:42:39,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2025-04-26 18:42:39,307 INFO L74 IsDeterministic]: Start isDeterministic. Operand 460 states and 1043 transitions. [2025-04-26 18:42:39,308 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:39,308 INFO L218 hiAutomatonCegarLoop]: Abstraction has 460 states and 1043 transitions. [2025-04-26 18:42:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states and 1043 transitions. [2025-04-26 18:42:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 424. [2025-04-26 18:42:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 424 states have (on average 2.294811320754717) internal successors, (in total 973), 423 states have internal predecessors, (973), 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:42:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 973 transitions. [2025-04-26 18:42:39,316 INFO L240 hiAutomatonCegarLoop]: Abstraction has 424 states and 973 transitions. [2025-04-26 18:42:39,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:39,317 INFO L438 stractBuchiCegarLoop]: Abstraction has 424 states and 973 transitions. [2025-04-26 18:42:39,317 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:42:39,317 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 424 states and 973 transitions. [2025-04-26 18:42:39,319 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 24 [2025-04-26 18:42:39,319 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:39,319 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:39,319 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:39,319 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:39,320 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[79] L29-2-->thread1FINAL: Formula: (< v_x_4 v_y1_4) InVars {y1=v_y1_4, x=v_x_4} OutVars{y1=v_y1_4, x=v_x_4} AuxVars[] AssignedVars[]" "[81] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[84] $Ultimate##0-->L45: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[86] L45-->L53-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[91] L53-->L55: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[107] L16-->L67: 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]" "[108] thread1EXIT-->L18: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" "[93] L55-->L53-2: Formula: (= (+ v_x1_4 v_t_3) v_x1_3) InVars {x1=v_x1_4, t=v_t_3} OutVars{x1=v_x1_3, t=v_t_3} AuxVars[] AssignedVars[x1]" "[88] L53-2-->thread2FINAL: Formula: (< v_n_1 v_x1_1) InVars {x1=v_x1_1, n=v_n_1} OutVars{x1=v_x1_1, n=v_n_1} AuxVars[] AssignedVars[]" [2025-04-26 18:42:39,320 INFO L754 eck$LassoCheckResult]: Loop: "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" "[98] L69-->L67: Formula: (= v_x2_3 (+ v_x2_2 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:39,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1167809052, now seen corresponding path program 1 times [2025-04-26 18:42:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372582395] [2025-04-26 18:42:39,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:39,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:42:39,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:42:39,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,326 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:39,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:42:39,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:42:39,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,331 INFO L85 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 2 times [2025-04-26 18:42:39,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589731761] [2025-04-26 18:42:39,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:39,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,333 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:39,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:39,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1278037790, now seen corresponding path program 1 times [2025-04-26 18:42:39,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405163635] [2025-04-26 18:42:39,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:39,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:42:39,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:42:39,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:39,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:42:39,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:42:39,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,368 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:39,368 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:39,368 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:39,368 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:39,368 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:39,368 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,368 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:39,368 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:39,368 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration7_Loop [2025-04-26 18:42:39,368 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:39,368 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:39,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,382 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:39,382 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:39,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,384 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 18:42:39,386 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:39,386 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:39,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 18:42:39,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,403 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 18:42:39,404 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:39,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:39,476 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:39,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:39,480 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:39,480 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:39,480 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:39,480 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:39,480 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:39,480 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,480 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:39,481 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:39,481 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration7_Loop [2025-04-26 18:42:39,481 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:39,481 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:39,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,492 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:39,492 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:39,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,495 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 18:42:39,497 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:42:39,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:39,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:39,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:39,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:39,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:39,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:39,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:39,509 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:39,511 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:39,511 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:39,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,513 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 18:42:39,514 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:39,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 18:42:39,518 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:39,518 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:39,518 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = -1*x1 + 1*x2 Supporting invariants [] [2025-04-26 18:42:39,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 18:42:39,524 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:39,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:42:39,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:42:39,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:39,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:39,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:39,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:39,557 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:39,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:39,572 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:42:39,572 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:42:39,572 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 424 states and 973 transitions. cyclomatic complexity: 611 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:39,595 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 424 states and 973 transitions. cyclomatic complexity: 611. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 505 states and 1133 transitions. Complement of second has 6 states. [2025-04-26 18:42:39,595 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:42:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2025-04-26 18:42:39,596 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:42:39,596 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:39,596 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 18:42:39,596 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:39,596 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 18:42:39,596 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:39,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 505 states and 1133 transitions. [2025-04-26 18:42:39,600 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 18:42:39,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 505 states to 398 states and 909 transitions. [2025-04-26 18:42:39,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2025-04-26 18:42:39,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2025-04-26 18:42:39,602 INFO L74 IsDeterministic]: Start isDeterministic. Operand 398 states and 909 transitions. [2025-04-26 18:42:39,602 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:39,602 INFO L218 hiAutomatonCegarLoop]: Abstraction has 398 states and 909 transitions. [2025-04-26 18:42:39,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states and 909 transitions. [2025-04-26 18:42:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2025-04-26 18:42:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 398 states have (on average 2.2839195979899496) internal successors, (in total 909), 397 states have internal predecessors, (909), 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:42:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 909 transitions. [2025-04-26 18:42:39,608 INFO L240 hiAutomatonCegarLoop]: Abstraction has 398 states and 909 transitions. [2025-04-26 18:42:39,608 INFO L438 stractBuchiCegarLoop]: Abstraction has 398 states and 909 transitions. [2025-04-26 18:42:39,608 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:42:39,608 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 398 states and 909 transitions. [2025-04-26 18:42:39,610 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 18:42:39,610 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:39,610 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:39,610 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:39,610 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:39,611 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[84] $Ultimate##0-->L45: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[83] L29-->L29-2: Formula: (= v_y1_2 (+ v_tx_3 v_y1_3 1)) InVars {y1=v_y1_3, tx=v_tx_3} OutVars{y1=v_y1_2, tx=v_tx_3} AuxVars[] AssignedVars[y1]" "[86] L45-->L53-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[83] L29-->L29-2: Formula: (= v_y1_2 (+ v_tx_3 v_y1_3 1)) InVars {y1=v_y1_3, tx=v_tx_3} OutVars{y1=v_y1_2, tx=v_tx_3} AuxVars[] AssignedVars[y1]" "[107] L16-->L67: 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]" "[91] L53-->L55: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[93] L55-->L53-2: Formula: (= (+ v_x1_4 v_t_3) v_x1_3) InVars {x1=v_x1_4, t=v_t_3} OutVars{x1=v_x1_3, t=v_t_3} AuxVars[] AssignedVars[x1]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" [2025-04-26 18:42:39,611 INFO L754 eck$LassoCheckResult]: Loop: "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" "[98] L69-->L67: Formula: (= v_x2_3 (+ v_x2_2 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:39,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1261953816, now seen corresponding path program 1 times [2025-04-26 18:42:39,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417880312] [2025-04-26 18:42:39,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:39,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:39,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:39,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,615 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:39,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:39,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:39,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,622 INFO L85 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 3 times [2025-04-26 18:42:39,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029145125] [2025-04-26 18:42:39,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:42:39,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,624 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:42:39,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,628 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:39,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1556842778, now seen corresponding path program 1 times [2025-04-26 18:42:39,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658057142] [2025-04-26 18:42:39,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:39,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:42:39,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:42:39,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,638 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:39,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:42:39,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:42:39,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,654 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:39,655 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:39,655 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:39,655 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:39,655 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:39,655 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,655 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:39,655 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:39,655 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration8_Loop [2025-04-26 18:42:39,655 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:39,655 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:39,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,669 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:39,670 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:39,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,672 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 18:42:39,675 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:39,675 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:39,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:39,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,693 INFO L229 MonitoredProcess]: Starting monitored process 44 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:42:39,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 18:42:39,696 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:39,696 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:39,768 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:39,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:39,772 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:39,772 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:39,773 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:39,773 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:39,773 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:39,773 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,773 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:39,773 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:39,773 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration8_Loop [2025-04-26 18:42:39,773 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:39,773 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:39,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,787 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:39,788 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:39,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,790 INFO L229 MonitoredProcess]: Starting monitored process 45 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:42:39,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 18:42:39,793 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:42:39,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:39,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:39,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:39,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:39,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:39,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:39,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:39,805 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:39,806 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:39,806 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:39,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,808 INFO L229 MonitoredProcess]: Starting monitored process 46 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:42:39,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 18:42:39,810 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:39,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-04-26 18:42:39,813 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:39,813 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:39,813 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = -1*x1 + 1*x2 Supporting invariants [] [2025-04-26 18:42:39,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 18:42:39,819 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:39,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:39,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:39,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:39,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:39,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:39,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:39,855 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:39,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:39,866 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:42:39,867 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:42:39,867 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 398 states and 909 transitions. cyclomatic complexity: 564 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:42:39,904 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 398 states and 909 transitions. cyclomatic complexity: 564. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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 906 states and 2028 transitions. Complement of second has 7 states. [2025-04-26 18:42:39,904 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:42:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:42:39,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-26 18:42:39,905 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:42:39,905 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:39,905 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:42:39,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:39,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:39,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:39,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:39,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:39,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:39,945 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:39,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:39,955 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:42:39,955 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:39,955 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 398 states and 909 transitions. cyclomatic complexity: 564 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:42:39,990 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 398 states and 909 transitions. cyclomatic complexity: 564. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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 906 states and 2028 transitions. Complement of second has 7 states. [2025-04-26 18:42:39,991 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:42:39,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:42:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-26 18:42:39,992 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:42:39,992 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:39,992 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:42:40,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:40,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:40,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,026 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,036 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:42:40,037 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:40,037 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 398 states and 909 transitions. cyclomatic complexity: 564 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:42:40,088 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 398 states and 909 transitions. cyclomatic complexity: 564. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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 1974 states and 4634 transitions. Complement of second has 18 states. [2025-04-26 18:42:40,088 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:42:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:42:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-04-26 18:42:40,089 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:42:40,089 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,089 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 18:42:40,089 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,089 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 18:42:40,089 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1974 states and 4634 transitions. [2025-04-26 18:42:40,100 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 18:42:40,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1974 states to 1178 states and 2696 transitions. [2025-04-26 18:42:40,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 304 [2025-04-26 18:42:40,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 322 [2025-04-26 18:42:40,106 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1178 states and 2696 transitions. [2025-04-26 18:42:40,106 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:40,106 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1178 states and 2696 transitions. [2025-04-26 18:42:40,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states and 2696 transitions. [2025-04-26 18:42:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 584. [2025-04-26 18:42:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 584 states have (on average 2.3424657534246576) internal successors, (in total 1368), 583 states have internal predecessors, (1368), 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:42:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1368 transitions. [2025-04-26 18:42:40,118 INFO L240 hiAutomatonCegarLoop]: Abstraction has 584 states and 1368 transitions. [2025-04-26 18:42:40,118 INFO L438 stractBuchiCegarLoop]: Abstraction has 584 states and 1368 transitions. [2025-04-26 18:42:40,118 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:42:40,118 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 584 states and 1368 transitions. [2025-04-26 18:42:40,120 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 18:42:40,120 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:40,120 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:40,120 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:40,120 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:40,121 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[85] $Ultimate##0-->L49: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[83] L29-->L29-2: Formula: (= v_y1_2 (+ v_tx_3 v_y1_3 1)) InVars {y1=v_y1_3, tx=v_tx_3} OutVars{y1=v_y1_2, tx=v_tx_3} AuxVars[] AssignedVars[y1]" "[87] L49-->L53-2: Formula: (= (+ v_t_2 1) 0) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[83] L29-->L29-2: Formula: (= v_y1_2 (+ v_tx_3 v_y1_3 1)) InVars {y1=v_y1_3, tx=v_tx_3} OutVars{y1=v_y1_2, tx=v_tx_3} AuxVars[] AssignedVars[y1]" "[107] L16-->L67: 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]" "[92] L53-->L59: Formula: (< v_b_4 1) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[94] L59-->L53-2: Formula: (= v_x1_6 (+ v_x1_5 v_t_4)) InVars {x1=v_x1_6, t=v_t_4} OutVars{x1=v_x1_5, t=v_t_4} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:40,121 INFO L754 eck$LassoCheckResult]: Loop: "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" "[98] L69-->L67: Formula: (= v_x2_3 (+ v_x2_2 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:40,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1486716078, now seen corresponding path program 1 times [2025-04-26 18:42:40,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451342210] [2025-04-26 18:42:40,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:40,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:40,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,125 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:40,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:40,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,128 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,128 INFO L85 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 4 times [2025-04-26 18:42:40,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,128 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878496152] [2025-04-26 18:42:40,128 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:42:40,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,130 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-04-26 18:42:40,130 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,131 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:42:40,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,131 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1489961684, now seen corresponding path program 1 times [2025-04-26 18:42:40,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905091389] [2025-04-26 18:42:40,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:42:40,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:42:40,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,135 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:42:40,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:42:40,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,148 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:40,148 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:40,148 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:40,148 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:40,148 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:40,148 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,148 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:40,148 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:40,148 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration9_Loop [2025-04-26 18:42:40,148 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:40,148 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:40,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,161 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:40,161 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:40,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,164 INFO L229 MonitoredProcess]: Starting monitored process 47 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:42:40,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 18:42:40,166 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:40,166 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:40,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 18:42:40,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,184 INFO L229 MonitoredProcess]: Starting monitored process 48 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:42:40,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 18:42:40,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:40,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:40,258 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:40,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:40,262 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:40,263 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:40,263 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:40,263 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:40,263 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:40,263 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,263 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:40,263 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:40,263 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration9_Loop [2025-04-26 18:42:40,263 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:40,263 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:40,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,280 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:40,280 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:40,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,282 INFO L229 MonitoredProcess]: Starting monitored process 49 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:42:40,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 18:42:40,284 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:42:40,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:40,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:40,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:40,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:40,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:40,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:40,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:40,296 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:40,298 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:40,298 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:40,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,300 INFO L229 MonitoredProcess]: Starting monitored process 50 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:42:40,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 18:42:40,302 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:40,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:40,306 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:40,306 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:40,306 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = -1*x1 + 1*x2 Supporting invariants [] [2025-04-26 18:42:40,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:40,314 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:40,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:40,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:40,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,349 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,359 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:42:40,359 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:42:40,359 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 584 states and 1368 transitions. cyclomatic complexity: 834 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:42:40,393 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 584 states and 1368 transitions. cyclomatic complexity: 834. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 1277 states and 3030 transitions. Complement of second has 7 states. [2025-04-26 18:42:40,394 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:42:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:42:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2025-04-26 18:42:40,395 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:42:40,395 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,395 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 18:42:40,396 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,396 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 18:42:40,396 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1277 states and 3030 transitions. [2025-04-26 18:42:40,402 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-04-26 18:42:40,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1277 states to 1041 states and 2419 transitions. [2025-04-26 18:42:40,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 287 [2025-04-26 18:42:40,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 288 [2025-04-26 18:42:40,408 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1041 states and 2419 transitions. [2025-04-26 18:42:40,408 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:40,408 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1041 states and 2419 transitions. [2025-04-26 18:42:40,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states and 2419 transitions. [2025-04-26 18:42:40,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 707. [2025-04-26 18:42:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 707 states have (on average 2.328147100424328) internal successors, (in total 1646), 706 states have internal predecessors, (1646), 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:42:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1646 transitions. [2025-04-26 18:42:40,419 INFO L240 hiAutomatonCegarLoop]: Abstraction has 707 states and 1646 transitions. [2025-04-26 18:42:40,419 INFO L438 stractBuchiCegarLoop]: Abstraction has 707 states and 1646 transitions. [2025-04-26 18:42:40,419 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 18:42:40,419 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 707 states and 1646 transitions. [2025-04-26 18:42:40,421 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 18:42:40,421 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:40,421 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:40,422 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:40,422 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:40,422 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[79] L29-2-->thread1FINAL: Formula: (< v_x_4 v_y1_4) InVars {y1=v_y1_4, x=v_x_4} OutVars{y1=v_y1_4, x=v_x_4} AuxVars[] AssignedVars[]" "[81] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[84] $Ultimate##0-->L45: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[86] L45-->L53-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[91] L53-->L55: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[107] L16-->L67: 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]" "[108] thread1EXIT-->L18: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" "[93] L55-->L53-2: Formula: (= (+ v_x1_4 v_t_3) v_x1_3) InVars {x1=v_x1_4, t=v_t_3} OutVars{x1=v_x1_3, t=v_t_3} AuxVars[] AssignedVars[x1]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[91] L53-->L55: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" [2025-04-26 18:42:40,422 INFO L754 eck$LassoCheckResult]: Loop: "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" "[98] L69-->L67: Formula: (= v_x2_3 (+ v_x2_2 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:40,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1842342366, now seen corresponding path program 1 times [2025-04-26 18:42:40,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885300034] [2025-04-26 18:42:40,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:40,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:40,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,428 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:40,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:40,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,434 INFO L85 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 5 times [2025-04-26 18:42:40,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,434 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190536137] [2025-04-26 18:42:40,434 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 18:42:40,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,437 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,438 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,438 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:40,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,438 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,440 INFO L85 PathProgramCache]: Analyzing trace with hash 964490848, now seen corresponding path program 1 times [2025-04-26 18:42:40,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136379631] [2025-04-26 18:42:40,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:42:40,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:42:40,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,443 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:42:40,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:42:40,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,458 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:40,458 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:40,458 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:40,458 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:40,458 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:40,458 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,458 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:40,458 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:40,458 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration10_Loop [2025-04-26 18:42:40,458 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:40,458 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:40,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,469 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:40,470 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:40,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,471 INFO L229 MonitoredProcess]: Starting monitored process 51 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:42:40,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 18:42:40,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:40,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:40,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-04-26 18:42:40,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,492 INFO L229 MonitoredProcess]: Starting monitored process 52 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:42:40,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 18:42:40,494 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:40,494 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:40,566 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:40,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 18:42:40,570 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:40,570 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:40,570 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:40,570 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:40,570 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:40,570 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,570 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:40,570 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:40,570 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration10_Loop [2025-04-26 18:42:40,570 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:40,570 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:40,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,584 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:40,584 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:40,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,586 INFO L229 MonitoredProcess]: Starting monitored process 53 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:42:40,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 18:42:40,589 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:42:40,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:40,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:40,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:40,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:40,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:40,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:40,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:40,602 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:40,604 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:40,604 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:40,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,606 INFO L229 MonitoredProcess]: Starting monitored process 54 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:42:40,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 18:42:40,607 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:40,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:40,610 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:40,611 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:40,611 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = -1*x1 + 1*x2 Supporting invariants [] [2025-04-26 18:42:40,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:40,616 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:40,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:40,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:40,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,648 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,656 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:42:40,657 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:42:40,657 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 707 states and 1646 transitions. cyclomatic complexity: 1006 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:40,686 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 707 states and 1646 transitions. cyclomatic complexity: 1006. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 937 states and 2128 transitions. Complement of second has 7 states. [2025-04-26 18:42:40,686 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:42:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-04-26 18:42:40,687 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:42:40,687 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,687 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:42:40,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:40,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:40,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,725 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:40,734 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:40,734 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 707 states and 1646 transitions. cyclomatic complexity: 1006 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:40,767 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 707 states and 1646 transitions. cyclomatic complexity: 1006. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 937 states and 2128 transitions. Complement of second has 7 states. [2025-04-26 18:42:40,767 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:42:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-04-26 18:42:40,768 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:42:40,768 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,768 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:42:40,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:40,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:40,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,801 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,828 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:42:40,829 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:40,829 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 707 states and 1646 transitions. cyclomatic complexity: 1006 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:40,861 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 707 states and 1646 transitions. cyclomatic complexity: 1006. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 940 states and 2131 transitions. Complement of second has 6 states. [2025-04-26 18:42:40,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:42:40,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-04-26 18:42:40,862 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:42:40,862 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,862 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 18:42:40,863 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,863 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 18:42:40,863 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 940 states and 2131 transitions. [2025-04-26 18:42:40,867 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 18:42:40,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 940 states to 610 states and 1445 transitions. [2025-04-26 18:42:40,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2025-04-26 18:42:40,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2025-04-26 18:42:40,870 INFO L74 IsDeterministic]: Start isDeterministic. Operand 610 states and 1445 transitions. [2025-04-26 18:42:40,870 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:40,870 INFO L218 hiAutomatonCegarLoop]: Abstraction has 610 states and 1445 transitions. [2025-04-26 18:42:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states and 1445 transitions. [2025-04-26 18:42:40,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 552. [2025-04-26 18:42:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 552 states have (on average 2.4347826086956523) internal successors, (in total 1344), 551 states have internal predecessors, (1344), 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:42:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1344 transitions. [2025-04-26 18:42:40,881 INFO L240 hiAutomatonCegarLoop]: Abstraction has 552 states and 1344 transitions. [2025-04-26 18:42:40,881 INFO L438 stractBuchiCegarLoop]: Abstraction has 552 states and 1344 transitions. [2025-04-26 18:42:40,881 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 18:42:40,881 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 552 states and 1344 transitions. [2025-04-26 18:42:40,882 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 18:42:40,882 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:40,883 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:40,883 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:40,884 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:40,884 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[84] $Ultimate##0-->L45: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[83] L29-->L29-2: Formula: (= v_y1_2 (+ v_tx_3 v_y1_3 1)) InVars {y1=v_y1_3, tx=v_tx_3} OutVars{y1=v_y1_2, tx=v_tx_3} AuxVars[] AssignedVars[y1]" "[86] L45-->L53-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[83] L29-->L29-2: Formula: (= v_y1_2 (+ v_tx_3 v_y1_3 1)) InVars {y1=v_y1_3, tx=v_tx_3} OutVars{y1=v_y1_2, tx=v_tx_3} AuxVars[] AssignedVars[y1]" "[107] L16-->L67: 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]" "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" "[91] L53-->L55: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[93] L55-->L53-2: Formula: (= (+ v_x1_4 v_t_3) v_x1_3) InVars {x1=v_x1_4, t=v_t_3} OutVars{x1=v_x1_3, t=v_t_3} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:40,884 INFO L754 eck$LassoCheckResult]: Loop: "[98] L69-->L67: Formula: (= v_x2_3 (+ v_x2_2 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" [2025-04-26 18:42:40,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,884 INFO L85 PathProgramCache]: Analyzing trace with hash 466009758, now seen corresponding path program 1 times [2025-04-26 18:42:40,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163806664] [2025-04-26 18:42:40,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:42:40,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:42:40,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:42:40,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:42:40,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,895 INFO L85 PathProgramCache]: Analyzing trace with hash 4095, now seen corresponding path program 6 times [2025-04-26 18:42:40,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595692839] [2025-04-26 18:42:40,895 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 18:42:40,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,897 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,898 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,898 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 18:42:40,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,898 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1158781788, now seen corresponding path program 2 times [2025-04-26 18:42:40,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571242579] [2025-04-26 18:42:40,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:40,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:42:40,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:42:40,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:40,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:42:40,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:42:40,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,924 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:40,925 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:40,925 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:40,925 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:40,925 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:40,925 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,925 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:40,925 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:40,925 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration11_Loop [2025-04-26 18:42:40,925 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:40,925 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:40,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,939 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:40,939 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:40,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,942 INFO L229 MonitoredProcess]: Starting monitored process 55 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:42:40,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 18:42:40,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:40,944 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:40,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:40,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,964 INFO L229 MonitoredProcess]: Starting monitored process 56 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:42:40,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 18:42:40,968 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:40,968 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:41,058 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:41,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,063 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:41,063 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:41,063 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:41,063 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:41,063 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:41,063 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,064 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:41,064 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:41,064 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration11_Loop [2025-04-26 18:42:41,064 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:41,064 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:41,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:41,076 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:41,077 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:41,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,079 INFO L229 MonitoredProcess]: Starting monitored process 57 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:42:41,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-04-26 18:42:41,080 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:42:41,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:41,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:41,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:41,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:41,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:41,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:41,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:41,092 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:41,095 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:41,095 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:41,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,097 INFO L229 MonitoredProcess]: Starting monitored process 58 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:42:41,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-04-26 18:42:41,098 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:41,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,101 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:41,101 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:41,101 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, x1) = 1*x2 - 1*x1 Supporting invariants [] [2025-04-26 18:42:41,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-04-26 18:42:41,111 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:41,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:42:41,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:42:41,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,152 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,170 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:42:41,170 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:42:41,170 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 552 states and 1344 transitions. cyclomatic complexity: 853 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:42:41,198 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 552 states and 1344 transitions. cyclomatic complexity: 853. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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 931 states and 2376 transitions. Complement of second has 7 states. [2025-04-26 18:42:41,198 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:42:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:42:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2025-04-26 18:42:41,199 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 18:42:41,199 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,199 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 17 letters. Loop has 2 letters. [2025-04-26 18:42:41,199 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,199 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 18:42:41,199 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 931 states and 2376 transitions. [2025-04-26 18:42:41,204 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 18:42:41,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 931 states to 846 states and 2138 transitions. [2025-04-26 18:42:41,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2025-04-26 18:42:41,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2025-04-26 18:42:41,208 INFO L74 IsDeterministic]: Start isDeterministic. Operand 846 states and 2138 transitions. [2025-04-26 18:42:41,208 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:41,208 INFO L218 hiAutomatonCegarLoop]: Abstraction has 846 states and 2138 transitions. [2025-04-26 18:42:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states and 2138 transitions. [2025-04-26 18:42:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 726. [2025-04-26 18:42:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 726 states have (on average 2.568870523415978) internal successors, (in total 1865), 725 states have internal predecessors, (1865), 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:42:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1865 transitions. [2025-04-26 18:42:41,219 INFO L240 hiAutomatonCegarLoop]: Abstraction has 726 states and 1865 transitions. [2025-04-26 18:42:41,219 INFO L438 stractBuchiCegarLoop]: Abstraction has 726 states and 1865 transitions. [2025-04-26 18:42:41,219 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 18:42:41,219 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 726 states and 1865 transitions. [2025-04-26 18:42:41,221 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 18:42:41,221 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:41,221 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:41,221 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:41,221 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:41,222 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[79] L29-2-->thread1FINAL: Formula: (< v_x_4 v_y1_4) InVars {y1=v_y1_4, x=v_x_4} OutVars{y1=v_y1_4, x=v_x_4} AuxVars[] AssignedVars[]" "[81] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[85] $Ultimate##0-->L49: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[87] L49-->L53-2: Formula: (= (+ v_t_2 1) 0) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[92] L53-->L59: Formula: (< v_b_4 1) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[107] L16-->L67: 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]" "[108] thread1EXIT-->L18: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" "[94] L59-->L53-2: Formula: (= v_x1_6 (+ v_x1_5 v_t_4)) InVars {x1=v_x1_6, t=v_t_4} OutVars{x1=v_x1_5, t=v_t_4} AuxVars[] AssignedVars[x1]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[92] L53-->L59: Formula: (< v_b_4 1) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[94] L59-->L53-2: Formula: (= v_x1_6 (+ v_x1_5 v_t_4)) InVars {x1=v_x1_6, t=v_t_4} OutVars{x1=v_x1_5, t=v_t_4} AuxVars[] AssignedVars[x1]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[92] L53-->L59: Formula: (< v_b_4 1) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" [2025-04-26 18:42:41,222 INFO L754 eck$LassoCheckResult]: Loop: "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" "[98] L69-->L67: Formula: (= v_x2_3 (+ v_x2_2 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:41,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,222 INFO L85 PathProgramCache]: Analyzing trace with hash 682746242, now seen corresponding path program 1 times [2025-04-26 18:42:41,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,222 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909364882] [2025-04-26 18:42:41,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:41,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:42:41,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:42:41,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,225 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:42:41,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:42:41,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,228 INFO L85 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 7 times [2025-04-26 18:42:41,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056095861] [2025-04-26 18:42:41,228 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 18:42:41,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,230 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1010854652, now seen corresponding path program 1 times [2025-04-26 18:42:41,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,231 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207574898] [2025-04-26 18:42:41,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:41,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:42:41,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:42:41,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,234 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:42:41,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:42:41,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,248 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:41,248 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:41,248 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:41,248 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:41,248 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:41,248 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,248 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:41,248 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:41,248 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration12_Loop [2025-04-26 18:42:41,248 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:41,248 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:41,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:41,261 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:41,262 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:41,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,264 INFO L229 MonitoredProcess]: Starting monitored process 59 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:42:41,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-04-26 18:42:41,266 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:41,267 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:41,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,287 INFO L229 MonitoredProcess]: Starting monitored process 60 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:42:41,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-04-26 18:42:41,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:41,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:41,366 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:41,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,371 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:41,371 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:41,371 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:41,371 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:41,372 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:41,372 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,372 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:41,372 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:41,372 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration12_Loop [2025-04-26 18:42:41,372 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:41,372 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:41,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:41,384 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:41,385 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:41,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,386 INFO L229 MonitoredProcess]: Starting monitored process 61 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:42:41,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 18:42:41,390 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:42:41,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:41,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:41,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:41,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:41,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:41,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:41,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:41,402 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:41,406 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:41,406 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:41,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,408 INFO L229 MonitoredProcess]: Starting monitored process 62 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:42:41,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-04-26 18:42:41,410 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:41,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,413 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:41,413 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:41,413 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, x1) = 1*x2 - 1*x1 Supporting invariants [] [2025-04-26 18:42:41,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,419 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:41,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:42:41,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:42:41,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,453 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,464 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:42:41,465 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:42:41,465 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 726 states and 1865 transitions. cyclomatic complexity: 1254 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:41,490 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 726 states and 1865 transitions. cyclomatic complexity: 1254. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 804 states and 2022 transitions. Complement of second has 7 states. [2025-04-26 18:42:41,490 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:42:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2025-04-26 18:42:41,491 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 17 letters. Loop has 2 letters. [2025-04-26 18:42:41,491 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,491 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:42:41,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:42:41,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:42:41,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,530 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,537 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:42:41,538 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:41,538 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 726 states and 1865 transitions. cyclomatic complexity: 1254 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:41,558 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 726 states and 1865 transitions. cyclomatic complexity: 1254. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 804 states and 2022 transitions. Complement of second has 7 states. [2025-04-26 18:42:41,558 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:42:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2025-04-26 18:42:41,558 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 17 letters. Loop has 2 letters. [2025-04-26 18:42:41,558 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,558 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:42:41,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:42:41,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:42:41,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,601 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,614 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:42:41,614 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:41,615 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 726 states and 1865 transitions. cyclomatic complexity: 1254 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:41,644 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 726 states and 1865 transitions. cyclomatic complexity: 1254. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 953 states and 2341 transitions. Complement of second has 6 states. [2025-04-26 18:42:41,645 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:42:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2025-04-26 18:42:41,645 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 17 letters. Loop has 2 letters. [2025-04-26 18:42:41,646 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,646 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 19 letters. Loop has 2 letters. [2025-04-26 18:42:41,646 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,646 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 17 letters. Loop has 4 letters. [2025-04-26 18:42:41,646 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 953 states and 2341 transitions. [2025-04-26 18:42:41,650 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:42:41,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 953 states to 568 states and 1536 transitions. [2025-04-26 18:42:41,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2025-04-26 18:42:41,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2025-04-26 18:42:41,670 INFO L74 IsDeterministic]: Start isDeterministic. Operand 568 states and 1536 transitions. [2025-04-26 18:42:41,670 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:41,670 INFO L218 hiAutomatonCegarLoop]: Abstraction has 568 states and 1536 transitions. [2025-04-26 18:42:41,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states and 1536 transitions. [2025-04-26 18:42:41,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 493. [2025-04-26 18:42:41,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 493 states have (on average 2.870182555780933) internal successors, (in total 1415), 492 states have internal predecessors, (1415), 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:42:41,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1415 transitions. [2025-04-26 18:42:41,678 INFO L240 hiAutomatonCegarLoop]: Abstraction has 493 states and 1415 transitions. [2025-04-26 18:42:41,678 INFO L438 stractBuchiCegarLoop]: Abstraction has 493 states and 1415 transitions. [2025-04-26 18:42:41,678 INFO L340 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-04-26 18:42:41,678 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 493 states and 1415 transitions. [2025-04-26 18:42:41,679 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 18:42:41,679 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:41,679 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:41,680 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:41,680 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:41,680 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[85] $Ultimate##0-->L49: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[83] L29-->L29-2: Formula: (= v_y1_2 (+ v_tx_3 v_y1_3 1)) InVars {y1=v_y1_3, tx=v_tx_3} OutVars{y1=v_y1_2, tx=v_tx_3} AuxVars[] AssignedVars[y1]" "[87] L49-->L53-2: Formula: (= (+ v_t_2 1) 0) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[83] L29-->L29-2: Formula: (= v_y1_2 (+ v_tx_3 v_y1_3 1)) InVars {y1=v_y1_3, tx=v_tx_3} OutVars{y1=v_y1_2, tx=v_tx_3} AuxVars[] AssignedVars[y1]" "[107] L16-->L67: 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]" "[92] L53-->L59: Formula: (< v_b_4 1) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[94] L59-->L53-2: Formula: (= v_x1_6 (+ v_x1_5 v_t_4)) InVars {x1=v_x1_6, t=v_t_4} OutVars{x1=v_x1_5, t=v_t_4} AuxVars[] AssignedVars[x1]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[83] L29-->L29-2: Formula: (= v_y1_2 (+ v_tx_3 v_y1_3 1)) InVars {y1=v_y1_3, tx=v_tx_3} OutVars{y1=v_y1_2, tx=v_tx_3} AuxVars[] AssignedVars[y1]" "[92] L53-->L59: Formula: (< v_b_4 1) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[94] L59-->L53-2: Formula: (= v_x1_6 (+ v_x1_5 v_t_4)) InVars {x1=v_x1_6, t=v_t_4} OutVars{x1=v_x1_5, t=v_t_4} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:41,680 INFO L754 eck$LassoCheckResult]: Loop: "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" "[98] L69-->L67: Formula: (= v_x2_3 (+ v_x2_2 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:41,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1045296642, now seen corresponding path program 2 times [2025-04-26 18:42:41,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938846756] [2025-04-26 18:42:41,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:41,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-26 18:42:41,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:42:41,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:42:41,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,684 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:42:41,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:42:41,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 8 times [2025-04-26 18:42:41,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036598380] [2025-04-26 18:42:41,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:41,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:41,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,689 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,691 INFO L85 PathProgramCache]: Analyzing trace with hash 492277376, now seen corresponding path program 2 times [2025-04-26 18:42:41,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505021367] [2025-04-26 18:42:41,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:41,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-26 18:42:41,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:42:41,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:42:41,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:42:41,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:42:41,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,706 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:41,706 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:41,706 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:41,706 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:41,707 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:41,707 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,707 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:41,707 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:41,707 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration13_Loop [2025-04-26 18:42:41,707 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:41,707 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:41,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:41,720 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:41,720 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:41,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,722 INFO L229 MonitoredProcess]: Starting monitored process 63 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:42:41,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-04-26 18:42:41,724 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:41,724 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:41,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,746 INFO L229 MonitoredProcess]: Starting monitored process 64 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:42:41,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-04-26 18:42:41,748 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:41,748 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:41,820 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:41,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,825 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:41,825 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:41,825 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:41,825 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:41,826 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:41,826 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,826 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:41,826 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:41,826 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration13_Loop [2025-04-26 18:42:41,826 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:41,826 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:41,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:41,842 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:41,842 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:41,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,844 INFO L229 MonitoredProcess]: Starting monitored process 65 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:42:41,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-04-26 18:42:41,847 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:42:41,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:41,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:41,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:41,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:41,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:41,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:41,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:41,860 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:41,864 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:41,864 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:41,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,867 INFO L229 MonitoredProcess]: Starting monitored process 66 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:42:41,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-04-26 18:42:41,868 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:41,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,873 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:41,873 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:41,873 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = -1*x1 + 1*x2 Supporting invariants [] [2025-04-26 18:42:41,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,881 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:41,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:42:41,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:42:41,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,918 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,930 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:42:41,931 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:42:41,931 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 493 states and 1415 transitions. cyclomatic complexity: 1029 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:42:41,956 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 493 states and 1415 transitions. cyclomatic complexity: 1029. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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 703 states and 1979 transitions. Complement of second has 7 states. [2025-04-26 18:42:41,956 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:42:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:42:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2025-04-26 18:42:41,957 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 19 letters. Loop has 2 letters. [2025-04-26 18:42:41,957 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,957 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:42:41,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:42:41,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:42:41,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,996 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:42,006 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:42:42,007 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:42,007 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 493 states and 1415 transitions. cyclomatic complexity: 1029 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:42:42,029 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 493 states and 1415 transitions. cyclomatic complexity: 1029. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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 703 states and 1979 transitions. Complement of second has 7 states. [2025-04-26 18:42:42,029 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:42:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:42:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2025-04-26 18:42:42,030 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 19 letters. Loop has 2 letters. [2025-04-26 18:42:42,030 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,030 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:42:42,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:42:42,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:42:42,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:42,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:42,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:42,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:42,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:42,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:42,066 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:42,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:42,075 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:42:42,076 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:42,076 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 493 states and 1415 transitions. cyclomatic complexity: 1029 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:42:42,099 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 493 states and 1415 transitions. cyclomatic complexity: 1029. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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 670 states and 1928 transitions. Complement of second has 6 states. [2025-04-26 18:42:42,099 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:42:42,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:42:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-26 18:42:42,099 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 19 letters. Loop has 2 letters. [2025-04-26 18:42:42,100 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,100 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 21 letters. Loop has 2 letters. [2025-04-26 18:42:42,100 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,100 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 18:42:42,100 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 670 states and 1928 transitions. [2025-04-26 18:42:42,102 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 18:42:42,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 670 states to 321 states and 922 transitions. [2025-04-26 18:42:42,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-04-26 18:42:42,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-04-26 18:42:42,104 INFO L74 IsDeterministic]: Start isDeterministic. Operand 321 states and 922 transitions. [2025-04-26 18:42:42,104 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:42,104 INFO L218 hiAutomatonCegarLoop]: Abstraction has 321 states and 922 transitions. [2025-04-26 18:42:42,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states and 922 transitions. [2025-04-26 18:42:42,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2025-04-26 18:42:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 321 states have (on average 2.872274143302181) internal successors, (in total 922), 320 states have internal predecessors, (922), 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:42:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 922 transitions. [2025-04-26 18:42:42,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 321 states and 922 transitions. [2025-04-26 18:42:42,109 INFO L438 stractBuchiCegarLoop]: Abstraction has 321 states and 922 transitions. [2025-04-26 18:42:42,109 INFO L340 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-04-26 18:42:42,110 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 321 states and 922 transitions. [2025-04-26 18:42:42,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 18:42:42,110 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:42,110 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:42,111 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:42,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:42,111 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[84] $Ultimate##0-->L45: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[83] L29-->L29-2: Formula: (= v_y1_2 (+ v_tx_3 v_y1_3 1)) InVars {y1=v_y1_3, tx=v_tx_3} OutVars{y1=v_y1_2, tx=v_tx_3} AuxVars[] AssignedVars[y1]" "[86] L45-->L53-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[83] L29-->L29-2: Formula: (= v_y1_2 (+ v_tx_3 v_y1_3 1)) InVars {y1=v_y1_3, tx=v_tx_3} OutVars{y1=v_y1_2, tx=v_tx_3} AuxVars[] AssignedVars[y1]" "[91] L53-->L55: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[93] L55-->L53-2: Formula: (= (+ v_x1_4 v_t_3) v_x1_3) InVars {x1=v_x1_4, t=v_t_3} OutVars{x1=v_x1_3, t=v_t_3} AuxVars[] AssignedVars[x1]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[83] L29-->L29-2: Formula: (= v_y1_2 (+ v_tx_3 v_y1_3 1)) InVars {y1=v_y1_3, tx=v_tx_3} OutVars{y1=v_y1_2, tx=v_tx_3} AuxVars[] AssignedVars[y1]" "[107] L16-->L67: 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]" "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" "[91] L53-->L55: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[93] L55-->L53-2: Formula: (= (+ v_x1_4 v_t_3) v_x1_3) InVars {x1=v_x1_4, t=v_t_3} OutVars{x1=v_x1_3, t=v_t_3} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:42,111 INFO L754 eck$LassoCheckResult]: Loop: "[98] L69-->L67: Formula: (= v_x2_3 (+ v_x2_2 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" [2025-04-26 18:42:42,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1369800410, now seen corresponding path program 2 times [2025-04-26 18:42:42,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:42,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820082274] [2025-04-26 18:42:42,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:42,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:42,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-26 18:42:42,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:42:42,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:42:42,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,115 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:42,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:42:42,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:42:42,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:42,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,118 INFO L85 PathProgramCache]: Analyzing trace with hash 4095, now seen corresponding path program 9 times [2025-04-26 18:42:42,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:42,118 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637073417] [2025-04-26 18:42:42,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:42:42,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:42,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:42,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:42,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:42:42,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,120 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:42,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:42,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:42,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:42,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2118198300, now seen corresponding path program 3 times [2025-04-26 18:42:42,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:42,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176674223] [2025-04-26 18:42:42,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:42:42,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:42,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-26 18:42:42,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 18:42:42,125 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 18:42:42,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,125 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:42,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 18:42:42,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 18:42:42,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:42,138 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:42,139 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:42,139 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:42,139 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:42,139 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:42,139 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,139 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:42,139 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:42,139 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration14_Loop [2025-04-26 18:42:42,139 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:42,139 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:42,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:42,154 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:42,154 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:42,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:42,157 INFO L229 MonitoredProcess]: Starting monitored process 67 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:42:42,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-04-26 18:42:42,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:42,159 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:42,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-04-26 18:42:42,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:42,177 INFO L229 MonitoredProcess]: Starting monitored process 68 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:42:42,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-04-26 18:42:42,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:42,178 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:42,258 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:42,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-04-26 18:42:42,263 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:42,263 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:42,263 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:42,264 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:42,264 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:42,264 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,264 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:42,264 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:42,264 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration14_Loop [2025-04-26 18:42:42,264 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:42,264 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:42,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:42,283 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:42,284 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:42,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:42,288 INFO L229 MonitoredProcess]: Starting monitored process 69 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:42:42,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-04-26 18:42:42,290 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:42:42,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:42,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:42,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:42,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:42,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:42,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:42,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:42,304 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:42,306 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:42,306 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:42,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:42,308 INFO L229 MonitoredProcess]: Starting monitored process 70 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:42:42,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-04-26 18:42:42,309 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:42,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-04-26 18:42:42,312 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:42,312 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:42,312 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = -1*x1 + 1*x2 Supporting invariants [] [2025-04-26 18:42:42,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-04-26 18:42:42,318 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:42,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:42:42,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:42:42,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:42,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:42,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:42,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:42,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:42,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:42,356 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:42,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:42,363 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:42:42,364 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:42:42,364 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 922 transitions. cyclomatic complexity: 676 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:42,385 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 321 states and 922 transitions. cyclomatic complexity: 676. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 534 states and 1485 transitions. Complement of second has 7 states. [2025-04-26 18:42:42,385 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:42:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2025-04-26 18:42:42,385 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 20 letters. Loop has 2 letters. [2025-04-26 18:42:42,385 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,385 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:42:42,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:42:42,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:42:42,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:42,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:42,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:42,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:42,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:42,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:42,420 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:42,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:42,427 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:42:42,427 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:42,427 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 922 transitions. cyclomatic complexity: 676 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:42,452 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 321 states and 922 transitions. cyclomatic complexity: 676. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 534 states and 1485 transitions. Complement of second has 7 states. [2025-04-26 18:42:42,453 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:42:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2025-04-26 18:42:42,453 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 20 letters. Loop has 2 letters. [2025-04-26 18:42:42,453 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,454 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:42:42,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:42:42,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:42:42,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:42,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:42,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:42,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:42,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:42,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:42,502 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:42,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:42,509 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:42:42,509 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:42,509 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 321 states and 922 transitions. cyclomatic complexity: 676 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:42,537 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 321 states and 922 transitions. cyclomatic complexity: 676. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 634 states and 1828 transitions. Complement of second has 6 states. [2025-04-26 18:42:42,538 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:42:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:42:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2025-04-26 18:42:42,538 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 20 letters. Loop has 2 letters. [2025-04-26 18:42:42,538 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,538 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 22 letters. Loop has 2 letters. [2025-04-26 18:42:42,538 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,538 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 20 letters. Loop has 4 letters. [2025-04-26 18:42:42,538 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 634 states and 1828 transitions. [2025-04-26 18:42:42,541 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:42,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 634 states to 0 states and 0 transitions. [2025-04-26 18:42:42,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:42,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:42,542 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:42,542 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:42,542 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:42,542 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:42,542 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:42,542 INFO L340 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-04-26 18:42:42,542 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:42,542 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:42,542 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:42,553 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:42:42,554 INFO L201 PluginConnector]: Adding new model mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:42 BoogieIcfgContainer [2025-04-26 18:42:42,554 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:42,555 INFO L158 Benchmark]: Toolchain (without parser) took 6997.53ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 86.3MB in the beginning and 157.6MB in the end (delta: -71.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:42,555 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:42,555 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.38ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:42,555 INFO L158 Benchmark]: Boogie Preprocessor took 18.10ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.4MB in the end (delta: 973.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:42,555 INFO L158 Benchmark]: RCFGBuilder took 161.57ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 74.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:42:42,556 INFO L158 Benchmark]: BuchiAutomizer took 6780.87ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 74.0MB in the beginning and 157.6MB in the end (delta: -83.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:42,557 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.18ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.38ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 18.10ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.4MB in the end (delta: 973.2kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 161.57ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 74.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 6780.87ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 74.0MB in the beginning and 157.6MB in the end (delta: -83.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 4.0s. Construction of modules took 0.3s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 13. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 1705 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 5, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 827 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 808 mSDsluCounter, 1054 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 393 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 586 IncrementalHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 661 mSDtfsCounter, 586 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT9 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf100 lsp87 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf94 smp100 dnf100 smp100 tf108 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 75ms VariablesStem: 1 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 12 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.5s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 196, Number of transitions in reduction automaton: 409, Number of states in reduction automaton: 183, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (2 trivial, 7 deterministic, 5 nondeterministic). One deterministic module has affine ranking function 2 * x + 1 + -2 * y1 and consists of 4 locations. One deterministic module has affine ranking function 2 * n + -2 * x1 + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * n + -2 * x1 + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + x2 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * x1 + x2 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * x1 + x2 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * x1 + x2 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * x1 + x2 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * x1 + x2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:42,571 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...