/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.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:48:43,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:48:43,250 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,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:48:43,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:48:43,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:48:43,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:48:43,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:48:43,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:48:43,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:48:43,272 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:48:43,272 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:48:43,272 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:48:43,272 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:48:43,272 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:48:43,272 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:48:43,272 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:48:43,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:48:43,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:48:43,272 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:48:43,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:48:43,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:48:43,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:48:43,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:48:43,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:48:43,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:48:43,273 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:48:43,273 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:48:43,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:48:43,273 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:48:43,273 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:48:43,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:48:43,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:48:43,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:48:43,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:48:43,273 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:48:43,273 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,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:48:43,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:48:43,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:48:43,495 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:48:43,495 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:48:43,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/clock2.c.bpl [2025-02-17 22:48:43,496 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/clock2.c.bpl' [2025-02-17 22:48:43,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:48:43,515 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:48:43,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:43,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:48:43,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:48:43,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,536 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:48:43,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:43,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:48:43,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:48:43,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:48:43,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,549 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:48:43,553 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:48:43,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:48:43,553 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:48:43,554 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/1) ... [2025-02-17 22:48:43,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:43,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:43,581 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,586 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,607 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:48:43,607 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:48:43,607 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:48:43,607 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:48:43,607 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:48:43,607 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:48:43,607 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:48:43,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:48:43,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:48:43,608 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,648 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:48:43,649 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:48:43,716 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:48:43,716 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:48:43,731 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:48:43,731 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:48:43,731 INFO L201 PluginConnector]: Adding new model clock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:43 BoogieIcfgContainer [2025-02-17 22:48:43,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:48:43,735 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:48:43,735 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:48:43,740 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:48:43,740 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:43,740 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:43" (1/2) ... [2025-02-17 22:48:43,743 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ce8383e and model type clock2.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,743 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:43,744 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:43" (2/2) ... [2025-02-17 22:48:43,745 INFO L363 chiAutomizerObserver]: Analyzing ICFG clock2.c.bpl [2025-02-17 22:48:43,796 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:48:43,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 24 transitions, 62 flow [2025-02-17 22:48:43,860 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-02-17 22:48:43,862 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:48:43,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 3/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-02-17 22:48:43,865 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 24 transitions, 62 flow [2025-02-17 22:48:43,867 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 20 transitions, 52 flow [2025-02-17 22:48:43,872 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:48:44,064 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:48:44,065 INFO L101 AmpleReduction]: Number of pruned transitions: 19, Number of non-trivial ample sets: 34 [2025-02-17 22:48:44,065 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 13 [2025-02-17 22:48:44,072 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:48:44,072 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:48:44,072 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:48:44,072 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:48:44,073 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:48:44,073 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:48:44,073 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:48:44,073 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:48:44,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 65 states, 64 states have (on average 1.796875) internal successors, (115), 64 states have internal predecessors, (115), 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,086 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 54 [2025-02-17 22:48:44,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:44,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:44,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:48:44,090 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:44,090 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:48:44,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 65 states, 64 states have (on average 1.796875) internal successors, (115), 64 states have internal predecessors, (115), 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,092 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 54 [2025-02-17 22:48:44,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:44,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:44,092 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:48:44,092 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:44,096 INFO L752 eck$LassoCheckResult]: Stem: "[71] $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:44,096 INFO L754 eck$LassoCheckResult]: Loop: "[55] 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[]" "[57] 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]" "[58] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[60] L30-->L30-2: Formula: (<= v_x2_3 v_x1_6) InVars {x1=v_x1_6, x2=v_x2_3} OutVars{x1=v_x1_6, x2=v_x2_3} AuxVars[] AssignedVars[]" "[62] L30-2-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" [2025-02-17 22:48:44,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:44,100 INFO L85 PathProgramCache]: Analyzing trace with hash 102, now seen corresponding path program 1 times [2025-02-17 22:48:44,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:44,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338945206] [2025-02-17 22:48:44,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:44,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:44,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:48:44,154 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,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,155 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:44,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:48:44,160 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,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:44,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:44,174 INFO L85 PathProgramCache]: Analyzing trace with hash 81178553, now seen corresponding path program 1 times [2025-02-17 22:48:44,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:44,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625298012] [2025-02-17 22:48:44,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:44,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:44,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:44,186 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,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:44,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:44,193 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,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:44,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1322244492, now seen corresponding path program 1 times [2025-02-17 22:48:44,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:44,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16712712] [2025-02-17 22:48:44,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:44,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:44,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:44,201 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,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,201 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:44,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:44,209 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,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:44,279 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:44,280 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:44,280 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:44,280 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:44,280 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:44,280 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,280 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:44,280 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:44,281 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:44,281 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:44,281 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:44,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:44,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:44,374 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:44,374 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:44,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:44,378 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,381 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,382 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:44,382 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:44,397 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:44,397 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {l=1} Honda state: {l=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:48:44,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:44,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:44,406 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,407 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,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:44,410 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:44,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-17 22:48:44,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:44,435 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,436 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,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:44,437 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:44,540 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:44,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-17 22:48:44,545 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:44,545 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:44,545 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:44,545 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:44,545 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:44,545 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,545 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:44,545 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:44,545 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:44,545 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:44,545 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:44,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:44,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:44,588 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:44,591 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:44,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:44,595 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,597 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,598 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,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:44,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:44,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:44,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:44,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:44,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:44,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:44,636 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:44,642 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,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:44,645 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,646 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,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:44,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:44,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:44,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:44,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:44,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:44,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:44,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:44,665 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:44,668 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:48:44,669 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:44,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:44,672 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,673 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,673 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:44,673 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:44,673 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:44,674 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:48:44,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:44,682 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:44,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:44,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:48:44,715 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,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:44,716 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:44,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:44,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-17 22:48:44,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:44,738 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,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:44,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:44,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:44,823 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,840 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,841 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 65 states, 64 states have (on average 1.796875) internal successors, (115), 64 states have internal predecessors, (115), 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,913 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 65 states, 64 states have (on average 1.796875) internal successors, (115), 64 states have internal predecessors, (115), 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 152 states and 297 transitions. Complement of second has 6 states. [2025-02-17 22:48:44,915 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,919 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,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2025-02-17 22:48:44,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 1 letters. Loop has 5 letters. [2025-02-17 22:48:44,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:44,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 6 letters. Loop has 5 letters. [2025-02-17 22:48:44,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:44,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 1 letters. Loop has 10 letters. [2025-02-17 22:48:44,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:44,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 297 transitions. [2025-02-17 22:48:44,933 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-02-17 22:48:44,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 89 states and 189 transitions. [2025-02-17 22:48:44,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-02-17 22:48:44,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-02-17 22:48:44,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 189 transitions. [2025-02-17 22:48:44,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:44,940 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 189 transitions. [2025-02-17 22:48:44,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 189 transitions. [2025-02-17 22:48:44,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 74. [2025-02-17 22:48:44,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 2.1216216216216215) internal successors, (157), 73 states have internal predecessors, (157), 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,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 157 transitions. [2025-02-17 22:48:44,957 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 157 transitions. [2025-02-17 22:48:44,957 INFO L432 stractBuchiCegarLoop]: Abstraction has 74 states and 157 transitions. [2025-02-17 22:48:44,957 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:48:44,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 157 transitions. [2025-02-17 22:48:44,958 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-02-17 22:48:44,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:44,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:44,959 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:44,959 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-17 22:48:44,959 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[55] 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[]" "[74] L13-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-02-17 22:48:44,959 INFO L754 eck$LassoCheckResult]: Loop: "[64] L41-->L43: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[66] L43-->L43-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[67] L43-1-->L49: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[68] L49-->L41: Formula: (= v_l_6 1) InVars {} OutVars{l=v_l_6} AuxVars[] AssignedVars[l]" [2025-02-17 22:48:44,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:44,959 INFO L85 PathProgramCache]: Analyzing trace with hash 99801, now seen corresponding path program 1 times [2025-02-17 22:48:44,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:44,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550300271] [2025-02-17 22:48:44,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:44,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:44,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:44,962 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,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,963 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:44,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:44,965 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,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:44,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:44,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2895716, now seen corresponding path program 1 times [2025-02-17 22:48:44,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:44,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892761282] [2025-02-17 22:48:44,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:44,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:44,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:44,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:44,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,971 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:44,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:44,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:44,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:44,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1975978300, now seen corresponding path program 1 times [2025-02-17 22:48:44,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:44,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371186288] [2025-02-17 22:48:44,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:44,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:44,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:48:44,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:48:44,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,984 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:44,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:48:44,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:48:44,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:45,014 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:45,015 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:45,015 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:45,015 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:45,015 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:45,015 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,015 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:45,015 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:45,015 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:45,015 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:45,015 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:45,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,049 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:45,049 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:45,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,053 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:45,055 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:45,055 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:45,056 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:45,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-17 22:48:45,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,075 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:45,077 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:45,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:45,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:45,145 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:45,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-17 22:48:45,149 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:45,149 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:45,149 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:45,149 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:45,150 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:45,150 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,150 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:45,150 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:45,150 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:45,150 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:45,150 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:45,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,186 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:45,186 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:45,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,188 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,190 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,191 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,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:45,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:45,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:45,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:45,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:45,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:45,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:45,204 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:45,206 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:48:45,206 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:45,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,208 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,210 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,210 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:45,211 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:45,211 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:45,211 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-02-17 22:48:45,216 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,217 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:45,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:45,235 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,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:45,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:45,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:45,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:45,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:45,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:45,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:45,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:45,271 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,271 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,272 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 157 transitions. cyclomatic complexity: 92 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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,315 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 157 transitions. cyclomatic complexity: 92. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 238 states and 517 transitions. Complement of second has 7 states. [2025-02-17 22:48:45,315 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,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2025-02-17 22:48:45,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:48:45,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 7 letters. Loop has 4 letters. [2025-02-17 22:48:45,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 3 letters. Loop has 8 letters. [2025-02-17 22:48:45,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 238 states and 517 transitions. [2025-02-17 22:48:45,320 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-02-17 22:48:45,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 238 states to 164 states and 366 transitions. [2025-02-17 22:48:45,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2025-02-17 22:48:45,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2025-02-17 22:48:45,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 366 transitions. [2025-02-17 22:48:45,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:45,322 INFO L218 hiAutomatonCegarLoop]: Abstraction has 164 states and 366 transitions. [2025-02-17 22:48:45,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 366 transitions. [2025-02-17 22:48:45,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 157. [2025-02-17 22:48:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 2.2420382165605095) internal successors, (352), 156 states have internal predecessors, (352), 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,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 352 transitions. [2025-02-17 22:48:45,328 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 352 transitions. [2025-02-17 22:48:45,328 INFO L432 stractBuchiCegarLoop]: Abstraction has 157 states and 352 transitions. [2025-02-17 22:48:45,328 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:48:45,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 352 transitions. [2025-02-17 22:48:45,330 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-02-17 22:48:45,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:45,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:45,330 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:48:45,330 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-17 22:48:45,330 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[55] 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[]" "[57] 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]" "[58] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[74] L13-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[59] L30-->L32: Formula: (< v_x1_4 v_x2_1) InVars {x1=v_x1_4, x2=v_x2_1} OutVars{x1=v_x1_4, x2=v_x2_1} AuxVars[] AssignedVars[]" "[61] L32-->L30-2: Formula: (= v_x2_2 v_x1_5) InVars {x1=v_x1_5} OutVars{x1=v_x1_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:48:45,330 INFO L754 eck$LassoCheckResult]: Loop: "[64] L41-->L43: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[66] L43-->L43-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[67] L43-1-->L49: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[68] L49-->L41: Formula: (= v_l_6 1) InVars {} OutVars{l=v_l_6} AuxVars[] AssignedVars[l]" [2025-02-17 22:48:45,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1960107130, now seen corresponding path program 1 times [2025-02-17 22:48:45,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:45,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049971733] [2025-02-17 22:48:45,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:45,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:45,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:48:45,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:48:45,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,335 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:45,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:48:45,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:48:45,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:45,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2895716, now seen corresponding path program 2 times [2025-02-17 22:48:45,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:45,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980138524] [2025-02-17 22:48:45,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:45,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:45,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:45,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:45,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:48:45,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:45,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:45,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:45,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:45,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,346 INFO L85 PathProgramCache]: Analyzing trace with hash 232531805, now seen corresponding path program 1 times [2025-02-17 22:48:45,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:45,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818480121] [2025-02-17 22:48:45,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:45,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:45,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:48:45,357 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,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:45,386 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,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:48:45,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818480121] [2025-02-17 22:48:45,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818480121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:48:45,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:48:45,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:48:45,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102072295] [2025-02-17 22:48:45,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:48:45,409 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:45,410 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:45,410 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:45,410 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:45,410 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:45,410 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,410 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:45,410 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:45,410 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:48:45,410 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:45,410 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:45,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,441 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:45,442 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:45,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,444 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,445 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,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:45,446 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:45,462 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:45,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,464 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,465 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,466 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:45,466 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:45,528 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:45,533 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,533 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:45,533 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:45,533 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:45,533 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:45,533 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:45,533 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,533 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:45,533 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:45,533 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:48:45,533 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:45,533 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:45,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,567 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:45,567 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:45,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,569 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,571 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,571 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,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:45,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:45,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:45,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:45,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:45,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:45,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:45,584 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:45,587 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:45,587 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:45,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,611 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,612 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,612 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:45,612 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:45,613 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:45,613 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-02-17 22:48:45,620 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,624 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:45,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:48:45,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:48:45,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:45,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:45,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:45,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:45,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:45,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:45,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:45,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:45,690 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,691 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,691 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 352 transitions. cyclomatic complexity: 212 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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,750 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 352 transitions. cyclomatic complexity: 212. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 662 states and 1478 transitions. Complement of second has 7 states. [2025-02-17 22:48:45,751 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,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-02-17 22:48:45,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 7 letters. Loop has 4 letters. [2025-02-17 22:48:45,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 11 letters. Loop has 4 letters. [2025-02-17 22:48:45,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 7 letters. Loop has 8 letters. [2025-02-17 22:48:45,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 662 states and 1478 transitions. [2025-02-17 22:48:45,762 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-02-17 22:48:45,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 662 states to 464 states and 1030 transitions. [2025-02-17 22:48:45,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2025-02-17 22:48:45,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2025-02-17 22:48:45,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 464 states and 1030 transitions. [2025-02-17 22:48:45,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:45,770 INFO L218 hiAutomatonCegarLoop]: Abstraction has 464 states and 1030 transitions. [2025-02-17 22:48:45,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states and 1030 transitions. [2025-02-17 22:48:45,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 274. [2025-02-17 22:48:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 274 states have (on average 2.2153284671532845) internal successors, (607), 273 states have internal predecessors, (607), 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,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 607 transitions. [2025-02-17 22:48:45,791 INFO L240 hiAutomatonCegarLoop]: Abstraction has 274 states and 607 transitions. [2025-02-17 22:48:45,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:48:45,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:48:45,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:48:45,793 INFO L87 Difference]: Start difference. First operand 274 states and 607 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:48:45,820 INFO L93 Difference]: Finished difference Result 174 states and 315 transitions. [2025-02-17 22:48:45,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 315 transitions. [2025-02-17 22:48:45,821 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2025-02-17 22:48:45,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 155 states and 278 transitions. [2025-02-17 22:48:45,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-02-17 22:48:45,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-02-17 22:48:45,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 278 transitions. [2025-02-17 22:48:45,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:45,822 INFO L218 hiAutomatonCegarLoop]: Abstraction has 155 states and 278 transitions. [2025-02-17 22:48:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 278 transitions. [2025-02-17 22:48:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2025-02-17 22:48:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 141 states have (on average 1.8156028368794326) internal successors, (256), 140 states have internal predecessors, (256), 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,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 256 transitions. [2025-02-17 22:48:45,826 INFO L240 hiAutomatonCegarLoop]: Abstraction has 141 states and 256 transitions. [2025-02-17 22:48:45,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:48:45,827 INFO L432 stractBuchiCegarLoop]: Abstraction has 141 states and 256 transitions. [2025-02-17 22:48:45,827 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:48:45,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 256 transitions. [2025-02-17 22:48:45,829 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2025-02-17 22:48:45,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:45,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:45,829 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-02-17 22:48:45,829 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-17 22:48:45,830 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[55] 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[]" "[57] 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]" "[58] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[74] L13-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[59] L30-->L32: Formula: (< v_x1_4 v_x2_1) InVars {x1=v_x1_4, x2=v_x2_1} OutVars{x1=v_x1_4, x2=v_x2_1} AuxVars[] AssignedVars[]" "[61] L32-->L30-2: Formula: (= v_x2_2 v_x1_5) InVars {x1=v_x1_5} OutVars{x1=v_x1_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[62] L30-2-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" "[55] 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[]" "[57] 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]" "[58] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[59] L30-->L32: Formula: (< v_x1_4 v_x2_1) InVars {x1=v_x1_4, x2=v_x2_1} OutVars{x1=v_x1_4, x2=v_x2_1} AuxVars[] AssignedVars[]" "[61] L32-->L30-2: Formula: (= v_x2_2 v_x1_5) InVars {x1=v_x1_5} OutVars{x1=v_x1_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[62] L30-2-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" "[54] L22-->thread1FINAL: Formula: (<= v_z_2 v_x1_7) InVars {x1=v_x1_7, z=v_z_2} OutVars{x1=v_x1_7, z=v_z_2} AuxVars[] AssignedVars[]" [2025-02-17 22:48:45,830 INFO L754 eck$LassoCheckResult]: Loop: "[64] L41-->L43: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[66] L43-->L43-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[67] L43-1-->L49: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[68] L49-->L41: Formula: (= v_l_6 1) InVars {} OutVars{l=v_l_6} AuxVars[] AssignedVars[l]" [2025-02-17 22:48:45,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1016682322, now seen corresponding path program 1 times [2025-02-17 22:48:45,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:45,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441449021] [2025-02-17 22:48:45,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:45,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:45,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-17 22:48:45,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-17 22:48:45,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:45,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:48:45,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441449021] [2025-02-17 22:48:45,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441449021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:48:45,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:48:45,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-17 22:48:45,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094631405] [2025-02-17 22:48:45,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:48:45,877 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:48:45,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2895716, now seen corresponding path program 3 times [2025-02-17 22:48:45,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:45,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077628164] [2025-02-17 22:48:45,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-17 22:48:45,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:45,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:45,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:45,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-17 22:48:45,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,881 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:45,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:45,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:45,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:45,910 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:45,911 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:45,911 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:45,911 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:45,911 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:45,911 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,911 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:45,911 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:45,911 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:48:45,911 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:45,911 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:45,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,939 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:45,939 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:45,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,942 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,943 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,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:45,944 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:45,958 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:45,958 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {l=1} Honda state: {l=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:48:45,966 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,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,968 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,968 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,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:45,970 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:45,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-17 22:48:45,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,988 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,989 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,990 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:45,990 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:46,052 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:46,056 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:46,056 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:46,056 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:46,056 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:46,056 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:46,056 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:46,056 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,056 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:46,056 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:46,056 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:48:46,056 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:46,056 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:46,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,079 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:46,079 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:46,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,081 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:46,082 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:46,082 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,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:46,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:46,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:46,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:46,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:46,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:46,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:46,094 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:46,099 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,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,101 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:46,102 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:46,103 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,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:46,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:46,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:46,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:46,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:46,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:46,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:46,115 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:46,117 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:48:46,117 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:46,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,125 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:46,126 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:46,126 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:46,126 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:46,126 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:46,126 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-02-17 22:48:46,132 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:46,133 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:46,134 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:46,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:46,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-17 22:48:46,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-17 22:48:46,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:46,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:46,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,212 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,212 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,213 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 141 states and 256 transitions. cyclomatic complexity: 132 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,248 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 141 states and 256 transitions. cyclomatic complexity: 132. 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 164 states and 287 transitions. Complement of second has 6 states. [2025-02-17 22:48:46,249 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,249 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,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2025-02-17 22:48:46,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 15 letters. Loop has 4 letters. [2025-02-17 22:48:46,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 19 letters. Loop has 4 letters. [2025-02-17 22:48:46,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 15 letters. Loop has 8 letters. [2025-02-17 22:48:46,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 287 transitions. [2025-02-17 22:48:46,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-17 22:48:46,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 129 states and 239 transitions. [2025-02-17 22:48:46,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-02-17 22:48:46,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-17 22:48:46,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 239 transitions. [2025-02-17 22:48:46,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:46,252 INFO L218 hiAutomatonCegarLoop]: Abstraction has 129 states and 239 transitions. [2025-02-17 22:48:46,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 239 transitions. [2025-02-17 22:48:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-02-17 22:48:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.8527131782945736) internal successors, (239), 128 states have internal predecessors, (239), 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,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 239 transitions. [2025-02-17 22:48:46,256 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 239 transitions. [2025-02-17 22:48:46,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:48:46,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-17 22:48:46,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-17 22:48:46,256 INFO L87 Difference]: Start difference. First operand 129 states and 239 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:48:46,289 INFO L93 Difference]: Finished difference Result 247 states and 411 transitions. [2025-02-17 22:48:46,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 247 states and 411 transitions. [2025-02-17 22:48:46,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-17 22:48:46,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 247 states to 190 states and 305 transitions. [2025-02-17 22:48:46,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2025-02-17 22:48:46,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-02-17 22:48:46,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 305 transitions. [2025-02-17 22:48:46,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:46,291 INFO L218 hiAutomatonCegarLoop]: Abstraction has 190 states and 305 transitions. [2025-02-17 22:48:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 305 transitions. [2025-02-17 22:48:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 152. [2025-02-17 22:48:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 152 states have (on average 1.6644736842105263) internal successors, (253), 151 states have internal predecessors, (253), 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,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 253 transitions. [2025-02-17 22:48:46,295 INFO L240 hiAutomatonCegarLoop]: Abstraction has 152 states and 253 transitions. [2025-02-17 22:48:46,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-17 22:48:46,296 INFO L432 stractBuchiCegarLoop]: Abstraction has 152 states and 253 transitions. [2025-02-17 22:48:46,296 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:48:46,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 253 transitions. [2025-02-17 22:48:46,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-17 22:48:46,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:46,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:46,297 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-17 22:48:46,297 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-17 22:48:46,297 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[55] 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[]" "[57] 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]" "[58] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[74] L13-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[64] L41-->L43: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[59] L30-->L32: Formula: (< v_x1_4 v_x2_1) InVars {x1=v_x1_4, x2=v_x2_1} OutVars{x1=v_x1_4, x2=v_x2_1} AuxVars[] AssignedVars[]" "[61] L32-->L30-2: Formula: (= v_x2_2 v_x1_5) InVars {x1=v_x1_5} OutVars{x1=v_x1_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[62] L30-2-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" "[66] L43-->L43-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[55] 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] L43-1-->L49: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[68] L49-->L41: Formula: (= v_l_6 1) InVars {} OutVars{l=v_l_6} AuxVars[] AssignedVars[l]" "[57] 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]" "[58] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[59] L30-->L32: Formula: (< v_x1_4 v_x2_1) InVars {x1=v_x1_4, x2=v_x2_1} OutVars{x1=v_x1_4, x2=v_x2_1} AuxVars[] AssignedVars[]" "[61] L32-->L30-2: Formula: (= v_x2_2 v_x1_5) InVars {x1=v_x1_5} OutVars{x1=v_x1_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[62] L30-2-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" "[55] 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[]" [2025-02-17 22:48:46,297 INFO L754 eck$LassoCheckResult]: Loop: "[64] L41-->L43: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[66] L43-->L43-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[67] L43-1-->L49: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[68] L49-->L41: Formula: (= v_l_6 1) InVars {} OutVars{l=v_l_6} AuxVars[] AssignedVars[l]" [2025-02-17 22:48:46,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,298 INFO L85 PathProgramCache]: Analyzing trace with hash 53303046, now seen corresponding path program 1 times [2025-02-17 22:48:46,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:46,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394928467] [2025-02-17 22:48:46,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:46,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:46,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-17 22:48:46,303 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,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:46,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:48:46,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394928467] [2025-02-17 22:48:46,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394928467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:48:46,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:48:46,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-17 22:48:46,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475014468] [2025-02-17 22:48:46,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:48:46,337 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:48:46,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2895716, now seen corresponding path program 4 times [2025-02-17 22:48:46,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:46,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492134938] [2025-02-17 22:48:46,337 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-17 22:48:46,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:46,339 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-02-17 22:48:46,340 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:46,340 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-17 22:48:46,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:46,340 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:46,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:46,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:46,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:46,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:46,362 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:46,362 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:46,362 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:46,362 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:46,362 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:46,362 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,362 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:46,362 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:46,362 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:48:46,362 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:46,362 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:46,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,386 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:46,386 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:46,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,388 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:46,389 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:46,391 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:46,391 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:46,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:46,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,409 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:46,411 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:46,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:46,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:46,477 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:46,481 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,481 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:46,481 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:46,481 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:46,481 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:46,481 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:46,481 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,481 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:46,481 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:46,481 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:48:46,481 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:46,481 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:46,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,514 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:46,514 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:46,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,516 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,517 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,518 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,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:46,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:46,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:46,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:46,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:46,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:46,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:46,530 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:46,533 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:46,533 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:46,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,535 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,535 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,536 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:46,536 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:46,536 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:46,536 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-02-17 22:48:46,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-17 22:48:46,542 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:46,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-17 22:48:46,564 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,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 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 4 of 4 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 unsat [2025-02-17 22:48:46,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,618 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,619 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,619 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 152 states and 253 transitions. cyclomatic complexity: 107 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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,649 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 152 states and 253 transitions. cyclomatic complexity: 107. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 199 states and 334 transitions. Complement of second has 7 states. [2025-02-17 22:48:46,649 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,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-02-17 22:48:46,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 4 letters. [2025-02-17 22:48:46,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,650 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-17 22:48:46,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-17 22:48:46,669 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,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:46,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:46,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,721 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,722 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:46,722 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 152 states and 253 transitions. cyclomatic complexity: 107 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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,760 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 152 states and 253 transitions. cyclomatic complexity: 107. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 200 states and 337 transitions. Complement of second has 9 states. [2025-02-17 22:48:46,760 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:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2025-02-17 22:48:46,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 19 letters. Loop has 4 letters. [2025-02-17 22:48:46,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,761 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-17 22:48:46,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-17 22:48:46,775 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,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:46,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:46,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,816 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,817 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:48:46,817 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 152 states and 253 transitions. cyclomatic complexity: 107 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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,850 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 152 states and 253 transitions. cyclomatic complexity: 107. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 519 states and 796 transitions. Complement of second has 17 states. [2025-02-17 22:48:46,851 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,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2025-02-17 22:48:46,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 19 letters. Loop has 4 letters. [2025-02-17 22:48:46,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 23 letters. Loop has 4 letters. [2025-02-17 22:48:46,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 19 letters. Loop has 8 letters. [2025-02-17 22:48:46,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 519 states and 796 transitions. [2025-02-17 22:48:46,854 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:46,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 519 states to 0 states and 0 transitions. [2025-02-17 22:48:46,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:48:46,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:48:46,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:48:46,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:48:46,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:46,854 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:46,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:48:46,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-17 22:48:46,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-17 22:48:46,855 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:48:46,855 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-02-17 22:48:46,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-02-17 22:48:46,855 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:46,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-02-17 22:48:46,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:48:46,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:48:46,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:48:46,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:48:46,855 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:46,855 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:46,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-17 22:48:46,855 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:46,855 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:48:46,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:48:46,855 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:46,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:48:46,860 INFO L201 PluginConnector]: Adding new model clock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:48:46 BoogieIcfgContainer [2025-02-17 22:48:46,860 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:48:46,860 INFO L158 Benchmark]: Toolchain (without parser) took 3345.59ms. Allocated memory is still 155.2MB. Free memory was 82.8MB in the beginning and 47.1MB in the end (delta: 35.8MB). Peak memory consumption was 35.6MB. Max. memory is 8.0GB. [2025-02-17 22:48:46,860 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:46,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.07ms. Allocated memory is still 155.2MB. Free memory was 82.8MB in the beginning and 81.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:46,861 INFO L158 Benchmark]: Boogie Preprocessor took 14.03ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 80.9MB in the end (delta: 680.1kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:46,861 INFO L158 Benchmark]: RCFGBuilder took 179.60ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 71.9MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:48:46,861 INFO L158 Benchmark]: BuchiAutomizer took 3124.90ms. Allocated memory is still 155.2MB. Free memory was 71.9MB in the beginning and 47.1MB in the end (delta: 24.9MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2025-02-17 22:48:46,862 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.15ms. Allocated memory is still 155.2MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.07ms. Allocated memory is still 155.2MB. Free memory was 82.8MB in the beginning and 81.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 14.03ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 80.9MB in the end (delta: 680.1kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 179.60ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 71.9MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3124.90ms. Allocated memory is still 155.2MB. Free memory was 71.9MB in the beginning and 47.1MB in the end (delta: 24.9MB). Peak memory consumption was 27.3MB. 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 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). 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 z + -1 * x2 and consists of 4 locations. One nondeterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 264 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 [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 202 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 173 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 308 IncrementalHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 108 mSDtfsCounter, 308 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp67 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq148 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 44ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 239, Trivial Ample Sets caused by loops: 13, Number of non-trivial ample sets: 34, Number of pruned transitions: 19, Number of transitions in reduction automaton: 115, Number of states in reduction automaton: 65, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:48:46,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-17 22:48:47,069 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:47,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...