/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/2_thr/clock2-buggy.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:10,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:10,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:10,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:10,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:10,548 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:10,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:10,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:10,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:10,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:10,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:10,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:10,571 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:10,571 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:10,571 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:10,571 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:10,571 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:10,571 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:10,571 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:10,571 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:10,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:10,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:10,572 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:10,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:10,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:10,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:10,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:10,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:10,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:10,572 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:10,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:10,572 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:10,572 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:10,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:10,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:10,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:10,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:10,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:10,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:10,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:10,573 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:10,573 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:10,573 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:10,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:10,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:10,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:10,823 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:10,823 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:10,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/clock2-buggy.c.bpl [2025-04-26 18:42:10,825 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/clock2-buggy.c.bpl' [2025-04-26 18:42:10,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:10,841 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:10,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:10,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:10,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:10,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:10" (1/1) ... [2025-04-26 18:42:10,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:10" (1/1) ... [2025-04-26 18:42:10,876 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:10,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:10,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:10,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:10,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:10,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:10" (1/1) ... [2025-04-26 18:42:10,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:10" (1/1) ... [2025-04-26 18:42:10,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:10" (1/1) ... [2025-04-26 18:42:10,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:10" (1/1) ... [2025-04-26 18:42:10,889 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:10" (1/1) ... [2025-04-26 18:42:10,890 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:10" (1/1) ... [2025-04-26 18:42:10,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:10" (1/1) ... [2025-04-26 18:42:10,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:10" (1/1) ... [2025-04-26 18:42:10,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:10" (1/1) ... [2025-04-26 18:42:10,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:10,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:10,904 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:10,906 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:10,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:10" (1/1) ... [2025-04-26 18:42:10,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:10,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:10,930 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:10,935 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:10,952 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:10,952 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:10,953 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:10,953 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:10,953 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:10,953 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:10,953 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:10,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:10,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:10,953 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:10,991 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:10,992 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:11,077 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:11,078 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:11,093 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:11,093 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:11,093 INFO L201 PluginConnector]: Adding new model clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:11 BoogieIcfgContainer [2025-04-26 18:42:11,093 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:11,095 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:11,095 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:11,103 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:11,104 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:11,104 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:10" (1/2) ... [2025-04-26 18:42:11,105 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d00dae5 and model type clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:11, skipping insertion in model container [2025-04-26 18:42:11,105 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:11,105 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:11" (2/2) ... [2025-04-26 18:42:11,106 INFO L376 chiAutomizerObserver]: Analyzing ICFG clock2-buggy.c.bpl [2025-04-26 18:42:11,146 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:42:11,188 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:11,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:11,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:11,191 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:11,193 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:11,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 23 transitions, 60 flow [2025-04-26 18:42:11,258 INFO L116 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-04-26 18:42:11,261 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:42:11,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 2/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-26 18:42:11,264 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 23 transitions, 60 flow [2025-04-26 18:42:11,269 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 19 transitions, 50 flow [2025-04-26 18:42:11,269 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 24 places, 19 transitions, 50 flow [2025-04-26 18:42:11,269 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 19 transitions, 50 flow [2025-04-26 18:42:11,286 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 66 states, 65 states have (on average 1.9846153846153847) internal successors, (in total 129), 65 states have internal predecessors, (129), 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:11,288 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 66 states, 65 states have (on average 1.9846153846153847) internal successors, (in total 129), 65 states have internal predecessors, (129), 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:11,290 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:11,400 WARN L140 AmpleReduction]: Number of pruned transitions: 26 [2025-04-26 18:42:11,400 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:11,400 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3 [2025-04-26 18:42:11,400 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:37 [2025-04-26 18:42:11,400 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:24 [2025-04-26 18:42:11,400 WARN L145 AmpleReduction]: Times succ was already a loop node:11 [2025-04-26 18:42:11,400 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:4 [2025-04-26 18:42:11,400 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:11,401 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 65 states, 64 states have (on average 1.578125) internal successors, (in total 101), 64 states have internal predecessors, (101), 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:11,408 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:11,409 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:11,409 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:11,409 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:11,409 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:11,409 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:11,409 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:11,409 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:11,411 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 65 states, 64 states have (on average 1.578125) internal successors, (in total 101), 64 states have internal predecessors, (101), 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:11,424 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 54 [2025-04-26 18:42:11,424 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:11,425 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:11,428 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:11,429 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:11,429 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:11,430 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 65 states, 64 states have (on average 1.578125) internal successors, (in total 101), 64 states have internal predecessors, (101), 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:11,433 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 54 [2025-04-26 18:42:11,434 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:11,434 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:11,434 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:11,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:11,439 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:11,440 INFO L754 eck$LassoCheckResult]: Loop: "[49] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[51] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[52] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[53] L30-->L31: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[54] L31-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" [2025-04-26 18:42:11,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:11,443 INFO L85 PathProgramCache]: Analyzing trace with hash 95, now seen corresponding path program 1 times [2025-04-26 18:42:11,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:11,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840130913] [2025-04-26 18:42:11,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:11,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:11,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:11,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:11,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:11,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:11,498 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:11,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:11,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:11,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:11,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:11,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:11,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:11,514 INFO L85 PathProgramCache]: Analyzing trace with hash 75452690, now seen corresponding path program 1 times [2025-04-26 18:42:11,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:11,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093961117] [2025-04-26 18:42:11,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:11,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:11,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:11,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:11,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:11,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:11,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:11,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:11,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:11,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:11,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:11,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:11,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:11,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1528374412, now seen corresponding path program 1 times [2025-04-26 18:42:11,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:11,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371867277] [2025-04-26 18:42:11,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:11,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:11,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:11,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:11,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:11,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:11,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:11,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:11,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:11,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:11,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:11,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:11,646 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:11,647 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:11,647 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:11,647 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:11,647 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:11,647 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:11,647 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:11,647 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:11,648 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:11,648 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:11,648 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:11,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:11,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:11,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:11,786 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:11,787 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:11,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:11,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:11,790 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:11,792 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:11,793 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:11,793 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:11,814 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:11,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:11,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:11,816 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:11,818 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:11,819 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:11,819 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:11,890 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:11,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:42:11,894 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:11,894 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:11,895 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:11,895 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:11,895 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:11,895 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:11,895 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:11,895 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:11,895 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:11,895 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:11,895 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:11,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:11,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:11,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:11,971 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:11,978 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:11,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:11,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:11,981 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:11,983 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:11,985 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:11,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:11,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:11,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:11,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:11,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:12,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:12,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:12,014 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:12,023 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:12,024 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:12,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:12,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:12,031 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:12,034 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:12,035 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:12,038 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:12,038 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:12,039 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:12,039 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 18:42:12,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:12,059 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:12,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:12,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:12,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:12,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:12,141 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:12,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:12,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:12,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:12,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:12,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:12,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:12,218 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:12,241 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:42:12,243 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 65 states, 64 states have (on average 1.578125) internal successors, (in total 101), 64 states have internal predecessors, (101), 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 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:12,335 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 65 states, 64 states have (on average 1.578125) internal successors, (in total 101), 64 states have internal predecessors, (101), 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 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 176 states and 279 transitions. Complement of second has 7 states. [2025-04-26 18:42:12,336 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:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2025-04-26 18:42:12,345 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 1 letters. Loop has 5 letters. [2025-04-26 18:42:12,346 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:12,346 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 6 letters. Loop has 5 letters. [2025-04-26 18:42:12,347 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:12,347 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 1 letters. Loop has 10 letters. [2025-04-26 18:42:12,347 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:12,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 279 transitions. [2025-04-26 18:42:12,354 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 49 [2025-04-26 18:42:12,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 116 states and 191 transitions. [2025-04-26 18:42:12,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2025-04-26 18:42:12,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2025-04-26 18:42:12,365 INFO L74 IsDeterministic]: Start isDeterministic. Operand 116 states and 191 transitions. [2025-04-26 18:42:12,365 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:12,365 INFO L218 hiAutomatonCegarLoop]: Abstraction has 116 states and 191 transitions. [2025-04-26 18:42:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 191 transitions. [2025-04-26 18:42:12,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2025-04-26 18:42:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.6868686868686869) internal successors, (in total 167), 98 states have internal predecessors, (167), 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:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 167 transitions. [2025-04-26 18:42:12,393 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99 states and 167 transitions. [2025-04-26 18:42:12,393 INFO L438 stractBuchiCegarLoop]: Abstraction has 99 states and 167 transitions. [2025-04-26 18:42:12,393 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:12,394 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 167 transitions. [2025-04-26 18:42:12,397 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 49 [2025-04-26 18:42:12,397 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:12,397 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:12,398 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:42:12,398 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:12,398 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L13-->L38: 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]" "[48] L22-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" [2025-04-26 18:42:12,398 INFO L754 eck$LassoCheckResult]: Loop: "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[59] L40-1-->L46: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[60] L46-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[61] L47-->L38: Formula: (= v_l_4 1) InVars {} OutVars{l=v_l_4} AuxVars[] AssignedVars[l]" [2025-04-26 18:42:12,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:12,399 INFO L85 PathProgramCache]: Analyzing trace with hash 93420, now seen corresponding path program 1 times [2025-04-26 18:42:12,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:12,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400882850] [2025-04-26 18:42:12,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:12,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:12,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:12,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,406 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:12,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:12,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:12,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:12,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:12,412 INFO L85 PathProgramCache]: Analyzing trace with hash 82132825, now seen corresponding path program 1 times [2025-04-26 18:42:12,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:12,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543122953] [2025-04-26 18:42:12,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:12,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:12,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:12,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:12,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,419 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:12,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:12,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:12,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:12,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:12,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1175835314, now seen corresponding path program 1 times [2025-04-26 18:42:12,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:12,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493580221] [2025-04-26 18:42:12,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:12,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:12,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:12,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:12,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,434 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:12,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:12,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:12,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:12,485 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:12,485 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:12,485 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:12,485 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:12,485 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:12,485 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:12,485 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:12,485 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:12,485 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:12,485 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:12,485 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:12,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:12,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:12,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:12,532 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:12,532 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:12,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:12,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:12,535 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:12,536 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:12,537 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:12,537 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:12,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:12,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:12,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:12,557 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:12,559 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:12,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:12,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:12,585 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:12,585 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x1=0} Honda state: {x1=0} Generalized eigenvectors: [{x1=-1}, {x1=7}, {x1=-7}] Lambdas: [1, 2, 1] Nus: [0, 1] [2025-04-26 18:42:12,591 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:12,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:12,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:12,594 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:12,594 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:12,597 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:12,597 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:12,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:12,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:12,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:12,619 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:12,621 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:12,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:12,624 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:12,689 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:12,694 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:12,695 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:12,695 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:12,695 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:12,695 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:12,695 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:12,695 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:12,695 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:12,695 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:12,695 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:12,695 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:12,695 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:12,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:12,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:12,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:12,743 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:12,743 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:12,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:12,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:12,745 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:12,746 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:12,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:12,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:12,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:12,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:12,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:12,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:12,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:12,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:12,760 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:12,766 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:12,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:12,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:12,769 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:12,770 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:12,771 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:12,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:12,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:12,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:12,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:12,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:12,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:12,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:12,784 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:12,787 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:12,787 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:12,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:12,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:12,789 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:12,791 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:12,792 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:12,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:42:12,795 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:12,795 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:12,795 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 18:42:12,801 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:12,802 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:12,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:12,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:12,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:12,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:12,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:12,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:12,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:12,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:12,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:12,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:12,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:12,871 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:12,871 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:42:12,872 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 167 transitions. cyclomatic complexity: 78 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:12,908 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 167 transitions. cyclomatic complexity: 78. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 125 states and 204 transitions. Complement of second has 6 states. [2025-04-26 18:42:12,908 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:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2025-04-26 18:42:12,909 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 3 letters. Loop has 5 letters. [2025-04-26 18:42:12,909 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:12,909 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 8 letters. Loop has 5 letters. [2025-04-26 18:42:12,912 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:12,913 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 3 letters. Loop has 10 letters. [2025-04-26 18:42:12,913 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:12,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 204 transitions. [2025-04-26 18:42:12,914 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2025-04-26 18:42:12,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 82 states and 139 transitions. [2025-04-26 18:42:12,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2025-04-26 18:42:12,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-04-26 18:42:12,915 INFO L74 IsDeterministic]: Start isDeterministic. Operand 82 states and 139 transitions. [2025-04-26 18:42:12,915 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:12,915 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 139 transitions. [2025-04-26 18:42:12,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 139 transitions. [2025-04-26 18:42:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-04-26 18:42:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.6951219512195121) internal successors, (in total 139), 81 states have internal predecessors, (139), 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:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 139 transitions. [2025-04-26 18:42:12,919 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 139 transitions. [2025-04-26 18:42:12,919 INFO L438 stractBuchiCegarLoop]: Abstraction has 82 states and 139 transitions. [2025-04-26 18:42:12,919 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:12,919 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 139 transitions. [2025-04-26 18:42:12,919 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2025-04-26 18:42:12,920 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:12,920 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:12,920 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:42:12,920 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:12,922 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L13-->L38: 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]" "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[59] L40-1-->L46: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[60] L46-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:12,922 INFO L754 eck$LassoCheckResult]: Loop: "[61] L47-->L38: Formula: (= v_l_4 1) InVars {} OutVars{l=v_l_4} AuxVars[] AssignedVars[l]" "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[59] L40-1-->L46: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[60] L46-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:12,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1511596121, now seen corresponding path program 1 times [2025-04-26 18:42:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:12,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78667478] [2025-04-26 18:42:12,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:12,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:12,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:12,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:12,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:12,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:12,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:12,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:12,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:12,933 INFO L85 PathProgramCache]: Analyzing trace with hash 86689855, now seen corresponding path program 2 times [2025-04-26 18:42:12,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:12,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202865654] [2025-04-26 18:42:12,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:12,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:12,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:12,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:12,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,940 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:12,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:12,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:12,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:12,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:12,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1023688615, now seen corresponding path program 1 times [2025-04-26 18:42:12,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:12,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452251335] [2025-04-26 18:42:12,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:12,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:12,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:12,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:12,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,955 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:12,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:12,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:12,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:13,006 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:13,006 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:13,006 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:13,006 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:13,006 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:13,006 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,006 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:13,006 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:13,006 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:13,006 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:13,006 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:13,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,046 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:13,046 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:13,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,051 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:13,052 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:13,053 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:13,053 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:13,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:13,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,076 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:13,077 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:13,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:13,080 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:13,104 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:13,104 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x1=0} Honda state: {x1=0} Generalized eigenvectors: [{x1=-1}, {x1=7}, {x1=-7}] Lambdas: [1, 2, 1] Nus: [0, 1] [2025-04-26 18:42:13,110 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:13,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,112 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:13,113 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:13,114 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:13,114 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:13,125 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:13,125 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {l=0} Honda state: {l=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:13,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:42:13,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,132 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:13,134 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:13,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:13,134 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:13,151 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:13,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,153 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:13,154 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:13,157 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:13,157 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:13,221 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:13,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:42:13,226 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:13,226 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:13,226 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:13,226 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:13,226 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:13,226 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,226 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:13,226 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:13,226 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:13,226 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:13,226 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:13,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,265 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:13,265 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:13,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,267 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:13,270 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:13,271 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:13,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:13,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:13,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:13,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:13,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:13,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:13,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:13,285 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:13,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:13,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,293 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:13,294 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:13,299 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:13,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:13,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:13,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:13,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:13,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:13,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:13,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:13,311 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:13,316 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:13,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,318 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:13,319 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:13,320 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:13,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:13,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:13,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:13,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:13,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:13,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:13,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:13,333 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:13,335 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:13,335 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:13,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,337 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:13,338 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:13,342 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:13,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:42:13,346 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:13,346 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:13,346 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 18:42:13,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:42:13,353 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:13,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:13,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:13,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:13,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:13,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:13,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:13,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:13,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:13,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:13,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:13,434 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:13,435 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:42:13,435 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 139 transitions. cyclomatic complexity: 64 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (in total 11), 5 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:13,470 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 139 transitions. cyclomatic complexity: 64. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (in total 11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 162 states and 285 transitions. Complement of second has 7 states. [2025-04-26 18:42:13,470 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:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (in total 11), 5 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:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2025-04-26 18:42:13,471 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 6 letters. Loop has 5 letters. [2025-04-26 18:42:13,471 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:13,471 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 5 letters. [2025-04-26 18:42:13,472 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:13,472 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 6 letters. Loop has 10 letters. [2025-04-26 18:42:13,472 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:13,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 285 transitions. [2025-04-26 18:42:13,473 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2025-04-26 18:42:13,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 151 states and 271 transitions. [2025-04-26 18:42:13,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2025-04-26 18:42:13,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2025-04-26 18:42:13,475 INFO L74 IsDeterministic]: Start isDeterministic. Operand 151 states and 271 transitions. [2025-04-26 18:42:13,475 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:13,475 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 271 transitions. [2025-04-26 18:42:13,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 271 transitions. [2025-04-26 18:42:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 132. [2025-04-26 18:42:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 1.7954545454545454) internal successors, (in total 237), 131 states have internal predecessors, (237), 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:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 237 transitions. [2025-04-26 18:42:13,489 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 237 transitions. [2025-04-26 18:42:13,489 INFO L438 stractBuchiCegarLoop]: Abstraction has 132 states and 237 transitions. [2025-04-26 18:42:13,489 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:13,489 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 237 transitions. [2025-04-26 18:42:13,490 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2025-04-26 18:42:13,490 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:13,490 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:13,490 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:13,490 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:13,490 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L13-->L38: 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]" "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[59] L40-1-->L46: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[60] L46-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[61] L47-->L38: Formula: (= v_l_4 1) InVars {} OutVars{l=v_l_4} AuxVars[] AssignedVars[l]" "[55] L38-->thread2FINAL: Formula: (<= v_z_3 v_x2_5) InVars {x2=v_x2_5, z=v_z_3} OutVars{x2=v_x2_5, z=v_z_3} AuxVars[] AssignedVars[]" [2025-04-26 18:42:13,490 INFO L754 eck$LassoCheckResult]: Loop: "[49] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[51] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[52] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[53] L30-->L31: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[54] L31-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" [2025-04-26 18:42:13,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,491 INFO L85 PathProgramCache]: Analyzing trace with hash -944924287, now seen corresponding path program 1 times [2025-04-26 18:42:13,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:13,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339681027] [2025-04-26 18:42:13,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:13,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:13,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:13,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:13,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,496 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:13,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:13,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:13,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:13,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash 75452690, now seen corresponding path program 2 times [2025-04-26 18:42:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:13,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198006190] [2025-04-26 18:42:13,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:13,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:13,502 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:13,502 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:13,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:13,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:13,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:13,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:13,506 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,506 INFO L85 PathProgramCache]: Analyzing trace with hash -254433390, now seen corresponding path program 1 times [2025-04-26 18:42:13,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:13,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406277846] [2025-04-26 18:42:13,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:13,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:13,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:42:13,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:42:13,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:13,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:42:13,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:42:13,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:13,557 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:13,558 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:13,558 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:13,558 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:13,558 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:13,558 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,558 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:13,558 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:13,558 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:13,558 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:13,558 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:13,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,613 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:13,613 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:13,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,615 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:13,619 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:13,620 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:13,620 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:13,639 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:13,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,641 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:13,643 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:13,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:13,645 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:13,668 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:13,668 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x2=0} Honda state: {x2=0} Generalized eigenvectors: [{x2=-8}, {x2=3}, {x2=4}] Lambdas: [1, 1, 1] Nus: [0, 0] [2025-04-26 18:42:13,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:13,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,676 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:13,678 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:13,679 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:13,679 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:13,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:13,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,698 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:13,699 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:13,701 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:13,701 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:13,766 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:13,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:13,770 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:13,770 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:13,770 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:13,770 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:13,770 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:13,770 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,771 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:13,771 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:13,771 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:13,771 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:13,771 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:13,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,825 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:13,825 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:13,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,827 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:13,828 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:13,829 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:13,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:13,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:13,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:13,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:13,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:13,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:13,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:13,841 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:13,848 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:13,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,850 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:13,851 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:13,852 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:13,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:13,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:13,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:13,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:13,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:13,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:13,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:13,864 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:13,867 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:13,867 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:13,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,869 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:13,870 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:13,871 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:13,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 18:42:13,875 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:13,875 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:13,875 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 18:42:13,881 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:13,882 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:13,892 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:13,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:13,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:13,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:13,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:13,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:13,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:13,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:13,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:13,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:13,950 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:13,951 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:42:13,951 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132 states and 237 transitions. cyclomatic complexity: 116 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 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:13,975 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132 states and 237 transitions. cyclomatic complexity: 116. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 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 156 states and 268 transitions. Complement of second has 6 states. [2025-04-26 18:42:13,976 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:13,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 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:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2025-04-26 18:42:13,977 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 8 letters. Loop has 5 letters. [2025-04-26 18:42:13,977 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:13,977 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 5 letters. [2025-04-26 18:42:13,977 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:13,977 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 8 letters. Loop has 10 letters. [2025-04-26 18:42:13,978 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:13,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 268 transitions. [2025-04-26 18:42:13,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-04-26 18:42:13,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 122 states and 218 transitions. [2025-04-26 18:42:13,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2025-04-26 18:42:13,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2025-04-26 18:42:13,982 INFO L74 IsDeterministic]: Start isDeterministic. Operand 122 states and 218 transitions. [2025-04-26 18:42:13,983 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:13,983 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 218 transitions. [2025-04-26 18:42:13,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 218 transitions. [2025-04-26 18:42:13,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-04-26 18:42:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.7868852459016393) internal successors, (in total 218), 121 states have internal predecessors, (218), 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:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 218 transitions. [2025-04-26 18:42:13,989 INFO L240 hiAutomatonCegarLoop]: Abstraction has 122 states and 218 transitions. [2025-04-26 18:42:13,989 INFO L438 stractBuchiCegarLoop]: Abstraction has 122 states and 218 transitions. [2025-04-26 18:42:13,989 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:13,989 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 218 transitions. [2025-04-26 18:42:13,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-04-26 18:42:13,990 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:13,990 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:13,990 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:13,990 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:13,991 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[49] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[67] L13-->L38: 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]" "[51] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[52] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[59] L40-1-->L46: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[60] L46-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[53] L30-->L31: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:13,991 INFO L754 eck$LassoCheckResult]: Loop: "[54] L31-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" "[49] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[51] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[52] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[53] L30-->L31: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:13,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,991 INFO L85 PathProgramCache]: Analyzing trace with hash 504573184, now seen corresponding path program 1 times [2025-04-26 18:42:13,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:13,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018978696] [2025-04-26 18:42:13,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:13,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:13,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:14,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:14,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,050 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:14,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:14,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018978696] [2025-04-26 18:42:14,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018978696] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:14,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:14,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:42:14,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206284829] [2025-04-26 18:42:14,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:14,054 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:14,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,054 INFO L85 PathProgramCache]: Analyzing trace with hash 80009720, now seen corresponding path program 3 times [2025-04-26 18:42:14,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:14,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767076010] [2025-04-26 18:42:14,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:42:14,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:14,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:14,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:14,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:42:14,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:14,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:14,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:14,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:14,089 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:14,090 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:14,090 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:14,090 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:14,090 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:14,090 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,090 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:14,090 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:14,090 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:14,090 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:14,090 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:14,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,120 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:14,121 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:14,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,122 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:14,124 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:14,125 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:14,125 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:14,140 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:14,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,142 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:14,143 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:14,144 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:14,144 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:14,208 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:14,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 18:42:14,213 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:14,213 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:14,213 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:14,213 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:14,213 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:14,213 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,213 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:14,213 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:14,213 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:14,213 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:14,213 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:14,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,246 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:14,246 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:14,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,249 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:14,250 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:14,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:14,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:14,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:14,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:14,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:14,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:14,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:14,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:14,264 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:14,269 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:14,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,271 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:14,271 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:14,275 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:14,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:14,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:14,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:14,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:14,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:14,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:14,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:14,287 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:14,289 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:14,289 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:14,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,290 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:14,291 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:14,292 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:14,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:14,295 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:14,295 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:14,295 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 18:42:14,300 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:14,301 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:14,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:14,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:14,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:14,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:14,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,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:14,363 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:42:14,363 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 218 transitions. cyclomatic complexity: 105 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (in total 15), 5 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:14,398 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 218 transitions. cyclomatic complexity: 105. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (in total 15), 5 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 324 states and 590 transitions. Complement of second has 7 states. [2025-04-26 18:42:14,399 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:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (in total 15), 5 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:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-04-26 18:42:14,399 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 10 letters. Loop has 5 letters. [2025-04-26 18:42:14,399 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,399 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 15 letters. Loop has 5 letters. [2025-04-26 18:42:14,400 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,400 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 10 letters. Loop has 10 letters. [2025-04-26 18:42:14,400 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 324 states and 590 transitions. [2025-04-26 18:42:14,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-04-26 18:42:14,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 324 states to 273 states and 494 transitions. [2025-04-26 18:42:14,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2025-04-26 18:42:14,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2025-04-26 18:42:14,408 INFO L74 IsDeterministic]: Start isDeterministic. Operand 273 states and 494 transitions. [2025-04-26 18:42:14,408 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:14,408 INFO L218 hiAutomatonCegarLoop]: Abstraction has 273 states and 494 transitions. [2025-04-26 18:42:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states and 494 transitions. [2025-04-26 18:42:14,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 243. [2025-04-26 18:42:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 243 states have (on average 1.8106995884773662) internal successors, (in total 440), 242 states have internal predecessors, (440), 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:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 440 transitions. [2025-04-26 18:42:14,415 INFO L240 hiAutomatonCegarLoop]: Abstraction has 243 states and 440 transitions. [2025-04-26 18:42:14,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:14,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:14,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:14,416 INFO L87 Difference]: Start difference. First operand 243 states and 440 transitions. 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:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:14,437 INFO L93 Difference]: Finished difference Result 164 states and 260 transitions. [2025-04-26 18:42:14,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 260 transitions. [2025-04-26 18:42:14,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2025-04-26 18:42:14,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 144 states and 235 transitions. [2025-04-26 18:42:14,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2025-04-26 18:42:14,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2025-04-26 18:42:14,441 INFO L74 IsDeterministic]: Start isDeterministic. Operand 144 states and 235 transitions. [2025-04-26 18:42:14,441 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:14,441 INFO L218 hiAutomatonCegarLoop]: Abstraction has 144 states and 235 transitions. [2025-04-26 18:42:14,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 235 transitions. [2025-04-26 18:42:14,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 123. [2025-04-26 18:42:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.6341463414634145) internal successors, (in total 201), 122 states have internal predecessors, (201), 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:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 201 transitions. [2025-04-26 18:42:14,444 INFO L240 hiAutomatonCegarLoop]: Abstraction has 123 states and 201 transitions. [2025-04-26 18:42:14,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:14,445 INFO L438 stractBuchiCegarLoop]: Abstraction has 123 states and 201 transitions. [2025-04-26 18:42:14,445 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:42:14,445 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 201 transitions. [2025-04-26 18:42:14,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2025-04-26 18:42:14,446 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:14,446 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:14,450 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:14,450 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:14,451 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[49] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[67] L13-->L38: 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]" "[51] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[52] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[53] L30-->L31: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[54] L31-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" "[49] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[59] L40-1-->L46: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[60] L46-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[61] L47-->L38: Formula: (= v_l_4 1) InVars {} OutVars{l=v_l_4} AuxVars[] AssignedVars[l]" "[51] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" [2025-04-26 18:42:14,451 INFO L754 eck$LassoCheckResult]: Loop: "[52] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[53] L30-->L31: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[54] L31-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" "[49] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[51] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" [2025-04-26 18:42:14,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,451 INFO L85 PathProgramCache]: Analyzing trace with hash -487380553, now seen corresponding path program 1 times [2025-04-26 18:42:14,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:14,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444932676] [2025-04-26 18:42:14,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:14,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:14,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:14,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:14,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,457 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:14,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:14,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:14,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:14,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,463 INFO L85 PathProgramCache]: Analyzing trace with hash 78284630, now seen corresponding path program 4 times [2025-04-26 18:42:14,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:14,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853166043] [2025-04-26 18:42:14,464 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:42:14,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:14,466 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-04-26 18:42:14,467 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:14,467 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:42:14,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:14,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:14,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:14,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:14,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,470 INFO L85 PathProgramCache]: Analyzing trace with hash 786104160, now seen corresponding path program 2 times [2025-04-26 18:42:14,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:14,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001860486] [2025-04-26 18:42:14,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:14,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:14,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-26 18:42:14,474 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:14,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:42:14,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,474 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:14,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:42:14,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:42:14,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:14,519 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:14,519 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:14,519 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:14,519 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:14,519 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:14,519 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,519 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:14,519 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:14,519 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:42:14,519 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:14,519 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:14,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,552 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:14,552 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:14,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,554 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:14,555 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:14,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:14,556 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:14,572 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:14,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,574 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:14,575 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:14,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:14,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:14,599 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:14,599 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x2=0} Honda state: {x2=0} Generalized eigenvectors: [{x2=-8}, {x2=3}, {x2=4}] Lambdas: [1, 1, 1] Nus: [0, 0] [2025-04-26 18:42:14,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 18:42:14,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,606 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:14,607 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:14,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:14,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:14,618 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:14,618 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {l=0} Honda state: {l=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:14,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 18:42:14,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,625 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:14,626 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:14,627 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:14,627 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:14,643 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:14,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,644 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:14,645 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:14,646 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:14,646 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:14,727 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:14,731 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:14,731 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:14,731 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:14,731 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:14,732 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:14,732 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:14,732 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,732 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:14,732 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:14,732 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:42:14,732 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:14,732 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:14,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,760 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:14,760 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:14,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,761 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:14,762 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:14,763 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:14,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:14,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:14,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:14,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:14,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:14,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:14,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:14,775 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:14,780 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:14,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,781 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:14,782 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:14,783 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:14,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:14,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:14,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:14,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:14,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:14,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:14,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:14,794 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:14,799 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:14,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,801 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:14,802 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:14,802 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:14,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:14,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:14,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:14,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:14,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:14,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:14,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:14,814 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:14,816 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:14,816 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:14,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,818 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:14,818 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:14,819 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:14,821 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:14,822 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:14,822 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:14,822 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 18:42:14,827 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:14,827 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:14,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:14,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:14,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:14,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:14,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,887 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:14,887 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:42:14,887 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 123 states and 201 transitions. cyclomatic complexity: 88 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (in total 18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:14,918 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 123 states and 201 transitions. cyclomatic complexity: 88. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (in total 18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 277 states and 438 transitions. Complement of second has 7 states. [2025-04-26 18:42:14,919 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:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (in total 18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2025-04-26 18:42:14,920 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 14 letters. Loop has 5 letters. [2025-04-26 18:42:14,920 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,920 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:42:14,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:14,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:14,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:14,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:14,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,975 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:14,975 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:42:14,975 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 123 states and 201 transitions. cyclomatic complexity: 88 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (in total 18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:15,024 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 123 states and 201 transitions. cyclomatic complexity: 88. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (in total 18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 267 states and 426 transitions. Complement of second has 9 states. [2025-04-26 18:42:15,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (in total 18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:15,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2025-04-26 18:42:15,025 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 14 letters. Loop has 5 letters. [2025-04-26 18:42:15,025 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:15,025 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 19 letters. Loop has 5 letters. [2025-04-26 18:42:15,026 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:15,026 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 14 letters. Loop has 10 letters. [2025-04-26 18:42:15,026 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:15,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 426 transitions. [2025-04-26 18:42:15,027 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2025-04-26 18:42:15,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 234 states and 373 transitions. [2025-04-26 18:42:15,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2025-04-26 18:42:15,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2025-04-26 18:42:15,033 INFO L74 IsDeterministic]: Start isDeterministic. Operand 234 states and 373 transitions. [2025-04-26 18:42:15,033 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:15,033 INFO L218 hiAutomatonCegarLoop]: Abstraction has 234 states and 373 transitions. [2025-04-26 18:42:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states and 373 transitions. [2025-04-26 18:42:15,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 178. [2025-04-26 18:42:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 178 states have (on average 1.6404494382022472) internal successors, (in total 292), 177 states have internal predecessors, (292), 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:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 292 transitions. [2025-04-26 18:42:15,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 178 states and 292 transitions. [2025-04-26 18:42:15,040 INFO L438 stractBuchiCegarLoop]: Abstraction has 178 states and 292 transitions. [2025-04-26 18:42:15,040 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:42:15,040 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 292 transitions. [2025-04-26 18:42:15,041 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2025-04-26 18:42:15,041 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:15,041 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:15,044 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:15,044 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:15,045 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[49] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[67] L13-->L38: 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]" "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[59] L40-1-->L46: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[60] L46-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[61] L47-->L38: Formula: (= v_l_4 1) InVars {} OutVars{l=v_l_4} AuxVars[] AssignedVars[l]" "[51] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[52] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:15,046 INFO L754 eck$LassoCheckResult]: Loop: "[53] L30-->L31: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[54] L31-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[49] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[59] L40-1-->L46: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[60] L46-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[61] L47-->L38: Formula: (= v_l_4 1) InVars {} OutVars{l=v_l_4} AuxVars[] AssignedVars[l]" "[51] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[52] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:15,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:15,046 INFO L85 PathProgramCache]: Analyzing trace with hash 821730986, now seen corresponding path program 1 times [2025-04-26 18:42:15,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:15,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220755451] [2025-04-26 18:42:15,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:15,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:15,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:15,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:15,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:15,052 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:15,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:15,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:15,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:15,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:15,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:15,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1372561154, now seen corresponding path program 1 times [2025-04-26 18:42:15,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:15,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532352139] [2025-04-26 18:42:15,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:15,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:15,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:15,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:15,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:15,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:15,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:15,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:15,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:15,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:15,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:15,069 INFO L85 PathProgramCache]: Analyzing trace with hash -537427865, now seen corresponding path program 3 times [2025-04-26 18:42:15,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:15,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132234803] [2025-04-26 18:42:15,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:42:15,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:15,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-26 18:42:15,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:42:15,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 18:42:15,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:15,081 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:15,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:42:15,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:42:15,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:15,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:15,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:15,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:15,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:15,209 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:15,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:15,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:15,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:15,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:15,238 INFO L201 PluginConnector]: Adding new model clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:15 BoogieIcfgContainer [2025-04-26 18:42:15,238 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:15,240 INFO L158 Benchmark]: Toolchain (without parser) took 4397.80ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 88.4MB in the beginning and 40.0MB in the end (delta: 48.4MB). Peak memory consumption was 16.1MB. Max. memory is 8.0GB. [2025-04-26 18:42:15,240 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.65ms. Allocated memory is still 159.4MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:15,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.41ms. Allocated memory is still 159.4MB. Free memory was 88.4MB in the beginning and 86.5MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:15,240 INFO L158 Benchmark]: Boogie Preprocessor took 26.57ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 85.5MB in the end (delta: 985.5kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:15,241 INFO L158 Benchmark]: RCFGBuilder took 189.06ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 75.7MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:42:15,241 INFO L158 Benchmark]: BuchiAutomizer took 4142.78ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 75.6MB in the beginning and 40.0MB in the end (delta: 35.6MB). Peak memory consumption was 3.5MB. Max. memory is 8.0GB. [2025-04-26 18:42:15,241 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.65ms. Allocated memory is still 159.4MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.41ms. Allocated memory is still 159.4MB. Free memory was 88.4MB in the beginning and 86.5MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.57ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 85.5MB in the end (delta: 985.5kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 189.06ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 75.7MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 4142.78ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 75.6MB in the beginning and 40.0MB in the end (delta: 35.6MB). Peak memory consumption was 3.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 143 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 152 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 198 IncrementalHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 90 mSDtfsCounter, 198 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf100 lsp56 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 59ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 4 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 218, Number of transitions in reduction automaton: 101, Number of states in reduction automaton: 65, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (1 trivial, 6 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 178 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 30]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L13] FORK 0 fork 1 thread1(); [L22] COND TRUE 1 x1 < z VAL [x1=-1, z=0] [L14] FORK 0 fork 2, 2 thread2(); VAL [x1=-1, z=0] [L38] COND TRUE 2 x2 < z VAL [x1=-1, x2=-1, z=0] [L42] 2 assume l > 0; [L43] 2 l := 0; VAL [l=0, x1=-1, x2=-1, z=0] [L45] 2 x2 := x2 + 1; VAL [l=0, x1=-1, x2=0, z=0] [L46] 2 x1 := x1 - 1; VAL [l=0, x1=-2, x2=0, z=0] [L47] 2 l := 1; VAL [l=1, x1=-2, x2=0, z=0] [L26] 1 assume l > 0; [L27] 1 l := 0; VAL [l=0, x1=-2, x2=0, z=0] [L29] 1 x1 := x1 + 1; VAL [l=0, x1=-1, x2=0, z=0] Loop: [L30] x2 := x2 - 1; [L31] l := 1; [L38] COND TRUE x2 < z [L22] COND TRUE x1 < z [L42] assume l > 0; [L43] l := 0; [L45] x2 := x2 + 1; [L46] x1 := x1 - 1; [L47] l := 1; [L26] assume l > 0; [L27] l := 0; [L29] x1 := x1 + 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 30]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L13] FORK 0 fork 1 thread1(); [L22] COND TRUE 1 x1 < z VAL [x1=-1, z=0] [L14] FORK 0 fork 2, 2 thread2(); VAL [x1=-1, z=0] [L38] COND TRUE 2 x2 < z VAL [x1=-1, x2=-1, z=0] [L42] 2 assume l > 0; [L43] 2 l := 0; VAL [l=0, x1=-1, x2=-1, z=0] [L45] 2 x2 := x2 + 1; VAL [l=0, x1=-1, x2=0, z=0] [L46] 2 x1 := x1 - 1; VAL [l=0, x1=-2, x2=0, z=0] [L47] 2 l := 1; VAL [l=1, x1=-2, x2=0, z=0] [L26] 1 assume l > 0; [L27] 1 l := 0; VAL [l=0, x1=-2, x2=0, z=0] [L29] 1 x1 := x1 + 1; VAL [l=0, x1=-1, x2=0, z=0] Loop: [L30] x2 := x2 - 1; [L31] l := 1; [L38] COND TRUE x2 < z [L22] COND TRUE x1 < z [L42] assume l > 0; [L43] l := 0; [L45] x2 := x2 + 1; [L46] x1 := x1 - 1; [L47] l := 1; [L26] assume l > 0; [L27] l := 0; [L29] x1 := x1 + 1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:42:15,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...