/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/cnolock2.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:48:44,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:48:44,096 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:44,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:48:44,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:48:44,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:48:44,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:48:44,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:48:44,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:48:44,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:48:44,119 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:48:44,119 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:48:44,120 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:48:44,120 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:48:44,120 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:48:44,120 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:48:44,120 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:48:44,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:48:44,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:48:44,120 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:48:44,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:48:44,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:48:44,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:48:44,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:48:44,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:48:44,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:48:44,120 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:48:44,120 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:48:44,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:48:44,121 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:48:44,121 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:48:44,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:48:44,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:48:44,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:48:44,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:48:44,121 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:48:44,121 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:44,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:48:44,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:48:44,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:48:44,329 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:48:44,331 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:48:44,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/cnolock2.c.bpl [2025-02-17 22:48:44,332 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/cnolock2.c.bpl' [2025-02-17 22:48:44,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:48:44,347 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:48:44,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:44,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:48:44,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:48:44,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:44" (1/1) ... [2025-02-17 22:48:44,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:44" (1/1) ... [2025-02-17 22:48:44,362 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:48:44,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:44,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:48:44,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:48:44,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:48:44,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:44" (1/1) ... [2025-02-17 22:48:44,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:44" (1/1) ... [2025-02-17 22:48:44,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:44" (1/1) ... [2025-02-17 22:48:44,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:44" (1/1) ... [2025-02-17 22:48:44,370 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:44" (1/1) ... [2025-02-17 22:48:44,370 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:44" (1/1) ... [2025-02-17 22:48:44,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:44" (1/1) ... [2025-02-17 22:48:44,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:44" (1/1) ... [2025-02-17 22:48:44,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:44" (1/1) ... [2025-02-17 22:48:44,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:48:44,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:48:44,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:48:44,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:48:44,376 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:44" (1/1) ... [2025-02-17 22:48:44,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:44,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:44,403 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:44,406 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:44,422 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:48:44,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:48:44,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:48:44,423 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:48:44,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:48:44,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:48:44,423 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:48:44,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:48:44,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:48:44,424 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:44,460 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:48:44,461 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:48:44,514 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:48:44,515 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:48:44,524 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:48:44,524 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:48:44,525 INFO L201 PluginConnector]: Adding new model cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:44 BoogieIcfgContainer [2025-02-17 22:48:44,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:48:44,526 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:48:44,526 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:48:44,533 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:48:44,533 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:44,534 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:44" (1/2) ... [2025-02-17 22:48:44,535 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6205cb0b and model type cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:48:44, skipping insertion in model container [2025-02-17 22:48:44,535 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:44,535 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:44" (2/2) ... [2025-02-17 22:48:44,536 INFO L363 chiAutomizerObserver]: Analyzing ICFG cnolock2.c.bpl [2025-02-17 22:48:44,589 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:48:44,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 20 transitions, 54 flow [2025-02-17 22:48:44,651 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-02-17 22:48:44,653 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:48:44,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 3/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 14. Up to 3 conditions per place. [2025-02-17 22:48:44,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 20 transitions, 54 flow [2025-02-17 22:48:44,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 44 flow [2025-02-17 22:48:44,667 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:48:44,796 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:48:44,797 INFO L101 AmpleReduction]: Number of pruned transitions: 8, Number of non-trivial ample sets: 21 [2025-02-17 22:48:44,797 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 16 [2025-02-17 22:48:44,802 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:48:44,802 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:48:44,802 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:48:44,802 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:48:44,802 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:48:44,802 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:48:44,802 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:48:44,802 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:48:44,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 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,813 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 26 [2025-02-17 22:48:44,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:44,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:44,816 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:48:44,816 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:44,816 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:48:44,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 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,818 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 26 [2025-02-17 22:48:44,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:44,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:44,818 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:48:44,818 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:44,821 INFO L752 eck$LassoCheckResult]: Stem: "[55] $Ultimate##0-->L25-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:48:44,822 INFO L754 eck$LassoCheckResult]: Loop: "[43] L25-2-->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[]" "[45] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[47] L25-->L25-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[]" [2025-02-17 22:48:44,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:44,825 INFO L85 PathProgramCache]: Analyzing trace with hash 86, now seen corresponding path program 1 times [2025-02-17 22:48:44,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:44,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609714712] [2025-02-17 22:48:44,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:44,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:44,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:48:44,879 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,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,880 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:44,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:48:44,884 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,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:44,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:44,896 INFO L85 PathProgramCache]: Analyzing trace with hash 72556, now seen corresponding path program 1 times [2025-02-17 22:48:44,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:44,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573824669] [2025-02-17 22:48:44,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:44,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:44,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:44,903 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,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:44,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:44,907 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,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:44,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:44,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2604791, now seen corresponding path program 1 times [2025-02-17 22:48:44,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:44,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225578906] [2025-02-17 22:48:44,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:44,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:44,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:44,922 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,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:44,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:44,950 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,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:44,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:44,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:44,999 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:45,000 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:45,000 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:45,000 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:45,000 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:45,000 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,001 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:45,001 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:45,001 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:45,001 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:45,001 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:45,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,055 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:45,055 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:45,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,059 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:45,060 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:45,063 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:45,064 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:45,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-17 22:48:45,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,090 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:45,091 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:45,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:45,093 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:45,194 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:45,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:45,203 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:45,203 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:45,203 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:45,203 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:45,203 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:45,203 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,203 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:45,203 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:45,203 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:45,204 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:45,204 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:45,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,242 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:45,246 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:45,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,249 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:45,251 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:45,252 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,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:45,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:45,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:45,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:45,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:45,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:45,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:45,272 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:45,294 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:45,295 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:45,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,297 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:45,299 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:45,300 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:45,301 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:45,301 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:45,301 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:48:45,307 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:45,310 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:45,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:48:45,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:48:45,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:45,344 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:45,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:45,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:45,355 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,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:45,355 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:45,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:45,447 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:45,466 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,483 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,484 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 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,549 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 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 88 states and 185 transitions. Complement of second has 6 states. [2025-02-17 22:48:45,551 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,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2025-02-17 22:48:45,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 1 letters. Loop has 3 letters. [2025-02-17 22:48:45,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 4 letters. Loop has 3 letters. [2025-02-17 22:48:45,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 1 letters. Loop has 6 letters. [2025-02-17 22:48:45,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 185 transitions. [2025-02-17 22:48:45,566 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-02-17 22:48:45,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 42 states and 97 transitions. [2025-02-17 22:48:45,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-02-17 22:48:45,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-02-17 22:48:45,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 97 transitions. [2025-02-17 22:48:45,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:45,572 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 97 transitions. [2025-02-17 22:48:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 97 transitions. [2025-02-17 22:48:45,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2025-02-17 22:48:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 33 states have internal predecessors, (78), 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,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 78 transitions. [2025-02-17 22:48:45,589 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 78 transitions. [2025-02-17 22:48:45,589 INFO L432 stractBuchiCegarLoop]: Abstraction has 34 states and 78 transitions. [2025-02-17 22:48:45,589 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:48:45,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 78 transitions. [2025-02-17 22:48:45,590 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-02-17 22:48:45,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:45,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:45,590 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:48:45,590 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:45,591 INFO L752 eck$LassoCheckResult]: Stem: "[55] $Ultimate##0-->L25-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[58] L13-->L35: 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:45,591 INFO L754 eck$LassoCheckResult]: Loop: "[50] L35-->L37: 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[]" "[52] L37-->L35: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" [2025-02-17 22:48:45,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2724, now seen corresponding path program 1 times [2025-02-17 22:48:45,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:45,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508994244] [2025-02-17 22:48:45,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:45,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:45,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:45,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:45,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,594 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:45,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:45,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:45,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:45,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2025-02-17 22:48:45,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:45,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367265956] [2025-02-17 22:48:45,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:45,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:45,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:45,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:45,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,600 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:45,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:45,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:45,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:45,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2619366, now seen corresponding path program 1 times [2025-02-17 22:48:45,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:45,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425511831] [2025-02-17 22:48:45,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:45,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:45,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:45,606 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,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:45,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:45,609 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,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:45,624 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:45,624 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:45,624 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:45,624 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:45,624 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:45,624 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,624 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:45,624 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:45,624 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:45,624 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:45,624 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:45,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,646 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:45,646 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:45,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,649 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:45,649 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:45,650 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:45,650 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:45,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-17 22:48:45,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,669 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:45,670 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:45,670 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:45,670 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:45,733 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:45,737 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:45,738 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:45,738 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:45,738 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:45,738 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:45,738 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:45,738 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,738 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:45,738 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:45,738 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:45,738 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:45,738 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:45,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,759 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:45,760 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:45,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,762 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,763 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,764 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,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:45,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:45,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:45,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:45,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:45,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:45,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:45,779 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:45,783 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:45,783 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:45,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,786 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,787 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,787 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:45,788 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:45,788 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:45,788 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-02-17 22:48:45,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:45,794 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:45,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:45,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:45,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:45,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:45,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:45,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:45,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:45,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:45,821 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:45,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:45,834 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,834 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:48:45,835 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 78 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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,870 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 78 transitions. cyclomatic complexity: 53. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 108 states and 245 transitions. Complement of second has 7 states. [2025-02-17 22:48:45,871 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,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2025-02-17 22:48:45,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:48:45,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:48:45,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:48:45,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:45,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 245 transitions. [2025-02-17 22:48:45,874 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-02-17 22:48:45,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 70 states and 162 transitions. [2025-02-17 22:48:45,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-02-17 22:48:45,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-02-17 22:48:45,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 162 transitions. [2025-02-17 22:48:45,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:45,875 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 162 transitions. [2025-02-17 22:48:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 162 transitions. [2025-02-17 22:48:45,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2025-02-17 22:48:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.3484848484848486) internal successors, (155), 65 states have internal predecessors, (155), 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,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 155 transitions. [2025-02-17 22:48:45,878 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 155 transitions. [2025-02-17 22:48:45,878 INFO L432 stractBuchiCegarLoop]: Abstraction has 66 states and 155 transitions. [2025-02-17 22:48:45,878 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:48:45,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 155 transitions. [2025-02-17 22:48:45,879 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-02-17 22:48:45,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:45,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:45,879 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-17 22:48:45,879 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:45,880 INFO L752 eck$LassoCheckResult]: Stem: "[55] $Ultimate##0-->L25-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[58] L13-->L35: 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]" "[43] L25-2-->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[]" "[45] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[46] L25-->L27: 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[]" "[48] L27-->L25-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,880 INFO L754 eck$LassoCheckResult]: Loop: "[50] L35-->L37: 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[]" "[52] L37-->L35: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" [2025-02-17 22:48:45,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1777970360, now seen corresponding path program 1 times [2025-02-17 22:48:45,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:45,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743314929] [2025-02-17 22:48:45,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:45,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:45,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:45,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:45,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:45,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:45,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:45,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:45,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2025-02-17 22:48:45,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:45,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143542907] [2025-02-17 22:48:45,887 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:45,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:45,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:45,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:45,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:48:45,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:45,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:45,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:45,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:45,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash 767469450, now seen corresponding path program 1 times [2025-02-17 22:48:45,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:45,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339032859] [2025-02-17 22:48:45,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:45,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:45,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:45,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:45,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,901 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:45,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:45,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:45,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:45,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:45,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:45,926 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:45,927 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:45,927 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:45,927 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:45,927 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:45,927 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,927 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:45,927 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:45,927 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:48:45,927 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:45,927 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:45,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:45,944 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:45,944 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:45,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,946 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,946 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,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:45,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:45,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-17 22:48:45,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:45,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:45,965 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,966 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,967 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:45,967 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:46,029 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:46,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-17 22:48:46,033 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:46,033 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:46,033 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:46,033 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:46,033 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:46,033 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,033 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:46,033 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:46,033 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:48:46,033 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:46,033 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:46,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,046 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:46,046 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:46,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,048 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:46,048 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:46,049 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,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:46,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:46,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:46,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:46,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:46,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:46,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:46,061 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:46,063 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:48:46,063 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:46,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,065 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:46,066 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:46,067 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:46,067 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:46,067 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:46,067 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-02-17 22:48:46,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:46,073 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:46,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:46,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:46,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:46,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:46,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,101 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,112 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,112 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:48:46,112 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 155 transitions. cyclomatic complexity: 104 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:46,169 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 155 transitions. cyclomatic complexity: 104. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 298 states and 700 transitions. Complement of second has 7 states. [2025-02-17 22:48:46,171 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,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2025-02-17 22:48:46,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:48:46,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:48:46,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 6 letters. Loop has 4 letters. [2025-02-17 22:48:46,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 298 states and 700 transitions. [2025-02-17 22:48:46,179 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-02-17 22:48:46,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 298 states to 203 states and 473 transitions. [2025-02-17 22:48:46,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2025-02-17 22:48:46,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-02-17 22:48:46,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 203 states and 473 transitions. [2025-02-17 22:48:46,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:46,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 203 states and 473 transitions. [2025-02-17 22:48:46,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states and 473 transitions. [2025-02-17 22:48:46,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 116. [2025-02-17 22:48:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 2.353448275862069) internal successors, (273), 115 states have internal predecessors, (273), 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,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 273 transitions. [2025-02-17 22:48:46,189 INFO L240 hiAutomatonCegarLoop]: Abstraction has 116 states and 273 transitions. [2025-02-17 22:48:46,189 INFO L432 stractBuchiCegarLoop]: Abstraction has 116 states and 273 transitions. [2025-02-17 22:48:46,189 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:48:46,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 273 transitions. [2025-02-17 22:48:46,190 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-02-17 22:48:46,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:46,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:46,190 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1] [2025-02-17 22:48:46,190 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:46,191 INFO L752 eck$LassoCheckResult]: Stem: "[55] $Ultimate##0-->L25-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[58] L13-->L35: 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]" "[43] L25-2-->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[]" "[45] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[46] L25-->L27: 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[]" "[48] L27-->L25-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]" "[43] L25-2-->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[]" "[45] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[46] L25-->L27: 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[]" "[48] L27-->L25-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:46,191 INFO L754 eck$LassoCheckResult]: Loop: "[50] L35-->L37: 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[]" "[52] L37-->L35: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" [2025-02-17 22:48:46,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1196447252, now seen corresponding path program 2 times [2025-02-17 22:48:46,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:46,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025417247] [2025-02-17 22:48:46,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:46,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:46,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-17 22:48:46,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:48:46,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-17 22:48:46,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,257 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:46,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:48:46,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025417247] [2025-02-17 22:48:46,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025417247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:48:46,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:48:46,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-17 22:48:46,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601370473] [2025-02-17 22:48:46,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:48:46,260 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:48:46,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 3 times [2025-02-17 22:48:46,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:46,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871758678] [2025-02-17 22:48:46,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-17 22:48:46,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:46,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:46,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:46,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-17 22:48:46,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:46,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:46,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:46,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:46,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:46,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:46,277 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:46,277 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:46,277 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:46,277 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:46,277 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:46,277 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,277 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:46,277 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:46,277 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:48:46,277 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:46,277 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:46,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,300 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:46,300 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:46,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,302 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:46,303 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:46,304 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:46,305 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:46,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:46,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,323 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:46,323 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:46,324 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:46,324 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:46,388 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:46,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-17 22:48:46,393 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:46,393 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:46,393 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:46,393 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:46,393 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:46,393 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,393 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:46,393 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:46,393 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:48:46,393 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:46,393 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:46,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:46,410 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:46,411 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:46,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,413 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:46,414 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:46,415 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,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:46,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:46,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:46,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:46,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:46,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:46,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:46,428 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:46,431 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:46,431 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:46,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:46,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:46,433 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:46,435 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:46,436 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:46,436 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:46,436 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:46,436 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-02-17 22:48:46,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:46,443 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:46,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:48:46,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:48:46,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:46,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:46,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,470 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,481 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,481 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:48:46,482 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 116 states and 273 transitions. cyclomatic complexity: 181 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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,526 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 116 states and 273 transitions. cyclomatic complexity: 181. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 211 states and 492 transitions. Complement of second has 7 states. [2025-02-17 22:48:46,527 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,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2025-02-17 22:48:46,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:48:46,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,529 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-17 22:48:46,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:48:46,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:48:46,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:46,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:46,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,563 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,574 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,575 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:48:46,575 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 116 states and 273 transitions. cyclomatic complexity: 181 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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,605 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 116 states and 273 transitions. cyclomatic complexity: 181. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 211 states and 492 transitions. Complement of second has 7 states. [2025-02-17 22:48:46,605 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,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2025-02-17 22:48:46,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:48:46,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,606 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-17 22:48:46,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:46,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:48:46,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:48:46,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:46,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:46,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:46,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:46,641 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:46,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:46,652 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,652 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:48:46,652 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 116 states and 273 transitions. cyclomatic complexity: 181 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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,692 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 116 states and 273 transitions. cyclomatic complexity: 181. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 271 states and 639 transitions. Complement of second has 7 states. [2025-02-17 22:48:46,692 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,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2025-02-17 22:48:46,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:48:46,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 12 letters. Loop has 2 letters. [2025-02-17 22:48:46,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 10 letters. Loop has 4 letters. [2025-02-17 22:48:46,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:46,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 639 transitions. [2025-02-17 22:48:46,696 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:46,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 0 states and 0 transitions. [2025-02-17 22:48:46,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:48:46,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:48:46,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:48:46,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:48:46,696 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:46,696 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:46,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:48:46,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-17 22:48:46,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-17 22:48:46,698 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:48:46,700 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-02-17 22:48:46,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-02-17 22:48:46,700 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:46,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-02-17 22:48:46,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:48:46,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:48:46,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:48:46,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:48:46,700 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:46,700 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:46,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-17 22:48:46,700 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:46,700 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:48:46,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:48:46,701 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:46,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:48:46,705 INFO L201 PluginConnector]: Adding new model cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:48:46 BoogieIcfgContainer [2025-02-17 22:48:46,705 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:48:46,706 INFO L158 Benchmark]: Toolchain (without parser) took 2359.51ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 86.7MB in the beginning and 40.2MB in the end (delta: 46.5MB). Peak memory consumption was 55.5MB. Max. memory is 8.0GB. [2025-02-17 22:48:46,706 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:46,706 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.62ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 85.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:46,706 INFO L158 Benchmark]: Boogie Preprocessor took 10.49ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 84.8MB in the end (delta: 625.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:46,707 INFO L158 Benchmark]: RCFGBuilder took 149.92ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 76.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:48:46,707 INFO L158 Benchmark]: BuchiAutomizer took 2179.80ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 76.2MB in the beginning and 40.2MB in the end (delta: 36.0MB). Peak memory consumption was 47.1MB. Max. memory is 8.0GB. [2025-02-17 22:48:46,708 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.17ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 16.62ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 85.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 10.49ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 84.8MB in the end (delta: 625.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 149.92ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 76.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2179.80ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 76.2MB in the beginning and 40.2MB in the end (delta: 36.0MB). Peak memory consumption was 47.1MB. 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 5 terminating modules (1 trivial, 3 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 nondeterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 99 StatesRemovedByMinimization, 3 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 [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 202 IncrementalHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 68 mSDtfsCounter, 202 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq147 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 53ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 179, Trivial Ample Sets caused by loops: 16, Number of non-trivial ample sets: 21, Number of pruned transitions: 8, Number of transitions in reduction automaton: 68, Number of states in reduction automaton: 37, 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,717 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:46,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:47,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:47,319 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...