/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/3_thr/ie2.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:57,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:58,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:58,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:58,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:58,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:58,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:58,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:58,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:58,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:58,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:58,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:58,054 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:58,054 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:58,054 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:58,055 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:58,055 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:58,055 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:58,055 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:58,055 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:58,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:58,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:58,055 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:58,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:58,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:58,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:58,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:58,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:58,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:58,055 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:58,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:58,056 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:58,056 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:58,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:58,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:58,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:58,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:58,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:58,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:58,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:58,056 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:58,056 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:58,056 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:58,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:58,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:58,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:58,316 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:58,317 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:58,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/ie2.c.bpl [2025-04-26 16:56:58,318 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/ie2.c.bpl' [2025-04-26 16:56:58,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:58,333 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:58,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:58,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:58,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:58,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:58" (1/1) ... [2025-04-26 16:56:58,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:58" (1/1) ... [2025-04-26 16:56:58,367 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:58,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:58,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:58,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:58,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:58,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:58" (1/1) ... [2025-04-26 16:56:58,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:58" (1/1) ... [2025-04-26 16:56:58,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:58" (1/1) ... [2025-04-26 16:56:58,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:58" (1/1) ... [2025-04-26 16:56:58,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:58" (1/1) ... [2025-04-26 16:56:58,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:58" (1/1) ... [2025-04-26 16:56:58,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:58" (1/1) ... [2025-04-26 16:56:58,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:58" (1/1) ... [2025-04-26 16:56:58,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:58" (1/1) ... [2025-04-26 16:56:58,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:58,389 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:58,389 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:58,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:58,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:58" (1/1) ... [2025-04-26 16:56:58,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:58,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:58,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:58,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:56:58,441 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:58,441 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:58,442 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:58,442 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:58,442 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:58,442 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:58,442 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:56:58,442 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:56:58,442 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:56:58,442 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:58,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:58,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:58,443 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:56:58,475 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:58,476 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:58,568 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:58,568 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:58,579 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:58,581 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:58,582 INFO L201 PluginConnector]: Adding new model ie2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:58 BoogieIcfgContainer [2025-04-26 16:56:58,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:58,583 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:58,583 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:58,588 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:58,588 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:58,588 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:58" (1/2) ... [2025-04-26 16:56:58,589 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cb02826 and model type ie2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:58, skipping insertion in model container [2025-04-26 16:56:58,589 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:58,590 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:58" (2/2) ... [2025-04-26 16:56:58,590 INFO L376 chiAutomizerObserver]: Analyzing ICFG ie2.c.bpl [2025-04-26 16:56:58,629 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:56:58,661 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:58,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:58,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:58,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:58,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:56:58,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 41 transitions, 103 flow [2025-04-26 16:56:58,735 INFO L116 PetriNetUnfolderBase]: 6/35 cut-off events. [2025-04-26 16:56:58,738 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:56:58,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 6/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-04-26 16:56:58,744 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 41 transitions, 103 flow [2025-04-26 16:56:58,747 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 35 transitions, 88 flow [2025-04-26 16:56:58,747 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 39 places, 35 transitions, 88 flow [2025-04-26 16:56:58,755 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:59,095 WARN L140 AmpleReduction]: Number of pruned transitions: 728 [2025-04-26 16:56:59,096 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:59,096 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 166 [2025-04-26 16:56:59,096 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:93 [2025-04-26 16:56:59,096 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:363 [2025-04-26 16:56:59,096 WARN L145 AmpleReduction]: Times succ was already a loop node:378 [2025-04-26 16:56:59,096 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:36 [2025-04-26 16:56:59,096 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:59,100 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 623 states, 622 states have (on average 2.1318327974276525) internal successors, (in total 1326), 622 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:59,106 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:59,106 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:59,106 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:59,107 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:59,107 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:59,107 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:59,107 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:59,107 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:59,109 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 623 states, 622 states have (on average 2.1318327974276525) internal successors, (in total 1326), 622 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:59,139 INFO L131 ngComponentsAnalysis]: Automaton has 135 accepting balls. 404 [2025-04-26 16:56:59,140 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:59,140 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:59,143 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:59,143 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:59,144 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:59,145 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 623 states, 622 states have (on average 2.1318327974276525) internal successors, (in total 1326), 622 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:59,156 INFO L131 ngComponentsAnalysis]: Automaton has 135 accepting balls. 404 [2025-04-26 16:56:59,156 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:59,156 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:59,157 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:59,157 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:59,162 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:56:59,162 INFO L754 eck$LassoCheckResult]: Loop: "[92] L26-->L28: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[94] L28-->L26: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:56:59,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:59,166 INFO L85 PathProgramCache]: Analyzing trace with hash 3716, now seen corresponding path program 1 times [2025-04-26 16:56:59,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:59,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067816265] [2025-04-26 16:56:59,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:59,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:59,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:59,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:59,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:59,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:59,212 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:59,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:59,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:59,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:59,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:59,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:59,226 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:59,227 INFO L85 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 1 times [2025-04-26 16:56:59,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:59,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198688549] [2025-04-26 16:56:59,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:59,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:59,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:59,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:59,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:59,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:59,233 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:59,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:59,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:59,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:59,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:59,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:59,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:59,238 INFO L85 PathProgramCache]: Analyzing trace with hash 3574022, now seen corresponding path program 1 times [2025-04-26 16:56:59,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:59,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873405195] [2025-04-26 16:56:59,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:59,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:59,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:59,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:59,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:59,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:59,244 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:59,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:59,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:59,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:59,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:59,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:59,296 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:59,296 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:59,296 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:59,296 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:59,297 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:59,297 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:59,297 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:59,297 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:59,297 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:59,297 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:59,297 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:59,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:59,369 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:59,374 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:59,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:59,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:59,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:59,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:56:59,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:59,384 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:59,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:59,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:59,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:59,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:59,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:56:59,441 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:59,441 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:59,506 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:59,510 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-04-26 16:56:59,510 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:59,510 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:59,510 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:59,510 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:59,510 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:59,510 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:59,510 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:59,511 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:59,511 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:59,511 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:59,511 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:59,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:59,533 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:59,537 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:59,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:59,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:59,539 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:59,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:56:59,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:59,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:59,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:59,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:59,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:59,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:59,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:59,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:59,562 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:59,567 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:56:59,567 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:59,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:59,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:59,569 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:59,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:56:59,573 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:59,576 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-04-26 16:56:59,576 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:59,576 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:59,576 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-04-26 16:56:59,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:59,584 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:59,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:59,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:59,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:59,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:59,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:59,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:59,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:59,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:59,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:59,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:59,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:59,629 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:59,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:59,663 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-04-26 16:56:59,666 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 623 states, 622 states have (on average 2.1318327974276525) internal successors, (in total 1326), 622 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:59,776 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 623 states, 622 states have (on average 2.1318327974276525) internal successors, (in total 1326), 622 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1490 states and 3363 transitions. Complement of second has 6 states. [2025-04-26 16:56:59,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-26 16:56:59,783 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:56:59,783 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:59,783 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:56:59,783 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:59,783 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:56:59,783 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:59,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1490 states and 3363 transitions. [2025-04-26 16:56:59,798 INFO L131 ngComponentsAnalysis]: Automaton has 134 accepting balls. 366 [2025-04-26 16:56:59,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1490 states to 946 states and 2180 transitions. [2025-04-26 16:56:59,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 601 [2025-04-26 16:56:59,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 727 [2025-04-26 16:56:59,818 INFO L74 IsDeterministic]: Start isDeterministic. Operand 946 states and 2180 transitions. [2025-04-26 16:56:59,818 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:59,818 INFO L218 hiAutomatonCegarLoop]: Abstraction has 946 states and 2180 transitions. [2025-04-26 16:56:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states and 2180 transitions. [2025-04-26 16:56:59,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 823. [2025-04-26 16:56:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 823 states have (on average 2.330498177399757) internal successors, (in total 1918), 822 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:59,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1918 transitions. [2025-04-26 16:56:59,872 INFO L240 hiAutomatonCegarLoop]: Abstraction has 823 states and 1918 transitions. [2025-04-26 16:56:59,872 INFO L438 stractBuchiCegarLoop]: Abstraction has 823 states and 1918 transitions. [2025-04-26 16:56:59,872 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:59,872 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 823 states and 1918 transitions. [2025-04-26 16:56:59,876 INFO L131 ngComponentsAnalysis]: Automaton has 134 accepting balls. 366 [2025-04-26 16:56:59,876 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:59,876 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:59,876 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:59,876 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:59,877 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L15-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:56:59,877 INFO L754 eck$LassoCheckResult]: Loop: "[101] L41-->L43: Formula: (< v_x3_5 v_z2_1) InVars {z2=v_z2_1, x3=v_x3_5} OutVars{z2=v_z2_1, x3=v_x3_5} AuxVars[] AssignedVars[]" "[103] L43-->L41: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-04-26 16:56:59,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:59,877 INFO L85 PathProgramCache]: Analyzing trace with hash 115319, now seen corresponding path program 1 times [2025-04-26 16:56:59,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:59,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422221410] [2025-04-26 16:56:59,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:59,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:59,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:59,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:59,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:59,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:59,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:59,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:59,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:59,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:59,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:59,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:59,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:59,890 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 16:56:59,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:59,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511623395] [2025-04-26 16:56:59,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:59,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:59,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:59,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:59,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:59,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:59,894 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:59,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:59,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:59,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:59,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:59,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:59,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:59,899 INFO L85 PathProgramCache]: Analyzing trace with hash 110824793, now seen corresponding path program 1 times [2025-04-26 16:56:59,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:59,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217380642] [2025-04-26 16:56:59,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:59,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:59,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:59,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:59,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:59,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:59,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:59,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:59,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:59,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:59,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:59,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:59,919 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:59,919 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:59,919 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:59,920 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:59,920 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:59,920 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:59,920 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:59,920 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:59,920 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:59,920 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:59,920 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:59,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:59,936 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:59,936 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:59,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:59,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:59,938 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:59,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:56:59,941 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:59,941 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:59,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:59,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:59,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:59,959 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:59,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:56:59,961 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:59,961 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:00,029 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:00,034 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-04-26 16:57:00,034 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:00,034 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:00,034 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:00,034 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:00,034 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:00,035 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:00,035 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:00,035 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:00,035 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:57:00,035 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:00,035 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:00,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:00,052 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:00,052 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:00,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:00,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:00,054 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:00,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:57:00,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:00,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:00,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:00,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:00,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:00,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:00,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:00,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:00,069 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:00,071 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:57:00,071 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:57:00,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:00,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:00,073 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:00,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:57:00,076 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:00,079 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-04-26 16:57:00,079 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:00,079 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:00,079 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x3) = 1*z2 - 1*x3 Supporting invariants [] [2025-04-26 16:57:00,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:57:00,085 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:00,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:00,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:00,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:00,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:00,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:00,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:00,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:00,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:00,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:00,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:00,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:00,108 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:00,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:00,119 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-04-26 16:57:00,120 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 823 states and 1918 transitions. cyclomatic complexity: 1260 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:00,194 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 823 states and 1918 transitions. cyclomatic complexity: 1260. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2073 states and 5005 transitions. Complement of second has 6 states. [2025-04-26 16:57:00,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-04-26 16:57:00,195 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:57:00,196 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:00,196 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:57:00,196 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:00,196 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:57:00,196 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:00,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2073 states and 5005 transitions. [2025-04-26 16:57:00,214 INFO L131 ngComponentsAnalysis]: Automaton has 120 accepting balls. 304 [2025-04-26 16:57:00,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2073 states to 1313 states and 3217 transitions. [2025-04-26 16:57:00,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 646 [2025-04-26 16:57:00,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 779 [2025-04-26 16:57:00,228 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1313 states and 3217 transitions. [2025-04-26 16:57:00,228 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:00,228 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1313 states and 3217 transitions. [2025-04-26 16:57:00,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states and 3217 transitions. [2025-04-26 16:57:00,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1181. [2025-04-26 16:57:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 1181 states have (on average 2.5012701100762067) internal successors, (in total 2954), 1180 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 2954 transitions. [2025-04-26 16:57:00,274 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1181 states and 2954 transitions. [2025-04-26 16:57:00,274 INFO L438 stractBuchiCegarLoop]: Abstraction has 1181 states and 2954 transitions. [2025-04-26 16:57:00,274 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:57:00,274 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1181 states and 2954 transitions. [2025-04-26 16:57:00,279 INFO L131 ngComponentsAnalysis]: Automaton has 120 accepting balls. 304 [2025-04-26 16:57:00,279 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:00,279 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:00,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:57:00,279 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:00,279 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L15-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[126] L16-->L56: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:57:00,280 INFO L754 eck$LassoCheckResult]: Loop: "[110] L56-->L58: Formula: (< v_x4_5 v_z3_1) InVars {x4=v_x4_5, z3=v_z3_1} OutVars{x4=v_x4_5, z3=v_z3_1} AuxVars[] AssignedVars[]" "[112] L58-->L56: Formula: (= v_x4_6 (+ v_x4_7 1)) InVars {x4=v_x4_7} OutVars{x4=v_x4_6} AuxVars[] AssignedVars[x4]" [2025-04-26 16:57:00,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:00,280 INFO L85 PathProgramCache]: Analyzing trace with hash 3575015, now seen corresponding path program 1 times [2025-04-26 16:57:00,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:00,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075591478] [2025-04-26 16:57:00,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:00,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:00,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:00,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:00,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:00,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:00,284 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:00,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:00,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:00,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:00,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:00,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:00,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash 4483, now seen corresponding path program 1 times [2025-04-26 16:57:00,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:00,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16575975] [2025-04-26 16:57:00,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:00,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:00,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:00,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:00,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:00,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:00,296 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:00,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:00,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:00,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:00,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:00,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:00,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:00,301 INFO L85 PathProgramCache]: Analyzing trace with hash -859374359, now seen corresponding path program 1 times [2025-04-26 16:57:00,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:00,301 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038856596] [2025-04-26 16:57:00,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:00,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:00,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:57:00,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:57:00,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:00,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:00,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:00,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:57:00,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:57:00,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:00,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:00,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:00,327 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:00,327 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:00,327 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:00,327 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:00,327 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:00,327 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:00,327 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:00,327 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:00,327 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:00,327 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:00,327 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:00,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:00,344 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:00,344 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:00,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:00,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:00,346 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:00,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:57:00,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:00,348 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:00,364 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-04-26 16:57:00,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:00,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:00,366 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:00,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:57:00,368 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:00,368 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:00,431 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:00,435 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-04-26 16:57:00,436 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:00,436 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:00,436 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:00,436 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:00,436 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:00,436 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:00,436 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:00,436 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:00,436 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:00,436 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:00,436 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:00,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:00,452 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:00,452 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:00,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:00,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:00,454 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:00,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:57:00,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:00,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:00,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:00,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:00,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:00,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:00,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:00,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:00,469 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:00,471 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:57:00,471 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:00,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:00,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:00,474 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:00,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:57:00,476 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:00,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:00,480 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:00,480 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:00,480 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x4, z3) = -1*x4 + 1*z3 Supporting invariants [] [2025-04-26 16:57:00,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:57:00,487 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:00,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:00,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:00,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:00,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:00,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:00,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:00,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:00,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:00,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:00,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:00,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:00,510 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:00,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:00,522 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-04-26 16:57:00,522 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1181 states and 2954 transitions. cyclomatic complexity: 1972 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:00,589 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1181 states and 2954 transitions. cyclomatic complexity: 1972. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2967 states and 7587 transitions. Complement of second has 6 states. [2025-04-26 16:57:00,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:00,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:00,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-04-26 16:57:00,591 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:57:00,591 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:00,591 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:57:00,591 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:00,591 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:57:00,591 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:00,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2967 states and 7587 transitions. [2025-04-26 16:57:00,612 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 266 [2025-04-26 16:57:00,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2967 states to 1802 states and 4719 transitions. [2025-04-26 16:57:00,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 730 [2025-04-26 16:57:00,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 821 [2025-04-26 16:57:00,627 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1802 states and 4719 transitions. [2025-04-26 16:57:00,627 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:00,627 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1802 states and 4719 transitions. [2025-04-26 16:57:00,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states and 4719 transitions. [2025-04-26 16:57:00,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1681. [2025-04-26 16:57:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1681 states have (on average 2.6353361094586556) internal successors, (in total 4430), 1680 states have internal predecessors, (4430), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 4430 transitions. [2025-04-26 16:57:00,657 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1681 states and 4430 transitions. [2025-04-26 16:57:00,657 INFO L438 stractBuchiCegarLoop]: Abstraction has 1681 states and 4430 transitions. [2025-04-26 16:57:00,657 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:57:00,657 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1681 states and 4430 transitions. [2025-04-26 16:57:00,663 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 266 [2025-04-26 16:57:00,664 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:00,664 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:00,664 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:57:00,664 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:00,664 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[91] L26-->L30: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[93] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[95] L31-->L32-1: Formula: (<= 3 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-04-26 16:57:00,664 INFO L754 eck$LassoCheckResult]: Loop: "[97] L32-1-->L34: Formula: (< v_x3_1 v_z1_3) InVars {x3=v_x3_1, z1=v_z1_3} OutVars{x3=v_x3_1, z1=v_z1_3} AuxVars[] AssignedVars[]" "[99] L34-->L32-1: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:57:00,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:00,665 INFO L85 PathProgramCache]: Analyzing trace with hash 110793785, now seen corresponding path program 1 times [2025-04-26 16:57:00,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:00,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38197206] [2025-04-26 16:57:00,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:00,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:00,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:00,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:00,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:00,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:00,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:57:00,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38197206] [2025-04-26 16:57:00,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38197206] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:57:00,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:57:00,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:57:00,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784136069] [2025-04-26 16:57:00,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:57:00,713 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:57:00,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:00,714 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 16:57:00,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:00,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971491305] [2025-04-26 16:57:00,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:00,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:00,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:00,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:00,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:00,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:00,716 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:00,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:00,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:00,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:00,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:00,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:00,744 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:00,744 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:00,744 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:00,744 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:00,744 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:00,744 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:00,744 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:00,744 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:00,744 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:57:00,744 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:00,744 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:00,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:00,760 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:00,760 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:00,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:00,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:00,762 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:00,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:57:00,765 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:00,765 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:00,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:00,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:00,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:00,785 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:00,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:57:00,788 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:00,788 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:00,859 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:00,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:00,864 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:00,864 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:00,864 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:00,864 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:00,864 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:00,864 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:00,864 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:00,864 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:00,864 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:57:00,864 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:00,864 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:00,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:00,885 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:00,885 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:00,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:00,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:00,888 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:00,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:57:00,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:00,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:00,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:00,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:00,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:00,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:00,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:00,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:00,903 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:00,905 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:00,906 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:00,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:00,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:00,908 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:00,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:57:00,909 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:00,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:57:00,912 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:00,913 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:00,913 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x3) = 1*z1 - 1*x3 Supporting invariants [] [2025-04-26 16:57:00,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:57:00,919 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:00,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:00,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:00,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:00,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:00,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:00,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:00,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:00,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:00,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:00,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:00,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:00,951 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:00,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:00,965 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-04-26 16:57:00,965 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1681 states and 4430 transitions. cyclomatic complexity: 2999 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:01,038 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1681 states and 4430 transitions. cyclomatic complexity: 2999. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3497 states and 9285 transitions. Complement of second has 6 states. [2025-04-26 16:57:01,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:01,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-04-26 16:57:01,041 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:57:01,041 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:01,041 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:57:01,041 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:01,041 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:57:01,041 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:01,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3497 states and 9285 transitions. [2025-04-26 16:57:01,064 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 132 [2025-04-26 16:57:01,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3497 states to 2378 states and 6349 transitions. [2025-04-26 16:57:01,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 669 [2025-04-26 16:57:01,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 776 [2025-04-26 16:57:01,083 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2378 states and 6349 transitions. [2025-04-26 16:57:01,083 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:01,083 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2378 states and 6349 transitions. [2025-04-26 16:57:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states and 6349 transitions. [2025-04-26 16:57:01,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2166. [2025-04-26 16:57:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2166 states, 2166 states have (on average 2.744690674053555) internal successors, (in total 5945), 2165 states have internal predecessors, (5945), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 5945 transitions. [2025-04-26 16:57:01,125 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2166 states and 5945 transitions. [2025-04-26 16:57:01,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:57:01,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:57:01,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:57:01,129 INFO L87 Difference]: Start difference. First operand 2166 states and 5945 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:01,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:57:01,170 INFO L93 Difference]: Finished difference Result 1277 states and 3172 transitions. [2025-04-26 16:57:01,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1277 states and 3172 transitions. [2025-04-26 16:57:01,177 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 104 [2025-04-26 16:57:01,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1277 states to 1277 states and 3172 transitions. [2025-04-26 16:57:01,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 488 [2025-04-26 16:57:01,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 488 [2025-04-26 16:57:01,186 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1277 states and 3172 transitions. [2025-04-26 16:57:01,186 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:01,186 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1277 states and 3172 transitions. [2025-04-26 16:57:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states and 3172 transitions. [2025-04-26 16:57:01,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1277. [2025-04-26 16:57:01,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1277 states have (on average 2.4839467501957713) internal successors, (in total 3172), 1276 states have internal predecessors, (3172), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 3172 transitions. [2025-04-26 16:57:01,220 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1277 states and 3172 transitions. [2025-04-26 16:57:01,221 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:57:01,221 INFO L438 stractBuchiCegarLoop]: Abstraction has 1277 states and 3172 transitions. [2025-04-26 16:57:01,221 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:57:01,221 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1277 states and 3172 transitions. [2025-04-26 16:57:01,226 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 104 [2025-04-26 16:57:01,226 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:01,226 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:01,226 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:01,226 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:01,227 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L15-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[100] L41-->L45: Formula: (<= v_z2_2 v_x3_8) InVars {z2=v_z2_2, x3=v_x3_8} OutVars{z2=v_z2_2, x3=v_x3_8} AuxVars[] AssignedVars[]" "[102] L45-->L46: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[91] L26-->L30: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[93] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[104] L46-->L47-1: Formula: (<= 3 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-04-26 16:57:01,227 INFO L754 eck$LassoCheckResult]: Loop: "[106] L47-1-->L49: Formula: (< v_x4_1 v_z2_3) InVars {x4=v_x4_1, z2=v_z2_3} OutVars{x4=v_x4_1, z2=v_z2_3} AuxVars[] AssignedVars[]" "[108] L49-->L47-1: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 16:57:01,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:01,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1249305235, now seen corresponding path program 1 times [2025-04-26 16:57:01,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:01,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458391207] [2025-04-26 16:57:01,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:01,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:01,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:57:01,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:57:01,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:01,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:01,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:57:01,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458391207] [2025-04-26 16:57:01,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458391207] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:57:01,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:57:01,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:57:01,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582536651] [2025-04-26 16:57:01,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:57:01,255 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:57:01,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:01,255 INFO L85 PathProgramCache]: Analyzing trace with hash 4355, now seen corresponding path program 1 times [2025-04-26 16:57:01,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:01,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099830619] [2025-04-26 16:57:01,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:01,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:01,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:01,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:01,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:01,258 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:01,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:01,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:01,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:01,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:01,274 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:01,274 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:01,274 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:01,274 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:01,274 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:01,274 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:01,274 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:01,274 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:01,274 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:57:01,274 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:01,274 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:01,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:01,289 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:01,290 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:01,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:01,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:01,291 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:01,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:57:01,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:01,294 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:01,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:01,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:01,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:01,315 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:01,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:57:01,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:01,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:01,381 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:01,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:57:01,386 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:01,386 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:01,386 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:01,386 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:01,386 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:01,386 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:01,386 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:01,386 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:01,387 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:57:01,387 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:01,387 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:01,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:01,403 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:01,404 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:01,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:01,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:01,405 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:01,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:57:01,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:01,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:01,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:01,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:01,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:01,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:01,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:01,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:01,423 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:01,426 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:57:01,426 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:57:01,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:01,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:01,428 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:01,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:57:01,430 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:01,434 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-04-26 16:57:01,434 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:01,434 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:01,434 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x4) = 1*z2 - 1*x4 Supporting invariants [] [2025-04-26 16:57:01,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:01,441 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:01,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:01,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:57:01,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:57:01,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:01,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:01,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:01,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:01,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:01,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:01,471 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:01,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:01,485 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-04-26 16:57:01,485 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1277 states and 3172 transitions. cyclomatic complexity: 2077 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:01,538 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1277 states and 3172 transitions. cyclomatic complexity: 2077. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2471 states and 6032 transitions. Complement of second has 6 states. [2025-04-26 16:57:01,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-04-26 16:57:01,539 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:57:01,539 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:01,539 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:57:01,539 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:01,539 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:57:01,540 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:01,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2471 states and 6032 transitions. [2025-04-26 16:57:01,552 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-04-26 16:57:01,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2471 states to 1528 states and 3750 transitions. [2025-04-26 16:57:01,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 384 [2025-04-26 16:57:01,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 427 [2025-04-26 16:57:01,561 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1528 states and 3750 transitions. [2025-04-26 16:57:01,561 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:01,561 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1528 states and 3750 transitions. [2025-04-26 16:57:01,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states and 3750 transitions. [2025-04-26 16:57:01,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1447. [2025-04-26 16:57:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1447 states have (on average 2.4485141672425708) internal successors, (in total 3543), 1446 states have internal predecessors, (3543), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:01,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 3543 transitions. [2025-04-26 16:57:01,582 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1447 states and 3543 transitions. [2025-04-26 16:57:01,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:57:01,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:57:01,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:57:01,583 INFO L87 Difference]: Start difference. First operand 1447 states and 3543 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:57:01,612 INFO L93 Difference]: Finished difference Result 409 states and 1069 transitions. [2025-04-26 16:57:01,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 1069 transitions. [2025-04-26 16:57:01,613 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:57:01,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 363 states and 915 transitions. [2025-04-26 16:57:01,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2025-04-26 16:57:01,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2025-04-26 16:57:01,616 INFO L74 IsDeterministic]: Start isDeterministic. Operand 363 states and 915 transitions. [2025-04-26 16:57:01,616 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:01,616 INFO L218 hiAutomatonCegarLoop]: Abstraction has 363 states and 915 transitions. [2025-04-26 16:57:01,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states and 915 transitions. [2025-04-26 16:57:01,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-04-26 16:57:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 363 states have (on average 2.520661157024793) internal successors, (in total 915), 362 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 915 transitions. [2025-04-26 16:57:01,621 INFO L240 hiAutomatonCegarLoop]: Abstraction has 363 states and 915 transitions. [2025-04-26 16:57:01,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:57:01,621 INFO L438 stractBuchiCegarLoop]: Abstraction has 363 states and 915 transitions. [2025-04-26 16:57:01,621 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:57:01,621 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 363 states and 915 transitions. [2025-04-26 16:57:01,622 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:57:01,622 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:01,623 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:01,623 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:01,623 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:01,623 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L15-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[100] L41-->L45: Formula: (<= v_z2_2 v_x3_8) InVars {z2=v_z2_2, x3=v_x3_8} OutVars{z2=v_z2_2, x3=v_x3_8} AuxVars[] AssignedVars[]" "[102] L45-->L46: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[91] L26-->L30: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[93] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[126] L16-->L56: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[109] L56-->L60: Formula: (<= v_z3_2 v_x4_8) InVars {x4=v_x4_8, z3=v_z3_2} OutVars{x4=v_x4_8, z3=v_z3_2} AuxVars[] AssignedVars[]" "[111] L60-->L61: Formula: (= v_x2_7 (+ v_x2_8 1)) InVars {x2=v_x2_8} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[95] L31-->L32-1: Formula: (<= 3 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" "[96] L32-1-->thread1FINAL: Formula: (<= v_z1_4 v_x3_4) InVars {x3=v_x3_4, z1=v_z1_4} OutVars{x3=v_x3_4, z1=v_z1_4} AuxVars[] AssignedVars[]" "[104] L46-->L47-1: Formula: (<= 3 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" "[105] L47-1-->thread2FINAL: Formula: (<= v_z2_4 v_x4_4) InVars {x4=v_x4_4, z2=v_z2_4} OutVars{x4=v_x4_4, z2=v_z2_4} AuxVars[] AssignedVars[]" "[113] L61-->L62-1: Formula: (<= 3 v_x2_9) InVars {x2=v_x2_9} OutVars{x2=v_x2_9} AuxVars[] AssignedVars[]" [2025-04-26 16:57:01,623 INFO L754 eck$LassoCheckResult]: Loop: "[115] L62-1-->L64: Formula: (< v_x1_5 v_z3_3) InVars {x1=v_x1_5, z3=v_z3_3} OutVars{x1=v_x1_5, z3=v_z3_3} AuxVars[] AssignedVars[]" "[117] L64-->L62-1: Formula: (= (+ v_x1_7 1) v_x1_6) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 16:57:01,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1585491766, now seen corresponding path program 1 times [2025-04-26 16:57:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:01,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283614882] [2025-04-26 16:57:01,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:01,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:57:01,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:57:01,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:01,629 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:01,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:57:01,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:57:01,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:01,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:01,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:01,638 INFO L85 PathProgramCache]: Analyzing trace with hash 4643, now seen corresponding path program 1 times [2025-04-26 16:57:01,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:01,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225341455] [2025-04-26 16:57:01,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:01,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:01,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:01,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:01,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:01,645 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:01,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:01,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:01,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:01,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:01,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:01,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1055806636, now seen corresponding path program 1 times [2025-04-26 16:57:01,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:01,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303488437] [2025-04-26 16:57:01,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:01,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:01,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:57:01,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:57:01,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:01,679 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:01,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:57:01,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:57:01,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:01,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:01,698 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:01,698 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:01,698 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:01,698 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:01,698 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:01,699 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:01,699 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:01,699 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:01,699 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:57:01,699 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:01,699 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:01,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:01,720 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:01,720 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:01,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:01,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:01,725 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:01,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:57:01,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:01,728 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:01,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:57:01,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:01,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:01,750 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:01,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:57:01,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:01,754 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:01,824 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:01,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:57:01,829 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:01,829 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:01,829 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:01,829 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:01,829 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:01,829 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:01,829 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:01,829 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:01,829 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:57:01,829 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:01,829 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:01,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:01,847 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:01,847 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:01,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:01,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:01,850 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:01,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:57:01,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:01,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:01,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:01,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:01,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:01,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:01,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:01,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:01,870 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:01,873 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:57:01,873 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:57:01,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:01,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:01,875 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:01,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:57:01,878 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:01,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:01,881 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:01,881 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:01,881 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z3, x1) = 1*z3 - 1*x1 Supporting invariants [] [2025-04-26 16:57:01,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:01,888 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:01,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:01,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:57:01,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:57:01,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:01,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:01,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:01,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:01,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:01,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:01,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:01,931 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:01,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:01,943 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-04-26 16:57:01,943 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 363 states and 915 transitions. cyclomatic complexity: 602 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:01,966 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 363 states and 915 transitions. cyclomatic complexity: 602. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 509 states and 1215 transitions. Complement of second has 6 states. [2025-04-26 16:57:01,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-26 16:57:01,967 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 16:57:01,967 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:01,967 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 17 letters. Loop has 2 letters. [2025-04-26 16:57:01,968 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:01,968 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:57:01,968 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:01,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 509 states and 1215 transitions. [2025-04-26 16:57:01,971 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:01,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 509 states to 0 states and 0 transitions. [2025-04-26 16:57:01,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:57:01,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:57:01,971 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:57:01,971 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:57:01,971 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:01,971 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:01,971 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:01,971 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:57:01,971 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:57:01,971 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:01,971 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:57:01,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:57:01,983 INFO L201 PluginConnector]: Adding new model ie2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:57:01 BoogieIcfgContainer [2025-04-26 16:57:01,983 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:57:01,984 INFO L158 Benchmark]: Toolchain (without parser) took 3650.03ms. Allocated memory was 159.4MB in the beginning and 184.5MB in the end (delta: 25.2MB). Free memory was 87.6MB in the beginning and 120.4MB in the end (delta: -32.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:01,984 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:01,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.70ms. Allocated memory is still 159.4MB. Free memory was 87.6MB in the beginning and 85.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:01,984 INFO L158 Benchmark]: Boogie Preprocessor took 19.54ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 84.7MB in the end (delta: 958.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:01,984 INFO L158 Benchmark]: RCFGBuilder took 193.55ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 75.1MB in the end (delta: 9.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:57:01,984 INFO L158 Benchmark]: BuchiAutomizer took 3399.95ms. Allocated memory was 159.4MB in the beginning and 184.5MB in the end (delta: 25.2MB). Free memory was 75.0MB in the beginning and 120.4MB in the end (delta: -45.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:01,985 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.70ms. Allocated memory is still 159.4MB. Free memory was 87.6MB in the beginning and 85.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 19.54ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 84.7MB in the end (delta: 958.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 193.55ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 75.1MB in the end (delta: 9.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3399.95ms. Allocated memory was 159.4MB in the beginning and 184.5MB in the end (delta: 25.2MB). Free memory was 75.0MB in the beginning and 120.4MB in the end (delta: -45.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 669 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 448 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 442 mSDsluCounter, 673 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 345 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 275 IncrementalHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 328 mSDtfsCounter, 275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 39ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 439, Number of transitions in reduction automaton: 1326, Number of states in reduction automaton: 623, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (2 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z3 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z3 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:57:01,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...