/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf --buchiautomizer.automaton.type.for.concurrent.programs PARTIAL_ORDER_BA -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-601be74-m [2025-02-17 22:48:43,066 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:48:43,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:48:43,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:48:43,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:48:43,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:48:43,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:48:43,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:48:43,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:48:43,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:48:43,141 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:48:43,141 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:48:43,141 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:48:43,141 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:48:43,141 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:48:43,141 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:48:43,141 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:48:43,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:48:43,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:48:43,142 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:48:43,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:48:43,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:48:43,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:48:43,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:48:43,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:48:43,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:48:43,142 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:48:43,142 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:48:43,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:48:43,142 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:48:43,142 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:48:43,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:48:43,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:48:43,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:48:43,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:48:43,143 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:48:43,143 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> PARTIAL_ORDER_BA [2025-02-17 22:48:43,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:48:43,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:48:43,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:48:43,363 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:48:43,363 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:48:43,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/clock2-buggy.c.bpl [2025-02-17 22:48:43,364 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/clock2-buggy.c.bpl' [2025-02-17 22:48:43,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:48:43,376 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:48:43,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:43,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:48:43,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:48:43,383 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 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,387 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 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,391 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:48:43,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:43,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:48:43,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:48:43,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:48:43,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,399 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,400 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:48:43,405 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:48:43,405 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:48:43,405 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:48:43,406 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:43,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:43,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:43,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-17 22:48:43,452 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:48:43,452 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:48:43,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:48:43,452 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:48:43,452 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:48:43,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:48:43,452 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:48:43,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:48:43,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:48:43,453 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:48:43,486 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:48:43,487 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:48:43,577 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:48:43,577 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:48:43,597 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:48:43,597 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:48:43,598 INFO L201 PluginConnector]: Adding new model clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:43 BoogieIcfgContainer [2025-02-17 22:48:43,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:48:43,598 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:48:43,599 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:48:43,603 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:48:43,603 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:43,603 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/2) ... [2025-02-17 22:48:43,604 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22f35465 and model type clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:48:43, skipping insertion in model container [2025-02-17 22:48:43,605 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:43,605 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:43" (2/2) ... [2025-02-17 22:48:43,606 INFO L363 chiAutomizerObserver]: Analyzing ICFG clock2-buggy.c.bpl [2025-02-17 22:48:43,660 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:48:43,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 23 transitions, 60 flow [2025-02-17 22:48:43,728 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-02-17 22:48:43,729 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:48:43,732 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-02-17 22:48:43,732 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 23 transitions, 60 flow [2025-02-17 22:48:43,735 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 19 transitions, 50 flow [2025-02-17 22:48:43,740 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:48:43,926 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:48:43,927 INFO L101 AmpleReduction]: Number of pruned transitions: 20, Number of non-trivial ample sets: 34 [2025-02-17 22:48:43,927 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 10 [2025-02-17 22:48:43,932 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:48:43,932 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:48:43,932 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:48:43,932 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:48:43,932 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:48:43,932 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:48:43,932 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:48:43,933 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:48:43,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 65 states, 64 states have (on average 1.671875) internal successors, (107), 64 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:43,960 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 54 [2025-02-17 22:48:43,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:43,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:43,964 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:48:43,964 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:43,964 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:48:43,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 65 states, 64 states have (on average 1.671875) internal successors, (107), 64 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:43,968 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 54 [2025-02-17 22:48:43,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:43,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:43,968 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:48:43,968 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:43,972 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-02-17 22:48:43,972 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-02-17 22:48:43,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:43,976 INFO L85 PathProgramCache]: Analyzing trace with hash 95, now seen corresponding path program 1 times [2025-02-17 22:48:43,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:43,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389106997] [2025-02-17 22:48:43,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:43,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:44,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:48:44,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:48:44,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,029 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:44,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:48:44,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:48:44,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:44,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:44,047 INFO L85 PathProgramCache]: Analyzing trace with hash 75452690, now seen corresponding path program 1 times [2025-02-17 22:48:44,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:44,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492240348] [2025-02-17 22:48:44,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:44,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:44,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:44,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:44,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:44,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:44,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:44,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:44,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:44,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1528374412, now seen corresponding path program 1 times [2025-02-17 22:48:44,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:44,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617964483] [2025-02-17 22:48:44,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:44,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:44,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:44,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:44,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,075 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:44,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:44,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:44,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:44,139 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:44,140 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:44,140 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:44,140 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:44,140 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:44,140 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,140 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:44,141 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:44,141 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:44,141 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:44,141 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:44,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:44,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:44,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:44,217 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:44,218 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:44,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:44,222 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:44,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-17 22:48:44,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:44,226 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:44,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-17 22:48:44,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:44,248 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-02-17 22:48:44,250 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-02-17 22:48:44,252 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:44,252 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:44,321 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:44,325 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-02-17 22:48:44,325 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:44,325 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:44,325 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:44,325 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:44,325 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:44,325 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,325 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:44,325 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:44,325 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:44,325 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:44,325 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:44,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:44,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:44,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:44,393 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:44,396 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:44,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:44,398 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-02-17 22:48:44,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-17 22:48:44,401 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-02-17 22:48:44,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:44,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:44,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:44,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:44,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:44,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:44,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:44,420 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:44,426 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:44,426 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:44,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:44,429 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-02-17 22:48:44,432 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-02-17 22:48:44,433 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:44,433 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:44,433 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:44,434 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:48:44,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:44,443 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:44,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-17 22:48:44,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:44,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:48:44,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:48:44,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:44,489 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:44,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:44,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:44,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:44,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:44,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:44,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:44,576 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-02-17 22:48:44,584 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 65 states, 64 states have (on average 1.671875) internal successors, (107), 64 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:44,674 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 65 states, 64 states have (on average 1.671875) internal successors, (107), 64 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 184 states and 310 transitions. Complement of second has 7 states. [2025-02-17 22:48:44,676 INFO L141 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-02-17 22:48:44,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2025-02-17 22:48:44,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 1 letters. Loop has 5 letters. [2025-02-17 22:48:44,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:44,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 6 letters. Loop has 5 letters. [2025-02-17 22:48:44,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:44,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 1 letters. Loop has 10 letters. [2025-02-17 22:48:44,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:44,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 310 transitions. [2025-02-17 22:48:44,690 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 49 [2025-02-17 22:48:44,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 118 states and 210 transitions. [2025-02-17 22:48:44,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2025-02-17 22:48:44,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2025-02-17 22:48:44,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 210 transitions. [2025-02-17 22:48:44,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:44,695 INFO L218 hiAutomatonCegarLoop]: Abstraction has 118 states and 210 transitions. [2025-02-17 22:48:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 210 transitions. [2025-02-17 22:48:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2025-02-17 22:48:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.8181818181818181) internal successors, (180), 98 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 180 transitions. [2025-02-17 22:48:44,715 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99 states and 180 transitions. [2025-02-17 22:48:44,715 INFO L432 stractBuchiCegarLoop]: Abstraction has 99 states and 180 transitions. [2025-02-17 22:48:44,715 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:48:44,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 180 transitions. [2025-02-17 22:48:44,717 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 49 [2025-02-17 22:48:44,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:44,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:44,717 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:44,717 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:44,717 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-02-17 22:48:44,718 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-02-17 22:48:44,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:44,718 INFO L85 PathProgramCache]: Analyzing trace with hash 93420, now seen corresponding path program 1 times [2025-02-17 22:48:44,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:44,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834349918] [2025-02-17 22:48:44,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:44,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:44,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:44,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:44,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,722 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:44,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:44,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:44,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:44,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:44,728 INFO L85 PathProgramCache]: Analyzing trace with hash 82132825, now seen corresponding path program 1 times [2025-02-17 22:48:44,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:44,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490989290] [2025-02-17 22:48:44,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:44,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:44,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:44,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:44,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,735 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:44,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:44,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:44,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:44,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:44,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1175835314, now seen corresponding path program 1 times [2025-02-17 22:48:44,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:44,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260636958] [2025-02-17 22:48:44,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:44,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:44,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:44,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:44,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,750 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:44,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:44,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:44,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:44,788 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:44,788 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:44,788 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:44,788 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:44,788 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:44,788 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,788 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:44,788 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:44,788 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:44,788 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:44,788 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:44,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:44,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:44,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:44,831 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:44,831 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:44,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:44,833 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-02-17 22:48:44,835 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-02-17 22:48:44,836 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:44,836 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:44,854 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-02-17 22:48:44,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:44,856 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-02-17 22:48:44,858 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-02-17 22:48:44,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:44,859 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:44,889 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:44,889 INFO L401 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-02-17 22:48:44,896 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-02-17 22:48:44,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:44,901 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-02-17 22:48:44,902 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-02-17 22:48:44,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:44,903 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:44,920 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-02-17 22:48:44,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:44,923 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-02-17 22:48:44,924 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-02-17 22:48:44,926 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:44,926 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:44,992 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:44,996 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-02-17 22:48:44,997 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:44,997 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:44,997 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:44,997 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:44,997 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:44,997 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,997 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:44,997 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:44,997 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:44,997 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:44,997 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:44,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,046 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:45,046 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:45,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,049 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-02-17 22:48:45,050 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-02-17 22:48:45,052 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-02-17 22:48:45,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:45,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:45,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:45,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:45,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:45,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:45,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:45,066 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:45,071 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-02-17 22:48:45,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,074 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-02-17 22:48:45,075 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-02-17 22:48:45,076 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-02-17 22:48:45,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:45,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:45,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:45,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:45,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:45,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:45,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:45,089 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:45,093 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:45,093 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:45,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,095 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-02-17 22:48:45,096 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-02-17 22:48:45,097 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:45,097 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:45,097 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:45,097 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-02-17 22:48:45,103 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-02-17 22:48:45,105 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:45,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:45,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:45,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:45,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:45,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:45,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:45,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:45,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:45,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:45,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:45,162 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-02-17 22:48:45,163 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 180 transitions. cyclomatic complexity: 91 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:45,193 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 180 transitions. cyclomatic complexity: 91. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 133 states and 235 transitions. Complement of second has 6 states. [2025-02-17 22:48:45,194 INFO L141 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-02-17 22:48:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-02-17 22:48:45,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 3 letters. Loop has 5 letters. [2025-02-17 22:48:45,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 8 letters. Loop has 5 letters. [2025-02-17 22:48:45,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 3 letters. Loop has 10 letters. [2025-02-17 22:48:45,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 235 transitions. [2025-02-17 22:48:45,200 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2025-02-17 22:48:45,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 82 states and 148 transitions. [2025-02-17 22:48:45,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2025-02-17 22:48:45,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-02-17 22:48:45,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 148 transitions. [2025-02-17 22:48:45,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:45,201 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 148 transitions. [2025-02-17 22:48:45,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 148 transitions. [2025-02-17 22:48:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-17 22:48:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.8048780487804879) internal successors, (148), 81 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 148 transitions. [2025-02-17 22:48:45,204 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 148 transitions. [2025-02-17 22:48:45,204 INFO L432 stractBuchiCegarLoop]: Abstraction has 82 states and 148 transitions. [2025-02-17 22:48:45,204 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:48:45,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 148 transitions. [2025-02-17 22:48:45,205 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2025-02-17 22:48:45,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:45,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:45,205 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-17 22:48:45,205 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:45,205 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-02-17 22:48:45,206 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-02-17 22:48:45,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1511596121, now seen corresponding path program 1 times [2025-02-17 22:48:45,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:45,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037217867] [2025-02-17 22:48:45,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:45,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:45,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:45,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:45,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,212 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:45,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:45,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:45,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:45,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,218 INFO L85 PathProgramCache]: Analyzing trace with hash 86689855, now seen corresponding path program 2 times [2025-02-17 22:48:45,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:45,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121548023] [2025-02-17 22:48:45,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:45,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:45,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:45,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:45,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:48:45,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,224 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:45,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:45,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:45,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:45,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1023688615, now seen corresponding path program 1 times [2025-02-17 22:48:45,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:45,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732546810] [2025-02-17 22:48:45,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:45,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:45,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:48:45,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:48:45,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,241 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:45,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:48:45,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:48:45,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:45,286 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:45,287 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:45,287 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:45,287 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:45,287 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:45,287 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,287 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:45,287 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:45,287 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:48:45,287 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:45,287 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:45,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,328 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:45,328 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:45,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,331 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-02-17 22:48:45,332 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-02-17 22:48:45,334 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:45,334 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:45,349 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-02-17 22:48:45,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,352 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-02-17 22:48:45,353 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-02-17 22:48:45,354 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:45,354 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:45,377 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:45,378 INFO L401 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-02-17 22:48:45,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-17 22:48:45,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,385 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-02-17 22:48:45,385 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-02-17 22:48:45,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:45,387 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:45,446 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-02-17 22:48:45,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,448 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-02-17 22:48:45,448 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-02-17 22:48:45,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:45,449 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:45,512 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:45,516 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-02-17 22:48:45,516 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:45,517 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:45,517 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:45,517 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:45,517 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:45,517 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,517 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:45,517 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:45,517 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:48:45,517 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:45,517 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:45,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,553 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:45,553 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:45,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,556 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-02-17 22:48:45,556 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-02-17 22:48:45,558 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-02-17 22:48:45,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:45,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:45,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:45,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:45,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:45,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:45,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:45,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:45,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:45,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,580 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-02-17 22:48:45,581 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-02-17 22:48:45,582 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-02-17 22:48:45,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:45,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:45,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:45,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:45,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:45,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:45,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:45,596 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:45,600 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:45,600 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:45,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,602 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-02-17 22:48:45,604 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-02-17 22:48:45,605 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:45,605 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:45,605 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:45,605 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-02-17 22:48:45,611 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-02-17 22:48:45,612 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:45,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:45,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:45,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:45,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:45,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:45,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:45,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:45,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:45,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:45,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:45,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:45,671 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-02-17 22:48:45,671 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 148 transitions. cyclomatic complexity: 73 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:45,704 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 148 transitions. cyclomatic complexity: 73. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 160 states and 297 transitions. Complement of second has 7 states. [2025-02-17 22:48:45,704 INFO L141 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-02-17 22:48:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2025-02-17 22:48:45,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 6 letters. Loop has 5 letters. [2025-02-17 22:48:45,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 5 letters. [2025-02-17 22:48:45,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 6 letters. Loop has 10 letters. [2025-02-17 22:48:45,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 297 transitions. [2025-02-17 22:48:45,707 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2025-02-17 22:48:45,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 151 states and 283 transitions. [2025-02-17 22:48:45,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2025-02-17 22:48:45,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2025-02-17 22:48:45,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 283 transitions. [2025-02-17 22:48:45,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:45,708 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 283 transitions. [2025-02-17 22:48:45,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 283 transitions. [2025-02-17 22:48:45,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2025-02-17 22:48:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 133 states have (on average 1.8796992481203008) internal successors, (250), 132 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 250 transitions. [2025-02-17 22:48:45,718 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 250 transitions. [2025-02-17 22:48:45,718 INFO L432 stractBuchiCegarLoop]: Abstraction has 133 states and 250 transitions. [2025-02-17 22:48:45,718 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:48:45,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 250 transitions. [2025-02-17 22:48:45,719 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2025-02-17 22:48:45,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:45,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:45,719 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:48:45,719 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:45,722 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-02-17 22:48:45,722 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-02-17 22:48:45,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,722 INFO L85 PathProgramCache]: Analyzing trace with hash -944924287, now seen corresponding path program 1 times [2025-02-17 22:48:45,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:45,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990730366] [2025-02-17 22:48:45,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:45,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:45,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:45,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:45,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,729 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:45,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:45,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:45,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:45,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,733 INFO L85 PathProgramCache]: Analyzing trace with hash 75452690, now seen corresponding path program 2 times [2025-02-17 22:48:45,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:45,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893194773] [2025-02-17 22:48:45,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:45,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:45,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:45,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:45,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:48:45,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,738 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:45,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:45,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:45,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:45,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,743 INFO L85 PathProgramCache]: Analyzing trace with hash -254433390, now seen corresponding path program 1 times [2025-02-17 22:48:45,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:45,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494866440] [2025-02-17 22:48:45,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:45,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:45,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-17 22:48:45,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-17 22:48:45,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,747 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:45,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-17 22:48:45,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-17 22:48:45,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:45,775 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:45,776 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:45,776 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:45,776 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:45,776 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:45,776 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,776 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:45,776 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:45,776 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:48:45,776 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:45,776 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:45,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,820 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:45,820 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:45,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,822 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-02-17 22:48:45,823 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-02-17 22:48:45,824 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:45,824 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:45,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:45,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,842 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-02-17 22:48:45,842 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-02-17 22:48:45,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:45,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:45,908 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:45,912 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-02-17 22:48:45,912 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:45,912 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:45,912 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:45,912 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:45,912 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:45,912 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,912 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:45,912 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:45,913 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:48:45,913 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:45,913 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:45,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,957 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:45,957 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:45,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,959 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-02-17 22:48:45,959 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-02-17 22:48:45,960 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-02-17 22:48:45,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:45,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:45,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:45,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:45,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:45,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:45,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:45,972 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:45,974 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:48:45,974 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:45,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,976 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-02-17 22:48:45,977 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-02-17 22:48:45,977 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:45,977 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:45,977 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:45,977 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-02-17 22:48:45,982 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-02-17 22:48:45,983 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:45,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:45,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:45,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:46,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:46,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-17 22:48:46,038 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-02-17 22:48:46,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-17 22:48:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:46,067 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-02-17 22:48:46,067 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 250 transitions. cyclomatic complexity: 128 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:46,090 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 250 transitions. cyclomatic complexity: 128. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 156 states and 282 transitions. Complement of second has 6 states. [2025-02-17 22:48:46,091 INFO L141 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-02-17 22:48:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2025-02-17 22:48:46,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 8 letters. Loop has 5 letters. [2025-02-17 22:48:46,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 5 letters. [2025-02-17 22:48:46,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 8 letters. Loop has 10 letters. [2025-02-17 22:48:46,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 282 transitions. [2025-02-17 22:48:46,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-02-17 22:48:46,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 123 states and 231 transitions. [2025-02-17 22:48:46,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-02-17 22:48:46,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2025-02-17 22:48:46,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 231 transitions. [2025-02-17 22:48:46,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:46,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 123 states and 231 transitions. [2025-02-17 22:48:46,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 231 transitions. [2025-02-17 22:48:46,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-02-17 22:48:46,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.8780487804878048) internal successors, (231), 122 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 231 transitions. [2025-02-17 22:48:46,098 INFO L240 hiAutomatonCegarLoop]: Abstraction has 123 states and 231 transitions. [2025-02-17 22:48:46,098 INFO L432 stractBuchiCegarLoop]: Abstraction has 123 states and 231 transitions. [2025-02-17 22:48:46,098 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:48:46,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 231 transitions. [2025-02-17 22:48:46,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-02-17 22:48:46,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:46,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:46,100 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:48:46,100 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:46,100 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]" "[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-02-17 22:48:46,100 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-02-17 22:48:46,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,100 INFO L85 PathProgramCache]: Analyzing trace with hash 821721408, now seen corresponding path program 1 times [2025-02-17 22:48:46,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:46,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257605556] [2025-02-17 22:48:46,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:46,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:46,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:48:46,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:48:46,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:46,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:48:46,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257605556] [2025-02-17 22:48:46,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257605556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:48:46,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:48:46,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:48:46,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522200626] [2025-02-17 22:48:46,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:48:46,130 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:48:46,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,130 INFO L85 PathProgramCache]: Analyzing trace with hash 86689855, now seen corresponding path program 3 times [2025-02-17 22:48:46,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:46,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288134282] [2025-02-17 22:48:46,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-17 22:48:46,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:46,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:46,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:46,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-17 22:48:46,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:46,133 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:46,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:46,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:46,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:46,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:46,165 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:46,165 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:46,165 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:46,165 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:46,165 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:46,165 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,165 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:46,166 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:46,166 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:48:46,166 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:46,166 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:46,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,195 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:46,196 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:46,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,199 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-02-17 22:48:46,200 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-02-17 22:48:46,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:46,202 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:46,219 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-02-17 22:48:46,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,268 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-02-17 22:48:46,269 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-02-17 22:48:46,270 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:46,270 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:46,333 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:46,337 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-02-17 22:48:46,337 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:46,337 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:46,337 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:46,337 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:46,337 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:46,337 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,337 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:46,337 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:46,337 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:48:46,337 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:46,337 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:46,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,378 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:46,378 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:46,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,380 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-02-17 22:48:46,380 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-02-17 22:48:46,381 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-02-17 22:48:46,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:46,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:46,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:46,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:46,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:46,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:46,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:46,395 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:46,398 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:46,398 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:46,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,400 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-02-17 22:48:46,401 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-02-17 22:48:46,402 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:46,402 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:46,402 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:46,402 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-02-17 22:48:46,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-17 22:48:46,408 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:46,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:48:46,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:48:46,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:46,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:46,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:46,474 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-02-17 22:48:46,474 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 123 states and 231 transitions. cyclomatic complexity: 117 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:46,529 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 123 states and 231 transitions. cyclomatic complexity: 117. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 538 states and 1005 transitions. Complement of second has 7 states. [2025-02-17 22:48:46,530 INFO L141 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-02-17 22:48:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2025-02-17 22:48:46,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 10 letters. Loop has 5 letters. [2025-02-17 22:48:46,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 15 letters. Loop has 5 letters. [2025-02-17 22:48:46,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 10 letters. Loop has 10 letters. [2025-02-17 22:48:46,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 538 states and 1005 transitions. [2025-02-17 22:48:46,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-02-17 22:48:46,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 538 states to 469 states and 866 transitions. [2025-02-17 22:48:46,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 176 [2025-02-17 22:48:46,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2025-02-17 22:48:46,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 469 states and 866 transitions. [2025-02-17 22:48:46,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:46,539 INFO L218 hiAutomatonCegarLoop]: Abstraction has 469 states and 866 transitions. [2025-02-17 22:48:46,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states and 866 transitions. [2025-02-17 22:48:46,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 335. [2025-02-17 22:48:46,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 335 states have (on average 1.8686567164179104) internal successors, (626), 334 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:46,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 626 transitions. [2025-02-17 22:48:46,552 INFO L240 hiAutomatonCegarLoop]: Abstraction has 335 states and 626 transitions. [2025-02-17 22:48:46,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:48:46,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:48:46,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:48:46,554 INFO L87 Difference]: Start difference. First operand 335 states and 626 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:48:46,572 INFO L93 Difference]: Finished difference Result 243 states and 391 transitions. [2025-02-17 22:48:46,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 243 states and 391 transitions. [2025-02-17 22:48:46,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2025-02-17 22:48:46,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 243 states to 190 states and 318 transitions. [2025-02-17 22:48:46,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2025-02-17 22:48:46,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2025-02-17 22:48:46,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 318 transitions. [2025-02-17 22:48:46,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:46,575 INFO L218 hiAutomatonCegarLoop]: Abstraction has 190 states and 318 transitions. [2025-02-17 22:48:46,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 318 transitions. [2025-02-17 22:48:46,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 138. [2025-02-17 22:48:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.7028985507246377) internal successors, (235), 137 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:46,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 235 transitions. [2025-02-17 22:48:46,580 INFO L240 hiAutomatonCegarLoop]: Abstraction has 138 states and 235 transitions. [2025-02-17 22:48:46,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:48:46,581 INFO L432 stractBuchiCegarLoop]: Abstraction has 138 states and 235 transitions. [2025-02-17 22:48:46,581 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:48:46,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 235 transitions. [2025-02-17 22:48:46,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2025-02-17 22:48:46,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:46,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:46,582 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:48:46,582 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:46,582 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[]" "[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]" "[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]" "[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-02-17 22:48:46,582 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-02-17 22:48:46,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1292576601, now seen corresponding path program 1 times [2025-02-17 22:48:46,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:46,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289280058] [2025-02-17 22:48:46,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:46,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:46,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-17 22:48:46,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:48:46,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:46,589 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:46,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-17 22:48:46,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:48:46,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:46,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:46,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,595 INFO L85 PathProgramCache]: Analyzing trace with hash 78284630, now seen corresponding path program 3 times [2025-02-17 22:48:46,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:46,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563223229] [2025-02-17 22:48:46,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-17 22:48:46,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:46,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:46,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:46,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-17 22:48:46,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:46,598 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:46,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:46,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:46,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:46,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:46,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1235891966, now seen corresponding path program 2 times [2025-02-17 22:48:46,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:46,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68711234] [2025-02-17 22:48:46,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:46,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:46,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-17 22:48:46,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-17 22:48:46,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-17 22:48:46,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:46,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:46,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-17 22:48:46,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-17 22:48:46,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:46,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:46,636 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:46,636 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:46,636 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:46,636 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:46,636 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:46,636 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,636 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:46,636 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:46,636 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:48:46,636 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:46,636 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:46,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,665 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:46,665 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:46,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,667 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-02-17 22:48:46,668 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-02-17 22:48:46,670 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:46,670 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:46,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:46,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,688 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-02-17 22:48:46,690 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-02-17 22:48:46,691 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:46,691 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:46,715 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:46,716 INFO L401 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-02-17 22:48:46,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:46,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,723 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-02-17 22:48:46,724 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-02-17 22:48:46,726 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:46,726 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:46,737 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:46,738 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {l=0} Honda state: {l=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:48:46,744 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-02-17 22:48:46,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,746 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-02-17 22:48:46,747 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-02-17 22:48:46,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:46,751 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:46,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:46,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,772 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-02-17 22:48:46,773 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-02-17 22:48:46,774 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:46,775 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:46,859 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:46,863 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-02-17 22:48:46,864 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:46,864 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:46,864 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:46,864 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:46,864 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:46,864 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,864 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:46,864 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:46,864 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:48:46,864 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:46,864 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:46,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,898 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:46,898 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:46,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,901 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-02-17 22:48:46,902 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-02-17 22:48:46,904 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-02-17 22:48:46,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:46,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:46,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:46,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:46,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:46,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:46,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:46,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:46,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:46,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,925 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-02-17 22:48:46,926 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-02-17 22:48:46,928 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-02-17 22:48:46,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:46,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:46,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:46,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:46,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:46,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:46,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:46,940 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:46,946 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-02-17 22:48:46,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,948 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-02-17 22:48:46,949 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-02-17 22:48:46,951 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-02-17 22:48:46,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:46,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:46,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:46,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:46,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:46,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:46,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:46,963 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:46,965 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:48:46,965 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:46,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,967 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-02-17 22:48:46,968 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-02-17 22:48:46,969 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:46,969 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:46,969 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:46,969 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-02-17 22:48:46,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-17 22:48:46,975 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:46,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-17 22:48:46,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:48:46,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:47,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:47,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:47,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:47,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:47,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:47,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:47,029 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-02-17 22:48:47,029 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 138 states and 235 transitions. cyclomatic complexity: 105 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:47,059 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 138 states and 235 transitions. cyclomatic complexity: 105. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 327 states and 541 transitions. Complement of second has 7 states. [2025-02-17 22:48:47,061 INFO L141 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-02-17 22:48:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:47,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2025-02-17 22:48:47,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 14 letters. Loop has 5 letters. [2025-02-17 22:48:47,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:47,062 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-17 22:48:47,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:47,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-17 22:48:47,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:48:47,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:47,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:47,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:47,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:47,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:47,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:47,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:47,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:47,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:47,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:47,115 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-02-17 22:48:47,115 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 138 states and 235 transitions. cyclomatic complexity: 105 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:47,174 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 138 states and 235 transitions. cyclomatic complexity: 105. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 321 states and 538 transitions. Complement of second has 9 states. [2025-02-17 22:48:47,174 INFO L141 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-02-17 22:48:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2025-02-17 22:48:47,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 14 letters. Loop has 5 letters. [2025-02-17 22:48:47,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:47,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 19 letters. Loop has 5 letters. [2025-02-17 22:48:47,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:47,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 14 letters. Loop has 10 letters. [2025-02-17 22:48:47,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:47,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 321 states and 538 transitions. [2025-02-17 22:48:47,177 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2025-02-17 22:48:47,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 321 states to 283 states and 468 transitions. [2025-02-17 22:48:47,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2025-02-17 22:48:47,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2025-02-17 22:48:47,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 283 states and 468 transitions. [2025-02-17 22:48:47,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:47,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 283 states and 468 transitions. [2025-02-17 22:48:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states and 468 transitions. [2025-02-17 22:48:47,182 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-02-17 22:48:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 208. [2025-02-17 22:48:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 208 states have (on average 1.6730769230769231) internal successors, (348), 207 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 348 transitions. [2025-02-17 22:48:47,188 INFO L240 hiAutomatonCegarLoop]: Abstraction has 208 states and 348 transitions. [2025-02-17 22:48:47,188 INFO L432 stractBuchiCegarLoop]: Abstraction has 208 states and 348 transitions. [2025-02-17 22:48:47,189 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-17 22:48:47,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 208 states and 348 transitions. [2025-02-17 22:48:47,190 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2025-02-17 22:48:47,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:47,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:47,190 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:48:47,190 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:48:47,190 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[]" "[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]" "[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]" "[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-02-17 22:48:47,191 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[]" "[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-02-17 22:48:47,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:47,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1292576601, now seen corresponding path program 3 times [2025-02-17 22:48:47,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:47,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245830012] [2025-02-17 22:48:47,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-17 22:48:47,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:47,192 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-02-17 22:48:47,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-02-17 22:48:47,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:48:47,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-17 22:48:47,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:47,201 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:47,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-17 22:48:47,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:48:47,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:47,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:47,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:47,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:47,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1382541174, now seen corresponding path program 1 times [2025-02-17 22:48:47,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:47,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263551126] [2025-02-17 22:48:47,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:47,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:47,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:48:47,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:48:47,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:47,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:47,217 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:47,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:48:47,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:48:47,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:47,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:47,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:47,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:47,228 INFO L85 PathProgramCache]: Analyzing trace with hash 327925966, now seen corresponding path program 4 times [2025-02-17 22:48:47,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:47,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639631463] [2025-02-17 22:48:47,228 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-17 22:48:47,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:47,231 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-02-17 22:48:47,241 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-17 22:48:47,241 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-17 22:48:47,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:47,241 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:47,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-17 22:48:47,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-17 22:48:47,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:47,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:47,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:47,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-17 22:48:47,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:48:47,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:47,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:47,386 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:47,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-17 22:48:47,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:48:47,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:47,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:47,413 INFO L201 PluginConnector]: Adding new model clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:48:47 BoogieIcfgContainer [2025-02-17 22:48:47,413 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:48:47,415 INFO L158 Benchmark]: Toolchain (without parser) took 4037.65ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.0MB in the beginning and 94.2MB in the end (delta: -8.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:47,415 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:47,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.84ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:47,415 INFO L158 Benchmark]: Boogie Preprocessor took 11.69ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 82.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:47,416 INFO L158 Benchmark]: RCFGBuilder took 192.86ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 73.8MB in the end (delta: 8.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-02-17 22:48:47,417 INFO L158 Benchmark]: BuchiAutomizer took 3814.79ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.8MB in the beginning and 94.2MB in the end (delta: -20.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:47,417 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 15.84ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 11.69ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 82.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 192.86ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 73.8MB in the end (delta: 8.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3814.79ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.8MB in the beginning and 94.2MB in the end (delta: -20.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 z + -1 * x2 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 208 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. 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, 298 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, 168 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 149 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 196 IncrementalHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 89 mSDtfsCounter, 196 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: 37ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 3 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 237, Trivial Ample Sets caused by loops: 10, Number of non-trivial ample sets: 34, Number of pruned transitions: 20, Number of transitions in reduction automaton: 107, Number of states in reduction automaton: 65, Underlying: - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 24]: 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=-2, z=0] [L26] 1 assume l > 0; [L27] 1 l := 0; VAL [l=0, x1=-2, z=0] [L29] 1 x1 := x1 + 1; VAL [l=0, x1=-1, z=0] [L14] FORK 0 fork 2, 2 thread2(); VAL [l=0, x1=-1, z=0] [L30] 1 x2 := x2 - 1; VAL [l=0, x1=-1, x2=-1, z=0] [L31] 1 l := 1; VAL [l=1, x1=-1, x2=-1, z=0] [L22] COND TRUE 1 x1 < z VAL [l=1, x1=-1, x2=-1, z=0] [L38] COND TRUE 2 x2 < z VAL [l=1, 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] Loop: [L29] x1 := x1 + 1; [L30] x2 := x2 - 1; [L31] l := 1; [L22] COND TRUE x1 < z [L38] COND TRUE x2 < 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; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 24]: 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=-2, z=0] [L26] 1 assume l > 0; [L27] 1 l := 0; VAL [l=0, x1=-2, z=0] [L29] 1 x1 := x1 + 1; VAL [l=0, x1=-1, z=0] [L14] FORK 0 fork 2, 2 thread2(); VAL [l=0, x1=-1, z=0] [L30] 1 x2 := x2 - 1; VAL [l=0, x1=-1, x2=-1, z=0] [L31] 1 l := 1; VAL [l=1, x1=-1, x2=-1, z=0] [L22] COND TRUE 1 x1 < z VAL [l=1, x1=-1, x2=-1, z=0] [L38] COND TRUE 2 x2 < z VAL [l=1, 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] Loop: [L29] x1 := x1 + 1; [L30] x2 := x2 - 1; [L31] l := 1; [L22] COND TRUE x1 < z [L38] COND TRUE x2 < 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; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-17 22:48:47,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...