/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/lock2.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:48:48,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:48:48,221 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:48,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:48:48,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:48:48,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:48:48,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:48:48,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:48:48,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:48:48,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:48:48,241 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:48:48,241 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:48:48,241 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:48:48,241 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:48:48,241 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:48:48,242 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:48:48,242 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:48:48,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:48:48,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:48:48,242 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:48:48,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:48:48,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:48:48,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:48:48,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:48:48,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:48:48,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:48:48,242 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:48:48,242 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:48:48,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:48:48,242 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:48:48,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:48:48,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:48:48,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:48:48,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:48:48,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:48:48,243 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:48:48,243 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:48,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:48:48,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:48:48,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:48:48,480 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:48:48,483 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:48:48,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/lock2.c.bpl [2025-02-17 22:48:48,485 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/lock2.c.bpl' [2025-02-17 22:48:48,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:48:48,502 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:48:48,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:48,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:48:48,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:48:48,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:48" (1/1) ... [2025-02-17 22:48:48,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:48" (1/1) ... [2025-02-17 22:48:48,523 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:48:48,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:48,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:48:48,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:48:48,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:48:48,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:48" (1/1) ... [2025-02-17 22:48:48,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:48" (1/1) ... [2025-02-17 22:48:48,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:48" (1/1) ... [2025-02-17 22:48:48,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:48" (1/1) ... [2025-02-17 22:48:48,531 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:48" (1/1) ... [2025-02-17 22:48:48,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:48" (1/1) ... [2025-02-17 22:48:48,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:48" (1/1) ... [2025-02-17 22:48:48,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:48" (1/1) ... [2025-02-17 22:48:48,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:48" (1/1) ... [2025-02-17 22:48:48,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:48:48,537 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:48:48,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:48:48,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:48:48,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:48" (1/1) ... [2025-02-17 22:48:48,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:48,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:48,562 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:48,567 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:48,582 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:48:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:48:48,583 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:48:48,583 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:48:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:48:48,583 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:48:48,583 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:48:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:48:48,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:48:48,584 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:48,622 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:48:48,623 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:48:48,695 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:48:48,695 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:48:48,707 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:48:48,708 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:48:48,708 INFO L201 PluginConnector]: Adding new model lock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:48 BoogieIcfgContainer [2025-02-17 22:48:48,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:48:48,711 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:48:48,711 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:48:48,716 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:48:48,716 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:48,717 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:48" (1/2) ... [2025-02-17 22:48:48,718 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14171ead and model type lock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:48:48, skipping insertion in model container [2025-02-17 22:48:48,718 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:48,719 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:48" (2/2) ... [2025-02-17 22:48:48,720 INFO L363 chiAutomizerObserver]: Analyzing ICFG lock2.c.bpl [2025-02-17 22:48:48,776 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:48:48,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 26 transitions, 66 flow [2025-02-17 22:48:48,842 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-02-17 22:48:48,843 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:48:48,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 3/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-02-17 22:48:48,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 26 transitions, 66 flow [2025-02-17 22:48:48,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 56 flow [2025-02-17 22:48:48,858 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:48:49,077 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:48:49,077 INFO L101 AmpleReduction]: Number of pruned transitions: 30, Number of non-trivial ample sets: 50 [2025-02-17 22:48:49,078 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 31 [2025-02-17 22:48:49,087 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:48:49,087 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:48:49,087 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:48:49,087 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:48:49,087 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:48:49,087 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:48:49,087 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:48:49,087 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:48:49,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 79 states, 78 states have (on average 1.7307692307692308) internal successors, (135), 78 states have internal predecessors, (135), 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:49,101 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 50 [2025-02-17 22:48:49,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:49,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:49,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:48:49,104 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:49,105 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:48:49,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 79 states, 78 states have (on average 1.7307692307692308) internal successors, (135), 78 states have internal predecessors, (135), 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:49,107 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 50 [2025-02-17 22:48:49,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:49,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:49,107 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:48:49,107 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:49,111 INFO L752 eck$LassoCheckResult]: Stem: "[82] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[60] $Ultimate##0-->L27: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" [2025-02-17 22:48:49,111 INFO L754 eck$LassoCheckResult]: Loop: "[62] L27-->L29: Formula: (< v_x1_1 v_z_2) InVars {x1=v_x1_1, z=v_z_2} OutVars{x1=v_x1_1, z=v_z_2} AuxVars[] AssignedVars[]" "[64] L29-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[67] L30-->L27: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" [2025-02-17 22:48:49,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:49,115 INFO L85 PathProgramCache]: Analyzing trace with hash 3563, now seen corresponding path program 1 times [2025-02-17 22:48:49,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:49,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248016931] [2025-02-17 22:48:49,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:49,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:49,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:49,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:49,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:49,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:49,167 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:49,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:49,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:49,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:49,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:49,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:49,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:49,187 INFO L85 PathProgramCache]: Analyzing trace with hash 91424, now seen corresponding path program 1 times [2025-02-17 22:48:49,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:49,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910053674] [2025-02-17 22:48:49,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:49,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:49,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:49,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:49,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:49,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:49,198 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:49,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:49,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:49,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:49,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:49,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:49,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:49,207 INFO L85 PathProgramCache]: Analyzing trace with hash 106206966, now seen corresponding path program 1 times [2025-02-17 22:48:49,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:49,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503384409] [2025-02-17 22:48:49,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:49,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:49,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:49,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:49,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:49,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:49,211 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:49,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:49,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:49,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:49,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:49,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:49,256 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:49,257 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:49,257 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:49,257 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:49,257 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:49,257 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:49,257 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:49,258 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:49,258 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock2.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:49,258 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:49,258 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:49,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:49,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:49,317 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:49,318 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:49,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:49,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:49,321 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:49,325 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:49,326 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:49,326 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:49,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:49,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:49,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:49,349 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:49,351 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:49,352 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:49,352 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:49,425 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:49,429 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:49,430 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:49,430 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:49,430 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:49,430 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:49,430 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:49,430 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:49,430 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:49,430 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:49,430 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock2.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:49,430 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:49,430 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:49,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:49,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:49,471 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:49,474 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:49,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:49,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:49,477 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:49,504 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:49,508 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:49,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:49,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:49,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:49,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:49,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:49,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:49,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:49,532 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:49,537 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:49,538 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:49,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:49,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:49,541 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:49,543 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:49,544 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:49,545 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:49,545 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:49,545 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:48:49,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:49,553 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:49,585 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:49,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:49,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:49,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:49,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:49,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:49,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:49,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:49,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:49,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:49,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:49,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:49,616 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:49,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:49,671 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:49,714 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:49,716 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 79 states, 78 states have (on average 1.7307692307692308) internal successors, (135), 78 states have internal predecessors, (135), 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.25) internal successors, (5), 4 states have internal predecessors, (5), 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:49,806 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 79 states, 78 states have (on average 1.7307692307692308) internal successors, (135), 78 states have internal predecessors, (135), 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.25) internal successors, (5), 4 states have internal predecessors, (5), 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 241 states and 442 transitions. Complement of second has 7 states. [2025-02-17 22:48:49,809 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:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-02-17 22:48:49,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 2 letters. Loop has 3 letters. [2025-02-17 22:48:49,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:49,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-17 22:48:49,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:49,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 2 letters. Loop has 6 letters. [2025-02-17 22:48:49,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:49,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 442 transitions. [2025-02-17 22:48:49,829 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 56 [2025-02-17 22:48:49,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 163 states and 315 transitions. [2025-02-17 22:48:49,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2025-02-17 22:48:49,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2025-02-17 22:48:49,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 163 states and 315 transitions. [2025-02-17 22:48:49,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:49,840 INFO L218 hiAutomatonCegarLoop]: Abstraction has 163 states and 315 transitions. [2025-02-17 22:48:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states and 315 transitions. [2025-02-17 22:48:49,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 115. [2025-02-17 22:48:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 2.017391304347826) internal successors, (232), 114 states have internal predecessors, (232), 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:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 232 transitions. [2025-02-17 22:48:49,868 INFO L240 hiAutomatonCegarLoop]: Abstraction has 115 states and 232 transitions. [2025-02-17 22:48:49,868 INFO L432 stractBuchiCegarLoop]: Abstraction has 115 states and 232 transitions. [2025-02-17 22:48:49,868 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:48:49,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 232 transitions. [2025-02-17 22:48:49,871 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 44 [2025-02-17 22:48:49,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:49,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:49,871 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:49,871 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:49,872 INFO L752 eck$LassoCheckResult]: Stem: "[82] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[79] L13-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[70] $Ultimate##0-->L47: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" [2025-02-17 22:48:49,872 INFO L754 eck$LassoCheckResult]: Loop: "[72] L47-->L49: Formula: (< v_x2_3 v_z_5) InVars {x2=v_x2_3, z=v_z_5} OutVars{x2=v_x2_3, z=v_z_5} AuxVars[] AssignedVars[]" "[74] L49-->L50: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[76] L50-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-02-17 22:48:49,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:49,872 INFO L85 PathProgramCache]: Analyzing trace with hash 111112, now seen corresponding path program 1 times [2025-02-17 22:48:49,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:49,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616670466] [2025-02-17 22:48:49,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:49,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:49,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:49,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:49,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:49,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:49,880 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:49,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:49,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:49,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:49,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:49,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:49,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:49,887 INFO L85 PathProgramCache]: Analyzing trace with hash 101353, now seen corresponding path program 1 times [2025-02-17 22:48:49,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:49,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533284309] [2025-02-17 22:48:49,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:49,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:49,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:49,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:49,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:49,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:49,892 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:49,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:49,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:49,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:49,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:49,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:49,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:49,895 INFO L85 PathProgramCache]: Analyzing trace with hash -984758142, now seen corresponding path program 1 times [2025-02-17 22:48:49,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:49,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957826080] [2025-02-17 22:48:49,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:49,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:49,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:49,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:49,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:49,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:49,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:49,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:49,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:49,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:49,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:49,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:49,934 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:49,934 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:49,934 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:49,934 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:49,934 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:49,934 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:49,934 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:49,934 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:49,934 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock2.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:49,934 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:49,934 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:49,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:49,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:49,965 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:49,965 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:49,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:49,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:49,967 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:49,969 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:49,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:49,970 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:49,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:49,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:49,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:49,994 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:49,996 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:49,997 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:49,997 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:50,027 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:50,027 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x1=0} Honda state: {x1=0} Generalized eigenvectors: [{x1=-1}, {x1=7}, {x1=-7}] Lambdas: [1, 2, 1] Nus: [0, 1] [2025-02-17 22:48:50,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:50,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:50,038 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:50,041 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:50,043 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:50,043 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:50,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-17 22:48:50,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:50,062 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:50,064 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:50,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:50,066 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:50,138 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:50,144 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:50,144 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:50,144 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:50,144 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:50,144 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:50,144 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:50,144 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,145 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:50,145 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:50,145 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock2.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:50,145 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:50,146 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:50,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:50,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:50,183 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:50,183 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:50,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:50,189 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:50,193 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:50,194 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:50,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:50,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:50,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:50,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:50,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:50,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:50,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:50,213 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:50,219 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:50,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:50,223 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:50,224 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:50,226 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:50,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:50,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:50,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:50,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:50,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:50,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:50,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:50,242 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:50,246 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:50,246 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:50,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:50,248 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:50,250 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:50,250 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:50,250 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:50,251 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:50,251 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-02-17 22:48:50,258 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:50,259 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:50,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:50,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:50,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:50,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:50,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:50,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:50,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:50,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:50,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:50,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:50,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:50,285 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:50,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:50,320 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:50,321 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:50,321 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 115 states and 232 transitions. cyclomatic complexity: 138 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:50,380 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 115 states and 232 transitions. cyclomatic complexity: 138. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 347 states and 667 transitions. Complement of second has 7 states. [2025-02-17 22:48:50,381 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:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2025-02-17 22:48:50,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 3 letters. Loop has 3 letters. [2025-02-17 22:48:50,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:50,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 6 letters. Loop has 3 letters. [2025-02-17 22:48:50,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:50,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 3 letters. Loop has 6 letters. [2025-02-17 22:48:50,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:50,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 347 states and 667 transitions. [2025-02-17 22:48:50,387 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 53 [2025-02-17 22:48:50,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 347 states to 263 states and 525 transitions. [2025-02-17 22:48:50,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 128 [2025-02-17 22:48:50,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2025-02-17 22:48:50,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 525 transitions. [2025-02-17 22:48:50,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:50,393 INFO L218 hiAutomatonCegarLoop]: Abstraction has 263 states and 525 transitions. [2025-02-17 22:48:50,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 525 transitions. [2025-02-17 22:48:50,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 201. [2025-02-17 22:48:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 201 states have (on average 2.109452736318408) internal successors, (424), 200 states have internal predecessors, (424), 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:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 424 transitions. [2025-02-17 22:48:50,405 INFO L240 hiAutomatonCegarLoop]: Abstraction has 201 states and 424 transitions. [2025-02-17 22:48:50,405 INFO L432 stractBuchiCegarLoop]: Abstraction has 201 states and 424 transitions. [2025-02-17 22:48:50,405 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:48:50,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 424 transitions. [2025-02-17 22:48:50,406 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 47 [2025-02-17 22:48:50,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:50,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:50,406 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:48:50,406 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:50,407 INFO L752 eck$LassoCheckResult]: Stem: "[82] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[60] $Ultimate##0-->L27: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[61] L27-->L32: Formula: (<= v_z_3 v_x1_4) InVars {x1=v_x1_4, z=v_z_3} OutVars{x1=v_x1_4, z=v_z_3} AuxVars[] AssignedVars[]" "[63] L32-->L33-1: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" [2025-02-17 22:48:50,407 INFO L754 eck$LassoCheckResult]: Loop: "[66] L33-1-->L35: Formula: (< v_x3_2 v_z_4) InVars {x3=v_x3_2, z=v_z_4} OutVars{x3=v_x3_2, z=v_z_4} AuxVars[] AssignedVars[]" "[69] L35-->L33-1: Formula: (= (+ v_x3_4 1) v_x3_3) InVars {x3=v_x3_4} OutVars{x3=v_x3_3} AuxVars[] AssignedVars[x3]" [2025-02-17 22:48:50,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:50,407 INFO L85 PathProgramCache]: Analyzing trace with hash 3425997, now seen corresponding path program 1 times [2025-02-17 22:48:50,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:50,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677499650] [2025-02-17 22:48:50,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:50,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:50,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:50,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:50,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:50,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:50,410 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:50,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:50,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:50,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:50,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:50,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:50,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash 3076, now seen corresponding path program 1 times [2025-02-17 22:48:50,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:50,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852947649] [2025-02-17 22:48:50,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:50,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:50,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:50,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:50,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:50,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:50,415 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:50,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:50,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:50,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:50,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:50,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:50,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:50,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1002582064, now seen corresponding path program 1 times [2025-02-17 22:48:50,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:50,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268083224] [2025-02-17 22:48:50,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:50,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:50,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:50,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:50,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:50,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:50,421 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:50,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:50,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:50,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:50,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:50,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:50,437 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:50,437 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:50,437 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:50,437 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:50,437 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:50,437 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,437 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:50,437 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:50,437 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock2.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:48:50,437 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:50,437 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:50,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:50,456 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:50,456 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:50,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:50,458 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:50,462 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:50,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:50,463 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:50,484 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:50,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:50,487 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:50,488 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:50,489 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:50,489 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:50,561 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:50,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-17 22:48:50,566 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:50,566 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:50,566 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:50,566 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:50,566 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:50,567 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,567 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:50,567 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:50,567 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock2.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:48:50,567 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:50,567 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:50,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:50,596 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:50,596 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:50,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:50,604 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:50,606 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:50,607 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:50,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:50,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:50,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:50,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:50,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:50,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:50,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:50,620 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:50,622 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:48:50,622 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:50,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:50,624 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:50,625 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:50,626 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:50,626 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:50,626 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:50,626 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-02-17 22:48:50,631 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:50,632 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:50,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:50,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:50,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:50,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:50,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:50,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:50,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:50,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:50,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:50,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:50,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:50,663 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:50,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:50,678 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:50,678 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:50,679 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 424 transitions. cyclomatic complexity: 251 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:50,725 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 424 transitions. cyclomatic complexity: 251. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 281 states and 582 transitions. Complement of second has 6 states. [2025-02-17 22:48:50,726 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:50,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:50,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2025-02-17 22:48:50,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:48:50,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:50,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:48:50,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:50,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-17 22:48:50,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:50,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 281 states and 582 transitions. [2025-02-17 22:48:50,732 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 27 [2025-02-17 22:48:50,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 281 states to 153 states and 306 transitions. [2025-02-17 22:48:50,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2025-02-17 22:48:50,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2025-02-17 22:48:50,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 306 transitions. [2025-02-17 22:48:50,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:50,735 INFO L218 hiAutomatonCegarLoop]: Abstraction has 153 states and 306 transitions. [2025-02-17 22:48:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 306 transitions. [2025-02-17 22:48:50,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2025-02-17 22:48:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 149 states have (on average 2.0134228187919465) internal successors, (300), 148 states have internal predecessors, (300), 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:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 300 transitions. [2025-02-17 22:48:50,740 INFO L240 hiAutomatonCegarLoop]: Abstraction has 149 states and 300 transitions. [2025-02-17 22:48:50,740 INFO L432 stractBuchiCegarLoop]: Abstraction has 149 states and 300 transitions. [2025-02-17 22:48:50,740 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:48:50,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 300 transitions. [2025-02-17 22:48:50,741 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 27 [2025-02-17 22:48:50,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:50,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:50,741 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:48:50,742 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:50,742 INFO L752 eck$LassoCheckResult]: Stem: "[82] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[60] $Ultimate##0-->L27: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[79] L13-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[70] $Ultimate##0-->L47: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[72] L47-->L49: Formula: (< v_x2_3 v_z_5) InVars {x2=v_x2_3, z=v_z_5} OutVars{x2=v_x2_3, z=v_z_5} AuxVars[] AssignedVars[]" "[74] L49-->L50: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[76] L50-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[71] L47-->L52: Formula: (<= v_z_6 v_x2_6) InVars {x2=v_x2_6, z=v_z_6} OutVars{x2=v_x2_6, z=v_z_6} AuxVars[] AssignedVars[]" [2025-02-17 22:48:50,742 INFO L754 eck$LassoCheckResult]: Loop: "[62] L27-->L29: Formula: (< v_x1_1 v_z_2) InVars {x1=v_x1_1, z=v_z_2} OutVars{x1=v_x1_1, z=v_z_2} AuxVars[] AssignedVars[]" "[64] L29-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[67] L30-->L27: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" [2025-02-17 22:48:50,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:50,742 INFO L85 PathProgramCache]: Analyzing trace with hash -886713857, now seen corresponding path program 1 times [2025-02-17 22:48:50,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:50,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459303510] [2025-02-17 22:48:50,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:50,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:50,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:50,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:50,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:50,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-17 22:48:50,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:48:50,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459303510] [2025-02-17 22:48:50,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459303510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:48:50,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:48:50,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:48:50,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823669359] [2025-02-17 22:48:50,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:48:50,775 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:48:50,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:50,776 INFO L85 PathProgramCache]: Analyzing trace with hash 91424, now seen corresponding path program 2 times [2025-02-17 22:48:50,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:50,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422409301] [2025-02-17 22:48:50,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:50,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:50,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:50,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:50,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:48:50,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:50,779 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:50,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:50,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:50,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:50,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:50,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:50,801 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:50,801 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:50,801 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:50,801 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:50,801 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:50,802 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,802 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:50,802 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:50,802 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock2.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:48:50,802 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:50,802 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:50,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:50,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:50,825 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:50,825 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:50,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:50,827 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:50,828 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:50,830 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:50,830 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:50,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:50,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:50,851 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:50,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-17 22:48:50,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:50,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:50,877 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:50,878 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x2=0} Honda state: {x2=0} Generalized eigenvectors: [{x2=-8}, {x2=3}, {x2=4}] Lambdas: [1, 1, 1] Nus: [0, 0] [2025-02-17 22:48:50,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:50,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:50,886 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:50,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-17 22:48:50,888 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:50,888 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:50,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:50,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:50,906 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:50,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-17 22:48:50,907 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:50,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:50,972 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:50,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-17 22:48:50,977 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:50,977 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:50,977 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:50,977 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:50,977 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:50,977 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:50,977 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:50,977 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:50,977 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock2.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:48:50,977 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:50,977 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:50,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:50,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:51,003 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:51,004 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:51,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:51,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:51,006 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:51,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-17 22:48:51,008 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:51,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:51,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:51,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:51,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:51,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:51,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:51,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:51,020 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:51,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-17 22:48:51,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:51,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:51,028 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:51,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-17 22:48:51,030 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:51,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:51,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:51,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:51,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:51,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:51,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:51,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:51,043 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:51,045 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:48:51,045 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:51,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:51,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:51,047 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:51,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-17 22:48:51,049 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:51,049 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:51,049 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:51,050 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-02-17 22:48:51,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:51,056 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:51,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:51,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:51,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:51,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:51,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:51,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:51,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:51,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:51,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:51,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:51,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:51,093 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:51,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:51,122 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:51,122 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:51,122 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 149 states and 300 transitions. cyclomatic complexity: 168 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:51,140 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 149 states and 300 transitions. cyclomatic complexity: 168. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 166 states and 326 transitions. Complement of second has 6 states. [2025-02-17 22:48:51,140 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:51,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2025-02-17 22:48:51,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-17 22:48:51,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:51,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 11 letters. Loop has 3 letters. [2025-02-17 22:48:51,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:51,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 8 letters. Loop has 6 letters. [2025-02-17 22:48:51,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:51,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 326 transitions. [2025-02-17 22:48:51,143 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-02-17 22:48:51,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 140 states and 282 transitions. [2025-02-17 22:48:51,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-02-17 22:48:51,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-02-17 22:48:51,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 282 transitions. [2025-02-17 22:48:51,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:51,144 INFO L218 hiAutomatonCegarLoop]: Abstraction has 140 states and 282 transitions. [2025-02-17 22:48:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 282 transitions. [2025-02-17 22:48:51,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-02-17 22:48:51,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 140 states have (on average 2.0142857142857142) internal successors, (282), 139 states have internal predecessors, (282), 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:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 282 transitions. [2025-02-17 22:48:51,162 INFO L240 hiAutomatonCegarLoop]: Abstraction has 140 states and 282 transitions. [2025-02-17 22:48:51,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:48:51,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-17 22:48:51,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:48:51,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:48:51,173 INFO L87 Difference]: Start difference. First operand 140 states and 282 transitions. 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:51,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-17 22:48:51,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:51,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:48:51,186 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2025-02-17 22:48:51,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. [2025-02-17 22:48:51,187 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:51,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2025-02-17 22:48:51,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:48:51,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:48:51,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:48:51,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:48:51,187 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:51,187 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:51,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:48:51,188 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:51,188 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:48:51,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:48:51,188 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:51,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:48:51,192 INFO L201 PluginConnector]: Adding new model lock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:48:51 BoogieIcfgContainer [2025-02-17 22:48:51,192 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:48:51,193 INFO L158 Benchmark]: Toolchain (without parser) took 2690.78ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 87.3MB in the beginning and 96.8MB in the end (delta: -9.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:51,193 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.28ms. Allocated memory is still 159.4MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:51,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.86ms. Allocated memory is still 159.4MB. Free memory was 87.1MB in the beginning and 86.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:51,194 INFO L158 Benchmark]: Boogie Preprocessor took 11.12ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 85.2MB in the end (delta: 771.1kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:51,194 INFO L158 Benchmark]: RCFGBuilder took 171.44ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 76.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:48:51,194 INFO L158 Benchmark]: BuchiAutomizer took 2481.88ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 76.0MB in the beginning and 96.8MB in the end (delta: -20.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:51,195 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.28ms. Allocated memory is still 159.4MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.86ms. Allocated memory is still 159.4MB. Free memory was 87.1MB in the beginning and 86.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 11.12ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 85.2MB in the end (delta: 771.1kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 171.44ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 76.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2481.88ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 76.0MB in the beginning and 96.8MB in the end (delta: -20.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 4 deterministic, 0 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 -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 114 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129 IncrementalHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 73 mSDtfsCounter, 129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp77 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 70ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 273, Trivial Ample Sets caused by loops: 31, Number of non-trivial ample sets: 50, Number of pruned transitions: 30, Number of transitions in reduction automaton: 135, Number of states in reduction automaton: 79, 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:51,205 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...