/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/4_plus_thr/lock5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:58:42,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:58:42,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:58:42,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:58:42,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:58:42,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:58:42,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:58:42,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:58:42,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:58:42,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:58:42,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:58:42,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:58:42,295 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:58:42,295 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:58:42,295 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:58:42,295 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:58:42,295 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:58:42,295 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:58:42,295 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:58:42,295 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:58:42,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:58:42,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:58:42,295 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:58:42,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:58:42,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:58:42,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:58:42,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:58:42,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:58:42,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:58:42,296 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:58:42,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:58:42,296 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:58:42,296 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:58:42,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:58:42,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:58:42,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:42,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:58:42,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:58:42,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:58:42,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:58:42,296 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:58:42,297 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:58:42,297 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:58:42,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:58:42,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:58:42,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:58:42,531 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:58:42,531 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:58:42,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/lock5.c.bpl [2025-04-26 16:58:42,533 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/lock5.c.bpl' [2025-04-26 16:58:42,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:58:42,552 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:58:42,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:42,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:58:42,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:58:42,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "lock5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:42" (1/1) ... [2025-04-26 16:58:42,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "lock5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:42" (1/1) ... [2025-04-26 16:58:42,584 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:58:42,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:42,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:58:42,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:58:42,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:58:42,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "lock5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:42" (1/1) ... [2025-04-26 16:58:42,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "lock5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:42" (1/1) ... [2025-04-26 16:58:42,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "lock5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:42" (1/1) ... [2025-04-26 16:58:42,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "lock5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:42" (1/1) ... [2025-04-26 16:58:42,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "lock5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:42" (1/1) ... [2025-04-26 16:58:42,597 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "lock5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:42" (1/1) ... [2025-04-26 16:58:42,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "lock5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:42" (1/1) ... [2025-04-26 16:58:42,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "lock5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:42" (1/1) ... [2025-04-26 16:58:42,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "lock5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:42" (1/1) ... [2025-04-26 16:58:42,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:58:42,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:58:42,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:58:42,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:58:42,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "lock5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:42" (1/1) ... [2025-04-26 16:58:42,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:42,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:42,648 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:58:42,652 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:58:42,672 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:58:42,672 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:58:42,672 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:58:42,673 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:58:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:58:42,673 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:58:42,673 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:58:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:58:42,673 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:58:42,673 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:58:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:58:42,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:58:42,673 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:58:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:58:42,673 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:58:42,673 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:58:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:58:42,673 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:58:42,674 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:58:42,712 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:58:42,713 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:58:42,817 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:58:42,817 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:58:42,839 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:58:42,840 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:58:42,840 INFO L201 PluginConnector]: Adding new model lock5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:42 BoogieIcfgContainer [2025-04-26 16:58:42,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:58:42,841 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:58:42,841 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:58:42,845 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:58:42,845 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:42,845 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "lock5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:42" (1/2) ... [2025-04-26 16:58:42,846 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a66d2ad and model type lock5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:58:42, skipping insertion in model container [2025-04-26 16:58:42,846 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:42,846 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "lock5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:42" (2/2) ... [2025-04-26 16:58:42,847 INFO L376 chiAutomizerObserver]: Analyzing ICFG lock5.c.bpl [2025-04-26 16:58:42,918 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 16:58:42,957 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:58:42,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:58:42,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:42,962 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:58:42,963 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:58:43,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 56 transitions, 147 flow [2025-04-26 16:58:43,035 INFO L116 PetriNetUnfolderBase]: 5/46 cut-off events. [2025-04-26 16:58:43,037 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 16:58:43,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 46 events. 5/46 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-04-26 16:58:43,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 56 transitions, 147 flow [2025-04-26 16:58:43,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 46 transitions, 122 flow [2025-04-26 16:58:43,047 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 57 places, 46 transitions, 122 flow [2025-04-26 16:58:43,054 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:58:43,793 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6331#[L15, thread1EXIT, thread4EXIT, L51, L64]true [2025-04-26 16:58:43,794 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6367#[thread4EXIT, L51, $Ultimate##0, L64, L17]true [2025-04-26 16:58:43,798 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6455#[L85, L51, $Ultimate##0, L64, L17]true [2025-04-26 16:58:43,801 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6287#[L15, thread1EXIT, L85, L51, L66]true [2025-04-26 16:58:43,812 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6801#[thread5EXIT, L51, L80, L64, L17]true [2025-04-26 16:58:43,820 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6623#[L80, L51, $Ultimate##0, L66, L17]true [2025-04-26 16:58:43,855 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 7613#[L96, thread3EXIT, $Ultimate##0, L83, L17]true [2025-04-26 16:58:43,866 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 7807#[L69, $Ultimate##0, L83, L17, L96]true [2025-04-26 16:58:44,144 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14615#[L15, thread4EXIT, L51, L37, L64]true [2025-04-26 16:58:44,163 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14565#[L15, L85, L37, L51, L66]true [2025-04-26 16:58:44,171 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14569#[L66, L37, L16, $Ultimate##0, L51, L80]true [2025-04-26 16:58:44,213 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16737#[L37, L16, $Ultimate##0, thread3EXIT, L96, L83]true [2025-04-26 16:58:44,243 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17229#[L37, L69, L16, $Ultimate##0, L96, L83]true [2025-04-26 16:58:44,332 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 19077#[L16, thread3EXIT, L96, thread2EXIT, L32, L83]true [2025-04-26 16:58:44,522 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 25789#[L48, L16, thread3EXIT, L96, L32, L83]true [2025-04-26 16:58:44,528 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 26187#[$Ultimate##0, L48, L16, L35, thread3EXIT, thread5EXIT]true [2025-04-26 16:58:44,528 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 26143#[$Ultimate##0, L16, L35, thread3EXIT, L101, L50]true [2025-04-26 16:58:44,529 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 26205#[L48, $Ultimate##0, L16, L35, thread3EXIT, L99]true [2025-04-26 16:58:44,582 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 27231#[$Ultimate##0, L48, L69, L16, L35, thread5EXIT]true [2025-04-26 16:58:44,594 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 27821#[L48, thread4EXIT, L16, L35, thread5EXIT, L64]true [2025-04-26 16:58:44,599 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 27929#[L99, thread4EXIT, L16, L35, L64, L50]true [2025-04-26 16:58:44,609 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 27595#[L15, L85, L35, L51, L66]true [2025-04-26 16:58:44,618 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 28959#[L16, L35, thread5EXIT, L64, L80, L50]true [2025-04-26 16:58:44,619 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 28957#[L67, L16, L51, L35, thread5EXIT, L80]true [2025-04-26 16:58:44,633 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 28733#[L66, L16, L51, L96, L80, L32]true [2025-04-26 16:58:44,633 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 28653#[L67, L16, L51, L96, L32, L83]true [2025-04-26 16:58:44,642 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 29847#[$Ultimate##0, L16, L35, L101, L64, L50]true [2025-04-26 16:58:44,645 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 30013#[L99, $Ultimate##0, L16, L35, L64, L50]true [2025-04-26 16:58:44,692 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 31719#[L69, L16, $Ultimate##0, L96, L32, L83]true [2025-04-26 16:58:44,745 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 33821#[L67, L16, $Ultimate##0, thread5EXIT, L80, thread2EXIT]true [2025-04-26 16:58:44,745 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 33795#[L67, L16, $Ultimate##0, L82, L101, thread2EXIT]true [2025-04-26 16:58:44,838 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 35273#[L67, L16, $Ultimate##0, L53, thread5EXIT, L80]true [2025-04-26 16:58:44,838 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 35229#[L67, L16, $Ultimate##0, L53, L82, L101]true [2025-04-26 16:58:44,906 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 37261#[L67, L16, $Ultimate##0, L82, L51, L101]true [2025-04-26 16:58:44,973 WARN L140 AmpleReduction]: Number of pruned transitions: 35229 [2025-04-26 16:58:44,973 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 34 [2025-04-26 16:58:44,973 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1871 [2025-04-26 16:58:44,973 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:1101 [2025-04-26 16:58:44,974 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:9682 [2025-04-26 16:58:44,974 WARN L145 AmpleReduction]: Times succ was already a loop node:1895 [2025-04-26 16:58:44,974 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:3062 [2025-04-26 16:58:44,974 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:58:45,014 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 12621 states, 12620 states have (on average 2.0370047543581618) internal successors, (in total 25707), 12620 states have internal predecessors, (25707), 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:58:45,023 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:58:45,023 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:58:45,023 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:58:45,023 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:58:45,023 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:58:45,023 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:58:45,023 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:58:45,023 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:58:45,054 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12621 states, 12620 states have (on average 2.0370047543581618) internal successors, (in total 25707), 12620 states have internal predecessors, (25707), 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:58:45,282 INFO L131 ngComponentsAnalysis]: Automaton has 1625 accepting balls. 8556 [2025-04-26 16:58:45,283 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:45,283 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:45,288 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:45,288 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:58:45,289 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:58:45,317 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12621 states, 12620 states have (on average 2.0370047543581618) internal successors, (in total 25707), 12620 states have internal predecessors, (25707), 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:58:45,479 INFO L131 ngComponentsAnalysis]: Automaton has 1625 accepting balls. 8556 [2025-04-26 16:58:45,480 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:45,480 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:45,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:45,482 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:58:45,486 INFO L752 eck$LassoCheckResult]: Stem: "[159] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[122] $Ultimate##0-->L32: Formula: (and (= v_l_16 0) (< 0 v_l_17)) InVars {l=v_l_17} OutVars{l=v_l_16} AuxVars[] AssignedVars[l]" [2025-04-26 16:58:45,486 INFO L754 eck$LassoCheckResult]: Loop: "[124] L32-->L34: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[126] L34-->L35: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[128] L35-->L32: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" [2025-04-26 16:58:45,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:45,491 INFO L85 PathProgramCache]: Analyzing trace with hash 6012, now seen corresponding path program 1 times [2025-04-26 16:58:45,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:45,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011480526] [2025-04-26 16:58:45,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:45,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:45,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:45,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:45,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:45,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:45,549 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:45,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:45,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:45,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:45,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:45,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:45,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:45,573 INFO L85 PathProgramCache]: Analyzing trace with hash 152989, now seen corresponding path program 1 times [2025-04-26 16:58:45,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:45,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314342297] [2025-04-26 16:58:45,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:45,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:45,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:45,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:45,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:45,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:45,581 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:45,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:45,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:45,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:45,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:45,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:45,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:45,589 INFO L85 PathProgramCache]: Analyzing trace with hash 179226690, now seen corresponding path program 1 times [2025-04-26 16:58:45,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:45,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102754875] [2025-04-26 16:58:45,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:45,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:45,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:45,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:45,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:45,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:45,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:45,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:45,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:45,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:45,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:45,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:45,688 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:45,688 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:45,688 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:45,688 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:45,688 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:45,689 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:45,689 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:45,689 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:45,689 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:45,689 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:45,689 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:45,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:45,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:45,746 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:45,747 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:45,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:45,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:45,751 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:58:45,753 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:58:45,757 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:45,757 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:45,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:58:45,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:45,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:45,816 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:58:45,821 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:58:45,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:45,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:45,855 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:58:45,855 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x2=0} Honda state: {x2=0} Generalized eigenvectors: [{x2=-8}, {x2=3}, {x2=4}] Lambdas: [1, 1, 1] Nus: [0, 0] [2025-04-26 16:58:45,861 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:58:45,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:45,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:45,863 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:58:45,865 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:58:45,867 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:45,867 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:45,884 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:58:45,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:45,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:45,886 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:58:45,887 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:58:45,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:45,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:45,979 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:45,984 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:58:45,985 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:45,985 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:45,985 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:45,985 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:45,985 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:45,985 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:45,985 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:45,985 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:45,985 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:45,985 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:45,985 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:45,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:45,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:46,028 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:46,031 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:46,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:46,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:46,035 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:58:46,036 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:58:46,037 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:58:46,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:46,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:46,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:46,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:46,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:46,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:46,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:46,057 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:58:46,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:58:46,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:46,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:46,065 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:58:46,067 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:58:46,068 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:58:46,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:46,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:46,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:46,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:46,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:46,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:46,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:46,082 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:46,087 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:46,087 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:46,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:46,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:46,092 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:58:46,093 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:58:46,093 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:46,097 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:58:46,097 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:46,097 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:46,097 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 16:58:46,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:46,105 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:46,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:46,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:46,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:46,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:46,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:46,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:46,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:46,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:46,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:46,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:46,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:46,154 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:46,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:46,193 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:58:46,209 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:58:46,230 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12621 states, 12620 states have (on average 2.0370047543581618) internal successors, (in total 25707), 12620 states have internal predecessors, (25707), 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 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 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:58:46,804 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12621 states, 12620 states have (on average 2.0370047543581618) internal successors, (in total 25707), 12620 states have internal predecessors, (25707), 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 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 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 34130 states and 73880 transitions. Complement of second has 7 states. [2025-04-26 16:58:46,806 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:58:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 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:58:46,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-04-26 16:58:46,813 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 131 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:58:46,813 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:46,813 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 131 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:58:46,814 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:46,814 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 131 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:58:46,814 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:46,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34130 states and 73880 transitions. [2025-04-26 16:58:47,191 INFO L131 ngComponentsAnalysis]: Automaton has 2293 accepting balls. 10737 [2025-04-26 16:58:47,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34130 states to 25444 states and 56425 transitions. [2025-04-26 16:58:47,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18282 [2025-04-26 16:58:47,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21005 [2025-04-26 16:58:47,504 INFO L74 IsDeterministic]: Start isDeterministic. Operand 25444 states and 56425 transitions. [2025-04-26 16:58:47,505 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:47,505 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25444 states and 56425 transitions. [2025-04-26 16:58:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25444 states and 56425 transitions. [2025-04-26 16:58:48,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25444 to 18749. [2025-04-26 16:58:48,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18749 states, 18749 states have (on average 2.2680676302736145) internal successors, (in total 42524), 18748 states have internal predecessors, (42524), 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:58:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18749 states to 18749 states and 42524 transitions. [2025-04-26 16:58:48,279 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18749 states and 42524 transitions. [2025-04-26 16:58:48,281 INFO L438 stractBuchiCegarLoop]: Abstraction has 18749 states and 42524 transitions. [2025-04-26 16:58:48,282 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:58:48,282 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18749 states and 42524 transitions. [2025-04-26 16:58:48,422 INFO L131 ngComponentsAnalysis]: Automaton has 1747 accepting balls. 8718 [2025-04-26 16:58:48,422 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:48,422 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:48,423 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:58:48,423 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:58:48,424 INFO L752 eck$LassoCheckResult]: Stem: "[159] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[162] L12-->$Ultimate##0: 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]" "[129] $Ultimate##0-->L48: Formula: (and (< 0 v_l_21) (= v_l_20 0)) InVars {l=v_l_21} OutVars{l=v_l_20} AuxVars[] AssignedVars[l]" [2025-04-26 16:58:48,424 INFO L754 eck$LassoCheckResult]: Loop: "[131] L48-->L50: Formula: (< v_x2_3 v_z_3) InVars {x2=v_x2_3, z=v_z_3} OutVars{x2=v_x2_3, z=v_z_3} AuxVars[] AssignedVars[]" "[133] L50-->L51: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[135] L51-->L48: Formula: (= v_x3_2 (+ v_x3_1 1)) InVars {x3=v_x3_2} OutVars{x3=v_x3_1} AuxVars[] AssignedVars[x3]" [2025-04-26 16:58:48,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:48,425 INFO L85 PathProgramCache]: Analyzing trace with hash 187741, now seen corresponding path program 1 times [2025-04-26 16:58:48,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:48,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914076599] [2025-04-26 16:58:48,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:48,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:48,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:48,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:48,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,432 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:48,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:48,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:48,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:48,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:48,437 INFO L85 PathProgramCache]: Analyzing trace with hash 159940, now seen corresponding path program 1 times [2025-04-26 16:58:48,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:48,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105391858] [2025-04-26 16:58:48,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:48,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:48,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:48,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:48,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,444 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:48,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:48,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:48,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:48,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:48,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1298154984, now seen corresponding path program 1 times [2025-04-26 16:58:48,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:48,449 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130533223] [2025-04-26 16:58:48,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:48,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:48,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:48,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:48,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:48,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:48,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:48,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:48,488 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:48,488 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:48,488 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:48,488 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:48,488 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:48,488 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,488 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:48,488 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:48,488 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:48,488 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:48,488 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:48,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,519 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:48,519 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:48,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,522 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:58:48,523 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:58:48,524 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:48,524 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:48,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:48,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,548 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:58:48,549 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:58:48,551 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:48,551 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:48,616 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:48,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:48,622 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:48,622 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:48,622 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:48,622 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:48,622 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:48,622 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,622 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:48,622 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:48,622 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:48,622 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:48,622 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:48,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,653 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:48,653 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:48,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,655 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:58:48,657 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:58:48,658 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:58:48,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:48,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:48,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:48,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:48,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:48,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:48,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:48,672 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:48,675 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:48,675 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:48,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,677 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:58:48,679 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:58:48,679 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:48,682 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:58:48,683 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:48,683 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:48,683 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 16:58:48,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:48,689 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:48,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:48,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:48,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:48,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:48,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:48,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:48,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:48,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:48,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:48,716 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:48,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:48,747 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:58:48,748 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:58:48,748 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18749 states and 42524 transitions. cyclomatic complexity: 25996 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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:58:49,247 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18749 states and 42524 transitions. cyclomatic complexity: 25996. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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 52752 states and 120247 transitions. Complement of second has 7 states. [2025-04-26 16:58:49,248 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:58:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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:58:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-04-26 16:58:49,248 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:58:49,249 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:49,249 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:58:49,249 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:49,249 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:58:49,249 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:49,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52752 states and 120247 transitions. [2025-04-26 16:58:49,799 INFO L131 ngComponentsAnalysis]: Automaton has 2353 accepting balls. 10838 [2025-04-26 16:58:50,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52752 states to 41989 states and 97985 transitions. [2025-04-26 16:58:50,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21829 [2025-04-26 16:58:50,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25010 [2025-04-26 16:58:50,201 INFO L74 IsDeterministic]: Start isDeterministic. Operand 41989 states and 97985 transitions. [2025-04-26 16:58:50,202 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:50,202 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41989 states and 97985 transitions. [2025-04-26 16:58:50,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41989 states and 97985 transitions. [2025-04-26 16:58:50,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41989 to 31997. [2025-04-26 16:58:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31997 states, 31997 states have (on average 2.4139763102790885) internal successors, (in total 77240), 31996 states have internal predecessors, (77240), 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:58:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31997 states to 31997 states and 77240 transitions. [2025-04-26 16:58:50,971 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31997 states and 77240 transitions. [2025-04-26 16:58:50,971 INFO L438 stractBuchiCegarLoop]: Abstraction has 31997 states and 77240 transitions. [2025-04-26 16:58:50,971 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:58:50,971 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31997 states and 77240 transitions. [2025-04-26 16:58:51,232 INFO L131 ngComponentsAnalysis]: Automaton has 1921 accepting balls. 9234 [2025-04-26 16:58:51,232 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:51,232 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:51,233 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:58:51,233 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:58:51,234 INFO L752 eck$LassoCheckResult]: Stem: "[159] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[162] L12-->$Ultimate##0: 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]" "[165] L13-->$Ultimate##0: 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]" "[136] $Ultimate##0-->L64: Formula: (and (= v_l_24 0) (< 0 v_l_25)) InVars {l=v_l_25} OutVars{l=v_l_24} AuxVars[] AssignedVars[l]" [2025-04-26 16:58:51,234 INFO L754 eck$LassoCheckResult]: Loop: "[138] L64-->L66: Formula: (< v_x3_4 v_z_6) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" "[140] L66-->L67: Formula: (= (+ v_x3_6 1) v_x3_5) InVars {x3=v_x3_6} OutVars{x3=v_x3_5} AuxVars[] AssignedVars[x3]" "[142] L67-->L64: Formula: (= v_x4_2 (+ v_x4_1 1)) InVars {x4=v_x4_2} OutVars{x4=v_x4_1} AuxVars[] AssignedVars[x4]" [2025-04-26 16:58:51,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:51,234 INFO L85 PathProgramCache]: Analyzing trace with hash 5821223, now seen corresponding path program 1 times [2025-04-26 16:58:51,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:51,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488042892] [2025-04-26 16:58:51,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:51,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:51,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:51,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:51,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:51,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:51,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:51,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:51,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:51,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:51,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:51,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:51,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash 166891, now seen corresponding path program 1 times [2025-04-26 16:58:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:51,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391624368] [2025-04-26 16:58:51,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:51,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:51,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:51,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:51,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:51,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:51,250 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:51,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:51,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:51,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:51,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:51,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:51,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1621499653, now seen corresponding path program 1 times [2025-04-26 16:58:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:51,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90599196] [2025-04-26 16:58:51,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:51,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:51,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:51,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:51,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:51,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:51,258 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:51,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:51,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:51,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:51,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:51,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:51,281 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:51,281 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:51,281 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:51,281 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:51,281 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:51,281 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:51,282 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:51,282 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:51,282 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:51,282 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:51,282 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:51,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:51,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:51,311 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:51,311 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:51,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:51,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:51,313 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:58:51,315 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:58:51,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:51,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:51,334 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:58:51,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:51,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:51,338 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:58:51,339 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:58:51,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:51,341 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:51,366 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:58:51,366 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x4=0} Honda state: {x4=0} Generalized eigenvectors: [{x4=-5}, {x4=-3}, {x4=7}] Lambdas: [1, 1, 1] Nus: [0, 0] [2025-04-26 16:58:51,371 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:58:51,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:51,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:51,373 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:58:51,374 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:58:51,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:51,377 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:51,395 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:58:51,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:51,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:51,397 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:58:51,399 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:58:51,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:51,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:51,468 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:51,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:51,473 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:51,473 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:51,473 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:51,473 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:51,473 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:51,473 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:51,473 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:51,473 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:51,473 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:51,473 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:51,473 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:51,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:51,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:51,500 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:51,500 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:51,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:51,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:51,502 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:58:51,504 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:58:51,505 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:58:51,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:51,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:51,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:51,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:51,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:51,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:51,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:51,519 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:58:51,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:51,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:51,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:51,526 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:58:51,528 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:58:51,530 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:58:51,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:51,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:51,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:51,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:51,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:51,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:51,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:51,544 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:51,546 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:51,547 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:51,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:51,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:51,549 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:58:51,551 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:58:51,552 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:51,554 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:51,555 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:58:51,555 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:51,555 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:51,555 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:58:51,560 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:58:51,561 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:51,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:51,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:51,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:51,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:51,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:51,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:51,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:51,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:51,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:51,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:51,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:51,592 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:51,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:51,623 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:58:51,624 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:58:51,624 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31997 states and 77240 transitions. cyclomatic complexity: 48523 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 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:58:52,328 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31997 states and 77240 transitions. cyclomatic complexity: 48523. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 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 92779 states and 223412 transitions. Complement of second has 7 states. [2025-04-26 16:58:52,329 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:58:52,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 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:58:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2025-04-26 16:58:52,330 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 137 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:58:52,330 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:52,330 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 137 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:58:52,330 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:52,330 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 137 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:58:52,330 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:52,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92779 states and 223412 transitions. [2025-04-26 16:58:53,306 INFO L131 ngComponentsAnalysis]: Automaton has 2515 accepting balls. 11272 [2025-04-26 16:58:53,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92779 states to 72670 states and 179285 transitions. [2025-04-26 16:58:53,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27383 [2025-04-26 16:58:53,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30815 [2025-04-26 16:58:53,977 INFO L74 IsDeterministic]: Start isDeterministic. Operand 72670 states and 179285 transitions. [2025-04-26 16:58:53,977 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:53,977 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72670 states and 179285 transitions. [2025-04-26 16:58:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72670 states and 179285 transitions. [2025-04-26 16:58:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72670 to 57505. [2025-04-26 16:58:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57505 states, 57505 states have (on average 2.547204590905139) internal successors, (in total 146477), 57504 states have internal predecessors, (146477), 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:58:55,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57505 states to 57505 states and 146477 transitions. [2025-04-26 16:58:55,387 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57505 states and 146477 transitions. [2025-04-26 16:58:55,387 INFO L438 stractBuchiCegarLoop]: Abstraction has 57505 states and 146477 transitions. [2025-04-26 16:58:55,388 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:58:55,388 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57505 states and 146477 transitions. [2025-04-26 16:58:55,775 INFO L131 ngComponentsAnalysis]: Automaton has 2168 accepting balls. 10005 [2025-04-26 16:58:55,775 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:55,775 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:55,776 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:58:55,776 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:58:55,777 INFO L752 eck$LassoCheckResult]: Stem: "[159] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[162] L12-->$Ultimate##0: 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]" "[165] L13-->$Ultimate##0: 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]" "[168] L14-->$Ultimate##0: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[143] $Ultimate##0-->L80: Formula: (and (< 0 v_l_29) (= v_l_28 0)) InVars {l=v_l_29} OutVars{l=v_l_28} AuxVars[] AssignedVars[l]" [2025-04-26 16:58:55,777 INFO L754 eck$LassoCheckResult]: Loop: "[145] L80-->L82: Formula: (< v_x4_3 v_z_7) InVars {x4=v_x4_3, z=v_z_7} OutVars{x4=v_x4_3, z=v_z_7} AuxVars[] AssignedVars[]" "[147] L82-->L83: Formula: (= v_x4_4 (+ v_x4_5 1)) InVars {x4=v_x4_5} OutVars{x4=v_x4_4} AuxVars[] AssignedVars[x4]" "[149] L83-->L80: Formula: (= v_x5_2 (+ v_x5_1 1)) InVars {x5=v_x5_2} OutVars{x5=v_x5_1} AuxVars[] AssignedVars[x5]" [2025-04-26 16:58:55,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,777 INFO L85 PathProgramCache]: Analyzing trace with hash 180459048, now seen corresponding path program 1 times [2025-04-26 16:58:55,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193278074] [2025-04-26 16:58:55,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:55,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:55,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,781 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:55,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:55,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,785 INFO L85 PathProgramCache]: Analyzing trace with hash 173842, now seen corresponding path program 1 times [2025-04-26 16:58:55,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101785266] [2025-04-26 16:58:55,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:55,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:55,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,787 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:55,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:55,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1243411573, now seen corresponding path program 1 times [2025-04-26 16:58:55,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249021527] [2025-04-26 16:58:55,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:55,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:55,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:55,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:55,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,823 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:55,823 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:55,823 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:55,823 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:55,823 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:55,823 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,824 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:55,824 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:55,824 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:55,824 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:55,824 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:55,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:55,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:55,850 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:55,850 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:55,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,852 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:58:55,853 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:58:55,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:55,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:55,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:58:55,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,872 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:58:55,874 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:58:55,874 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:55,874 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:55,899 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:58:55,899 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x5=0} Honda state: {x5=0} Generalized eigenvectors: [{x5=6}, {x5=-6}, {x5=-1}] Lambdas: [1, 1, 1] Nus: [0, 0] [2025-04-26 16:58:55,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:58:55,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,906 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:58:55,908 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:58:55,909 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:55,909 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:55,931 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:58:55,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,933 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:58:55,935 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:58:55,936 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:55,937 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,007 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:56,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:56,011 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:56,012 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:56,012 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:56,012 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:56,012 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:56,012 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,012 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:56,012 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:56,012 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:56,012 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:56,012 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:56,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,042 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:56,042 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:56,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,045 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:58:56,047 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:58:56,048 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:58:56,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:56,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:56,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:56,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:56,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:56,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:56,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:56,061 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:58:56,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:58:56,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,069 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:58:56,072 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:58:56,073 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:58:56,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:56,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:56,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:56,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:56,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:56,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:56,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:56,085 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:56,087 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:56,087 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:56,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,089 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:56,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:58:56,091 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:56,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:58:56,094 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:56,094 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:56,095 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x4, z) = -1*x4 + 1*z Supporting invariants [] [2025-04-26 16:58:56,099 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:58:56,100 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:56,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:56,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:56,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:56,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:56,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:56,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,128 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:56,154 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:58:56,155 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:58:56,155 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57505 states and 146477 transitions. cyclomatic complexity: 94081 Second operand has 4 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:58:57,580 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57505 states and 146477 transitions. cyclomatic complexity: 94081. Second operand has 4 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) Result 173289 states and 433471 transitions. Complement of second has 7 states. [2025-04-26 16:58:57,580 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:58:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 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:58:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2025-04-26 16:58:57,581 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 139 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:58:57,581 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:57,581 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 139 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:58:57,581 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:57,581 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 139 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:58:57,581 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:57,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173289 states and 433471 transitions. [2025-04-26 16:58:59,489 INFO L131 ngComponentsAnalysis]: Automaton has 3190 accepting balls. 13378 [2025-04-26 16:59:00,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173289 states to 135255 states and 345751 transitions. [2025-04-26 16:59:00,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37227 [2025-04-26 16:59:00,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40966 [2025-04-26 16:59:00,639 INFO L74 IsDeterministic]: Start isDeterministic. Operand 135255 states and 345751 transitions. [2025-04-26 16:59:00,639 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:00,639 INFO L218 hiAutomatonCegarLoop]: Abstraction has 135255 states and 345751 transitions. [2025-04-26 16:59:00,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135255 states and 345751 transitions. [2025-04-26 16:59:02,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135255 to 109063. [2025-04-26 16:59:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109063 states, 109063 states have (on average 2.6356509540357407) internal successors, (in total 287452), 109062 states have internal predecessors, (287452), 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:59:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109063 states to 109063 states and 287452 transitions. [2025-04-26 16:59:03,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 109063 states and 287452 transitions. [2025-04-26 16:59:03,500 INFO L438 stractBuchiCegarLoop]: Abstraction has 109063 states and 287452 transitions. [2025-04-26 16:59:03,500 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:59:03,500 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109063 states and 287452 transitions. [2025-04-26 16:59:04,146 INFO L131 ngComponentsAnalysis]: Automaton has 2626 accepting balls. 11425 [2025-04-26 16:59:04,146 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:04,146 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:04,147 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:59:04,147 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:59:04,147 INFO L752 eck$LassoCheckResult]: Stem: "[159] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[162] L12-->$Ultimate##0: 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]" "[165] L13-->$Ultimate##0: 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]" "[168] L14-->$Ultimate##0: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[171] L15-->$Ultimate##0: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[150] $Ultimate##0-->L96: Formula: (and (= v_l_32 0) (< 0 v_l_33)) InVars {l=v_l_33} OutVars{l=v_l_32} AuxVars[] AssignedVars[l]" [2025-04-26 16:59:04,148 INFO L754 eck$LassoCheckResult]: Loop: "[152] L96-->L98: Formula: (< v_x5_3 v_z_9) InVars {x5=v_x5_3, z=v_z_9} OutVars{x5=v_x5_3, z=v_z_9} AuxVars[] AssignedVars[]" "[154] L98-->L99: Formula: (= (+ v_x5_5 1) v_x5_4) InVars {x5=v_x5_5} OutVars{x5=v_x5_4} AuxVars[] AssignedVars[x5]" "[156] L99-->L96: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-04-26 16:59:04,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:04,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1299264210, now seen corresponding path program 1 times [2025-04-26 16:59:04,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:04,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980816998] [2025-04-26 16:59:04,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:04,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:04,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:59:04,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:59:04,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:04,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:04,152 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:04,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:59:04,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:59:04,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:04,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:04,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:04,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:04,155 INFO L85 PathProgramCache]: Analyzing trace with hash 180793, now seen corresponding path program 1 times [2025-04-26 16:59:04,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:04,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989145650] [2025-04-26 16:59:04,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:04,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:04,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:04,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:04,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:04,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:04,160 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:04,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:04,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:04,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:04,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:04,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:04,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:04,165 INFO L85 PathProgramCache]: Analyzing trace with hash 134959560, now seen corresponding path program 1 times [2025-04-26 16:59:04,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:04,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284465070] [2025-04-26 16:59:04,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:04,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:04,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:59:04,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:59:04,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:04,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:04,171 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:04,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:59:04,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:59:04,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:04,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:04,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:04,207 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:04,207 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:04,207 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:04,207 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:04,207 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:04,207 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:04,207 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:04,207 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:04,207 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:59:04,207 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:04,207 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:04,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:04,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:04,230 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:04,230 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:04,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:04,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:04,235 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:04,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:59:04,237 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:04,237 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:04,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:59:04,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:04,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:04,254 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:04,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:59:04,256 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:04,256 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:04,319 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:04,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:59:04,326 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:04,326 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:04,326 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:04,326 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:04,326 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:04,326 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:04,326 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:04,326 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:04,326 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:59:04,326 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:04,326 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:04,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:04,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:04,350 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:04,350 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:04,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:04,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:04,352 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:04,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:59:04,355 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:59:04,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:04,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:04,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:04,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:04,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:04,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:04,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:04,368 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:04,370 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:04,370 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:59:04,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:04,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:04,372 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:04,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:59:04,374 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:04,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:04,377 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:04,377 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:04,377 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, z) = -1*x5 + 1*z Supporting invariants [] [2025-04-26 16:59:04,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:59:04,383 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:04,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:04,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:59:04,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:59:04,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:04,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:04,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:04,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:04,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:04,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:04,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:04,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:04,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:04,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:04,441 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:59:04,441 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:59:04,441 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109063 states and 287452 transitions. cyclomatic complexity: 187027 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:59:06,794 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109063 states and 287452 transitions. cyclomatic complexity: 187027. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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 308173 states and 760717 transitions. Complement of second has 7 states. [2025-04-26 16:59:06,796 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:59:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:59:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-04-26 16:59:06,796 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 135 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:59:06,796 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:06,796 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 135 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 16:59:06,796 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:06,796 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 135 transitions. Stem has 6 letters. Loop has 6 letters. [2025-04-26 16:59:06,797 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:06,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 308173 states and 760717 transitions. [2025-04-26 16:59:10,499 INFO L131 ngComponentsAnalysis]: Automaton has 4131 accepting balls. 16220 [2025-04-26 16:59:12,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 308173 states to 238112 states and 604580 transitions. [2025-04-26 16:59:12,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49691 [2025-04-26 16:59:12,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52849 [2025-04-26 16:59:12,484 INFO L74 IsDeterministic]: Start isDeterministic. Operand 238112 states and 604580 transitions. [2025-04-26 16:59:12,484 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:12,484 INFO L218 hiAutomatonCegarLoop]: Abstraction has 238112 states and 604580 transitions. [2025-04-26 16:59:12,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238112 states and 604580 transitions. [2025-04-26 16:59:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238112 to 194645. [2025-04-26 16:59:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194645 states, 194645 states have (on average 2.6340363225358985) internal successors, (in total 512702), 194644 states have internal predecessors, (512702), 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:59:17,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194645 states to 194645 states and 512702 transitions. [2025-04-26 16:59:17,214 INFO L240 hiAutomatonCegarLoop]: Abstraction has 194645 states and 512702 transitions. [2025-04-26 16:59:17,214 INFO L438 stractBuchiCegarLoop]: Abstraction has 194645 states and 512702 transitions. [2025-04-26 16:59:17,215 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:59:17,215 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194645 states and 512702 transitions. [2025-04-26 16:59:18,413 INFO L131 ngComponentsAnalysis]: Automaton has 3265 accepting balls. 13312 [2025-04-26 16:59:18,414 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:18,414 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:18,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:59:18,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:59:18,416 INFO L752 eck$LassoCheckResult]: Stem: "[159] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[162] L12-->$Ultimate##0: 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]" "[129] $Ultimate##0-->L48: Formula: (and (< 0 v_l_21) (= v_l_20 0)) InVars {l=v_l_21} OutVars{l=v_l_20} AuxVars[] AssignedVars[l]" "[122] $Ultimate##0-->L32: Formula: (and (= v_l_16 0) (< 0 v_l_17)) InVars {l=v_l_17} OutVars{l=v_l_16} AuxVars[] AssignedVars[l]" "[124] L32-->L34: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[126] L34-->L35: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[128] L35-->L32: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" [2025-04-26 16:59:18,416 INFO L754 eck$LassoCheckResult]: Loop: "[131] L48-->L50: Formula: (< v_x2_3 v_z_3) InVars {x2=v_x2_3, z=v_z_3} OutVars{x2=v_x2_3, z=v_z_3} AuxVars[] AssignedVars[]" "[133] L50-->L51: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[135] L51-->L48: Formula: (= v_x3_2 (+ v_x3_1 1)) InVars {x3=v_x3_2} OutVars{x3=v_x3_1} AuxVars[] AssignedVars[x3]" [2025-04-26 16:59:18,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:18,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1587821921, now seen corresponding path program 1 times [2025-04-26 16:59:18,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:18,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794503839] [2025-04-26 16:59:18,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:18,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:18,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:59:18,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:59:18,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:18,445 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:59:18,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:59:18,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794503839] [2025-04-26 16:59:18,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794503839] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:59:18,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:59:18,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:59:18,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352496471] [2025-04-26 16:59:18,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:59:18,449 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:59:18,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash 159940, now seen corresponding path program 2 times [2025-04-26 16:59:18,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:18,449 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081819699] [2025-04-26 16:59:18,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:59:18,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:18,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:18,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:18,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:59:18,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:18,452 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:18,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:18,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:18,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:18,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:18,466 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:18,467 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:18,467 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:18,467 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:18,467 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:18,467 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:18,467 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:18,467 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:18,467 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:59:18,467 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:18,467 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:18,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:18,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:18,487 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:18,487 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:18,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:18,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:18,489 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:18,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:59:18,494 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:18,494 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:18,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:18,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:18,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:18,512 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:18,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:59:18,514 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:18,514 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:18,573 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:18,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:59:18,577 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:18,577 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:18,577 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:18,577 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:18,577 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:18,578 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:18,578 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:18,578 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:18,578 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:59:18,578 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:18,578 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:18,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:18,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:18,601 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:18,601 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:18,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:18,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:18,602 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:18,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:59:18,605 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:59:18,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:18,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:18,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:18,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:18,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:18,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:18,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:18,617 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:18,619 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:18,619 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:59:18,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:18,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:18,621 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:18,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:59:18,623 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:18,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:59:18,625 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:18,625 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:18,625 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 16:59:18,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:18,630 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:18,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:18,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:59:18,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:59:18,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:18,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:18,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:18,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:18,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:18,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:18,671 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:18,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:18,698 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:59:18,698 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:59:18,698 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 194645 states and 512702 transitions. cyclomatic complexity: 332500 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 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:59:24,167 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 194645 states and 512702 transitions. cyclomatic complexity: 332500. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 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 744377 states and 1908702 transitions. Complement of second has 7 states. [2025-04-26 16:59:24,167 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:59:24,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 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:59:24,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2025-04-26 16:59:24,168 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 149 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:59:24,168 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:24,168 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 149 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 16:59:24,168 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:24,168 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 149 transitions. Stem has 7 letters. Loop has 6 letters. [2025-04-26 16:59:24,168 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:24,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 744377 states and 1908702 transitions. [2025-04-26 16:59:32,093 INFO L131 ngComponentsAnalysis]: Automaton has 5565 accepting balls. 21379 [2025-04-26 16:59:37,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 744377 states to 597665 states and 1523553 transitions. [2025-04-26 16:59:37,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99046 [2025-04-26 16:59:37,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108021 [2025-04-26 16:59:37,334 INFO L74 IsDeterministic]: Start isDeterministic. Operand 597665 states and 1523553 transitions. [2025-04-26 16:59:37,335 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:37,335 INFO L218 hiAutomatonCegarLoop]: Abstraction has 597665 states and 1523553 transitions. [2025-04-26 16:59:38,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597665 states and 1523553 transitions. [2025-04-26 16:59:44,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597665 to 336242. [2025-04-26 16:59:44,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336242 states, 336242 states have (on average 2.762150474955538) internal successors, (in total 928751), 336241 states have internal predecessors, (928751), 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:59:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336242 states to 336242 states and 928751 transitions. [2025-04-26 16:59:46,199 INFO L240 hiAutomatonCegarLoop]: Abstraction has 336242 states and 928751 transitions. [2025-04-26 16:59:46,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:59:46,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:59:46,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:59:46,202 INFO L87 Difference]: Start difference. First operand 336242 states and 928751 transitions. 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:59:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:59:46,252 INFO L93 Difference]: Finished difference Result 1444 states and 2258 transitions. [2025-04-26 16:59:46,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1444 states and 2258 transitions. [2025-04-26 16:59:46,255 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:59:46,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1444 states to 0 states and 0 transitions. [2025-04-26 16:59:46,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:59:46,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:59:46,255 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:59:46,255 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:59:46,255 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:59:46,255 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:59:46,255 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:59:46,256 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:59:46,256 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:59:46,256 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:59:46,256 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:59:46,256 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:59:46,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:46,266 INFO L201 PluginConnector]: Adding new model lock5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:59:46 BoogieIcfgContainer [2025-04-26 16:59:46,266 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:59:46,266 INFO L158 Benchmark]: Toolchain (without parser) took 63714.47ms. Allocated memory was 155.2MB in the beginning and 7.9GB in the end (delta: 7.8GB). Free memory was 84.7MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 6.2GB. Max. memory is 8.0GB. [2025-04-26 16:59:46,266 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 155.2MB. Free memory was 85.7MB in the beginning and 85.5MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:59:46,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.81ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 82.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:59:46,267 INFO L158 Benchmark]: Boogie Preprocessor took 30.37ms. Allocated memory is still 155.2MB. Free memory was 82.8MB in the beginning and 81.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:59:46,267 INFO L158 Benchmark]: RCFGBuilder took 222.94ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 71.1MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:59:46,267 INFO L158 Benchmark]: BuchiAutomizer took 63425.06ms. Allocated memory was 155.2MB in the beginning and 7.9GB in the end (delta: 7.8GB). Free memory was 71.1MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 6.2GB. Max. memory is 8.0GB. [2025-04-26 16:59:46,268 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17ms. Allocated memory is still 155.2MB. Free memory was 85.7MB in the beginning and 85.5MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.81ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 82.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 30.37ms. Allocated memory is still 155.2MB. Free memory was 82.8MB in the beginning and 81.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 222.94ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 71.1MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 63425.06ms. Allocated memory was 155.2MB in the beginning and 7.9GB in the end (delta: 7.8GB). Free memory was 71.1MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 6.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 63.3s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.3s. Büchi inclusion checks took 11.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 19.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 362934 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 24.6s Buchi closure took 0.6s. 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, 641 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 635 mSDsluCounter, 678 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 306 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 677 IncrementalHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 372 mSDtfsCounter, 677 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp70 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 3 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 2.0s InitialAbstraction: Time to compute Ample Reduction [ms]: 2021, Number of transitions in reduction automaton: 25707, Number of states in reduction automaton: 12621, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (1 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:59:46,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...