/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 18:43:53,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:43:53,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:43:53,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:43:53,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:43:53,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:43:53,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:43:53,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:43:53,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:43:53,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:43:53,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:43:53,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:43:53,469 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:43:53,469 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:43:53,469 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:43:53,469 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:43:53,469 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:43:53,469 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:43:53,469 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:43:53,470 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:43:53,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:43:53,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:43:53,470 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:43:53,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:43:53,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:43:53,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:43:53,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:43:53,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:43:53,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:43:53,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:43:53,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:43:53,470 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:43:53,470 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:43:53,470 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:43:53,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:43:53,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:43:53,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:43:53,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:43:53,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:43:53,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:43:53,471 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:43:53,471 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:43:53,471 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:43:53,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:43:53,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:43:53,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:43:53,707 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:43:53,707 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:43:53,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/lock5.c.bpl [2025-04-26 18:43:53,710 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/lock5.c.bpl' [2025-04-26 18:43:53,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:43:53,733 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:43:53,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:43:53,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:43:53,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:43:53,743 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 06:43:53" (1/1) ... [2025-04-26 18:43:53,766 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 06:43:53" (1/1) ... [2025-04-26 18:43:53,772 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:43:53,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:43:53,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:43:53,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:43:53,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:43:53,780 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 06:43:53" (1/1) ... [2025-04-26 18:43:53,780 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 06:43:53" (1/1) ... [2025-04-26 18:43:53,782 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 06:43:53" (1/1) ... [2025-04-26 18:43:53,782 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 06:43:53" (1/1) ... [2025-04-26 18:43:53,785 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 06:43:53" (1/1) ... [2025-04-26 18:43:53,786 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 06:43:53" (1/1) ... [2025-04-26 18:43:53,789 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 06:43:53" (1/1) ... [2025-04-26 18:43:53,792 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 06:43:53" (1/1) ... [2025-04-26 18:43:53,793 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 06:43:53" (1/1) ... [2025-04-26 18:43:53,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:43:53,803 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:43:53,803 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:43:53,803 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:43:53,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "lock5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:53" (1/1) ... [2025-04-26 18:43:53,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:43:53,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:53,830 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 18:43:53,831 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 18:43:53,847 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:43:53,847 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:43:53,848 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:43:53,848 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:43:53,848 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:43:53,848 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:43:53,848 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:43:53,848 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:43:53,848 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:43:53,848 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:43:53,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:43:53,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:43:53,848 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:43:53,848 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:43:53,848 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:43:53,848 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 18:43:53,848 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 18:43:53,848 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 18:43:53,849 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 18:43:53,883 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:43:53,885 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:43:53,965 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:43:53,965 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:43:53,977 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:43:53,977 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:43:53,978 INFO L201 PluginConnector]: Adding new model lock5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:43:53 BoogieIcfgContainer [2025-04-26 18:43:53,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:43:53,978 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:43:53,978 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:43:53,982 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:43:53,982 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:43:53,983 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "lock5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:53" (1/2) ... [2025-04-26 18:43:53,983 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41fded87 and model type lock5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:43:53, skipping insertion in model container [2025-04-26 18:43:53,984 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:43:53,984 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 06:43:53" (2/2) ... [2025-04-26 18:43:53,984 INFO L376 chiAutomizerObserver]: Analyzing ICFG lock5.c.bpl [2025-04-26 18:43:54,030 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 18:43:54,070 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:43:54,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:43:54,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:54,072 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 18:43:54,074 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 18:43:54,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 56 transitions, 147 flow [2025-04-26 18:43:54,143 INFO L116 PetriNetUnfolderBase]: 5/46 cut-off events. [2025-04-26 18:43:54,146 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 18:43:54,149 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 18:43:54,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 56 transitions, 147 flow [2025-04-26 18:43:54,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 46 transitions, 122 flow [2025-04-26 18:43:54,152 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 57 places, 46 transitions, 122 flow [2025-04-26 18:43:54,153 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 46 transitions, 122 flow [2025-04-26 18:43:55,008 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 22410 states, 22409 states have (on average 4.958454192511937) internal successors, (in total 111114), 22409 states have internal predecessors, (111114), 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 18:43:55,110 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 22410 states, 22409 states have (on average 4.958454192511937) internal successors, (in total 111114), 22409 states have internal predecessors, (111114), 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 18:43:55,112 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:43:55,641 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 22245#[L64, L51, thread4EXIT, L15, thread1EXIT]true [2025-04-26 18:43:55,642 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 33295#[L64, $Ultimate##0, L51, thread4EXIT, L17]true [2025-04-26 18:43:55,644 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 21957#[L64, $Ultimate##0, L51, L85, L17]true [2025-04-26 18:43:55,647 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16563#[L66, L51, L85, L15, thread1EXIT]true [2025-04-26 18:43:55,655 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 36201#[L64, L80, L51, thread5EXIT, L17]true [2025-04-26 18:43:55,665 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 21963#[L66, L80, $Ultimate##0, L51, L17]true [2025-04-26 18:43:55,689 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 33185#[L83, $Ultimate##0, thread3EXIT, L96, L17]true [2025-04-26 18:43:55,698 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 21819#[L83, $Ultimate##0, L96, L69, L17]true [2025-04-26 18:43:55,864 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12395#[L64, L37, L51, thread4EXIT, L15]true [2025-04-26 18:43:55,874 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8179#[L37, L51, L66, L85, L15]true [2025-04-26 18:43:55,881 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8151#[L80, L51, $Ultimate##0, L16, L37, L66]true [2025-04-26 18:43:55,910 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17441#[L96, thread3EXIT, $Ultimate##0, L16, L37, L83]true [2025-04-26 18:43:55,928 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8055#[L96, $Ultimate##0, L16, L69, L37, L83]true [2025-04-26 18:43:55,965 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 35979#[thread2EXIT, L96, thread3EXIT, L16, L83, L32]true [2025-04-26 18:43:56,134 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 20057#[L32, L96, thread3EXIT, L16, L48, L83]true [2025-04-26 18:43:56,136 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 30129#[thread5EXIT, thread3EXIT, L35, L16, $Ultimate##0, L48]true [2025-04-26 18:43:56,136 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 24483#[L101, thread3EXIT, L35, L16, $Ultimate##0, L50]true [2025-04-26 18:43:56,137 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 24509#[thread3EXIT, L35, L16, $Ultimate##0, L48, L99]true [2025-04-26 18:43:56,147 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 18663#[thread5EXIT, L35, L16, L69, $Ultimate##0, L48]true [2025-04-26 18:43:56,153 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 34535#[L64, thread5EXIT, L35, L16, thread4EXIT, L48]true [2025-04-26 18:43:56,155 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 34799#[L64, L35, L16, thread4EXIT, L99, L50]true [2025-04-26 18:43:56,161 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 13257#[L66, L51, L35, L85, L15]true [2025-04-26 18:43:56,166 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 23857#[L64, L80, thread5EXIT, L35, L16, L50]true [2025-04-26 18:43:56,166 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 38547#[L80, thread5EXIT, L35, L51, L16, L67]true [2025-04-26 18:43:56,174 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10065#[L80, L96, L51, L16, L66, L32]true [2025-04-26 18:43:56,174 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 25837#[L96, L51, L16, L67, L83, L32]true [2025-04-26 18:43:56,180 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8955#[L64, L101, L35, L16, $Ultimate##0, L50]true [2025-04-26 18:43:56,181 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 13395#[L64, L35, L16, $Ultimate##0, L99, L50]true [2025-04-26 18:43:56,209 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6265#[L96, $Ultimate##0, L16, L69, L83, L32]true [2025-04-26 18:43:56,239 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 31549#[L80, thread5EXIT, $Ultimate##0, L16, L67, thread2EXIT]true [2025-04-26 18:43:56,239 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 26371#[L101, L82, $Ultimate##0, L16, L67, thread2EXIT]true [2025-04-26 18:43:56,263 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 20527#[L80, thread5EXIT, $Ultimate##0, L53, L16, L67]true [2025-04-26 18:43:56,263 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 15299#[L101, L82, $Ultimate##0, L53, L16, L67]true [2025-04-26 18:43:56,291 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 20715#[L101, L82, L51, $Ultimate##0, L16, L67]true [2025-04-26 18:43:56,323 WARN L140 AmpleReduction]: Number of pruned transitions: 35229 [2025-04-26 18:43:56,323 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 34 [2025-04-26 18:43:56,324 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1871 [2025-04-26 18:43:56,324 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:1101 [2025-04-26 18:43:56,324 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:9682 [2025-04-26 18:43:56,324 WARN L145 AmpleReduction]: Times succ was already a loop node:1897 [2025-04-26 18:43:56,324 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:3057 [2025-04-26 18:43:56,324 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:43:56,350 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 18:43:56,358 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:43:56,358 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:43:56,358 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:43:56,358 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:43:56,358 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:43:56,358 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:43:56,358 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:43:56,358 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:43:56,377 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 18:43:56,591 INFO L131 ngComponentsAnalysis]: Automaton has 1625 accepting balls. 8556 [2025-04-26 18:43:56,591 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:56,591 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:56,596 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:43:56,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:43:56,596 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:43:56,611 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 18:43:56,754 INFO L131 ngComponentsAnalysis]: Automaton has 1625 accepting balls. 8556 [2025-04-26 18:43:56,756 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:56,756 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:56,756 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:43:56,756 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:43:56,761 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 18:43:56,761 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 18:43:56,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:56,767 INFO L85 PathProgramCache]: Analyzing trace with hash 6012, now seen corresponding path program 1 times [2025-04-26 18:43:56,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:56,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140215412] [2025-04-26 18:43:56,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:56,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:56,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:56,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:56,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:56,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:56,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:56,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:56,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:56,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:56,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:56,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:56,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:56,849 INFO L85 PathProgramCache]: Analyzing trace with hash 152989, now seen corresponding path program 1 times [2025-04-26 18:43:56,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:56,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304729591] [2025-04-26 18:43:56,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:56,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:56,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:56,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:56,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:56,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:56,859 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:56,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:56,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:56,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:56,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:56,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:56,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:56,866 INFO L85 PathProgramCache]: Analyzing trace with hash 179226690, now seen corresponding path program 1 times [2025-04-26 18:43:56,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:56,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506737388] [2025-04-26 18:43:56,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:56,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:56,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:43:56,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:43:56,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:56,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:56,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:56,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:43:56,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:43:56,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:56,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:56,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:56,956 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:56,957 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:56,958 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:56,958 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:56,958 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:56,958 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:56,958 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:56,958 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:56,958 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:43:56,958 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:56,959 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:56,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:56,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:57,051 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:57,052 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:57,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:57,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:57,061 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 18:43:57,064 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 18:43:57,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:57,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:57,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:57,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:57,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:57,129 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 18:43:57,136 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 18:43:57,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:57,137 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:57,172 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:43:57,172 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 18:43:57,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:43:57,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:57,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:57,181 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 18:43:57,189 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 18:43:57,190 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:57,190 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:57,208 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 18:43:57,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:57,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:57,210 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 18:43:57,214 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 18:43:57,217 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:57,217 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:57,296 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:57,301 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 18:43:57,301 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:57,301 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:57,301 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:57,301 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:57,301 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:57,301 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:57,301 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:57,301 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:57,301 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:43:57,301 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:57,301 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:57,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:57,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:57,336 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:57,340 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:57,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:57,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:57,342 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 18:43:57,344 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 18:43:57,346 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 18:43:57,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:57,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:57,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:57,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:57,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:57,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:57,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:57,367 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:43:57,373 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 18:43:57,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:57,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:57,375 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 18:43:57,375 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 18:43:57,376 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 18:43:57,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:57,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:57,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:57,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:57,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:57,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:57,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:57,390 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:57,394 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:43:57,395 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:43:57,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:57,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:57,398 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 18:43:57,400 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 18:43:57,400 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:57,403 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 18:43:57,404 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:57,404 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:57,405 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 18:43:57,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:43:57,413 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:57,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:57,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:57,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:57,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:57,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:57,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:57,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:57,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:57,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:57,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:57,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:57,466 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:57,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:57,511 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 18:43:57,528 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 18:43:57,545 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 18:43:58,068 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 18:43:58,069 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 18:43:58,072 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 18:43:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-04-26 18:43:58,075 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 131 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 18:43:58,076 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:58,076 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 131 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:43:58,076 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:58,076 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 131 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 18:43:58,076 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:58,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34130 states and 73880 transitions. [2025-04-26 18:43:58,495 INFO L131 ngComponentsAnalysis]: Automaton has 2293 accepting balls. 10737 [2025-04-26 18:43:58,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34130 states to 25444 states and 56425 transitions. [2025-04-26 18:43:58,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18282 [2025-04-26 18:43:58,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21005 [2025-04-26 18:43:58,804 INFO L74 IsDeterministic]: Start isDeterministic. Operand 25444 states and 56425 transitions. [2025-04-26 18:43:58,804 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:58,804 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25444 states and 56425 transitions. [2025-04-26 18:43:58,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25444 states and 56425 transitions. [2025-04-26 18:43:59,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25444 to 18749. [2025-04-26 18:43:59,418 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 18:43:59,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18749 states to 18749 states and 42524 transitions. [2025-04-26 18:43:59,470 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18749 states and 42524 transitions. [2025-04-26 18:43:59,470 INFO L438 stractBuchiCegarLoop]: Abstraction has 18749 states and 42524 transitions. [2025-04-26 18:43:59,471 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:43:59,471 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18749 states and 42524 transitions. [2025-04-26 18:43:59,566 INFO L131 ngComponentsAnalysis]: Automaton has 1747 accepting balls. 8718 [2025-04-26 18:43:59,566 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:59,566 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:59,567 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:43:59,567 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:43:59,567 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 18:43:59,568 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 18:43:59,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:59,568 INFO L85 PathProgramCache]: Analyzing trace with hash 187741, now seen corresponding path program 1 times [2025-04-26 18:43:59,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:59,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731161151] [2025-04-26 18:43:59,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:59,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:59,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:59,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:59,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:59,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:59,573 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:59,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:59,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:59,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:59,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:59,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:59,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash 159940, now seen corresponding path program 1 times [2025-04-26 18:43:59,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:59,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261196874] [2025-04-26 18:43:59,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:59,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:59,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:59,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:59,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:59,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:59,584 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:59,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:59,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:59,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:59,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:59,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:59,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:59,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1298154984, now seen corresponding path program 1 times [2025-04-26 18:43:59,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:59,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203526438] [2025-04-26 18:43:59,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:59,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:59,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:43:59,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:43:59,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:59,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:59,600 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:59,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:43:59,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:43:59,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:59,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:59,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:59,631 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:59,631 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:59,631 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:59,631 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:59,631 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:59,631 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:59,631 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:59,631 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:59,631 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:43:59,631 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:59,631 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:59,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:59,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:59,662 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:59,663 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:59,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:59,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:59,665 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 18:43:59,666 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 18:43:59,668 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:59,668 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:59,685 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 18:43:59,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:59,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:59,687 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 18:43:59,689 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 18:43:59,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:59,691 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:59,753 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:59,758 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 18:43:59,758 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:59,758 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:59,758 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:59,758 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:59,758 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:59,758 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:59,758 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:59,758 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:59,758 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:43:59,759 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:59,759 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:59,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:59,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:59,787 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:59,787 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:59,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:59,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:59,789 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 18:43:59,792 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 18:43:59,793 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 18:43:59,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:59,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:59,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:59,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:59,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:59,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:59,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:59,811 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:59,814 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:43:59,814 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:43:59,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:59,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:59,817 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 18:43:59,818 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 18:43:59,818 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:59,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:59,822 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:59,823 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:59,823 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 18:43:59,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:43:59,833 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:59,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:59,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:59,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:59,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:59,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:59,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:59,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:59,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:59,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:59,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:59,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:59,865 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:59,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:59,893 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 18:43:59,893 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 18:43:59,894 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 18:44:00,533 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 18:44:00,534 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 18:44:00,535 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 18:44:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-04-26 18:44:00,535 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:44:00,535 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:00,535 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:44:00,535 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:00,535 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:44:00,535 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:00,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52752 states and 120247 transitions. [2025-04-26 18:44:01,166 INFO L131 ngComponentsAnalysis]: Automaton has 2353 accepting balls. 10838 [2025-04-26 18:44:01,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52752 states to 41989 states and 97985 transitions. [2025-04-26 18:44:01,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21829 [2025-04-26 18:44:01,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25010 [2025-04-26 18:44:01,708 INFO L74 IsDeterministic]: Start isDeterministic. Operand 41989 states and 97985 transitions. [2025-04-26 18:44:01,708 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:01,708 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41989 states and 97985 transitions. [2025-04-26 18:44:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41989 states and 97985 transitions. [2025-04-26 18:44:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41989 to 31997. [2025-04-26 18:44:02,429 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 18:44:02,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31997 states to 31997 states and 77240 transitions. [2025-04-26 18:44:02,520 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31997 states and 77240 transitions. [2025-04-26 18:44:02,520 INFO L438 stractBuchiCegarLoop]: Abstraction has 31997 states and 77240 transitions. [2025-04-26 18:44:02,520 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:44:02,520 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31997 states and 77240 transitions. [2025-04-26 18:44:02,663 INFO L131 ngComponentsAnalysis]: Automaton has 1921 accepting balls. 9234 [2025-04-26 18:44:02,663 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:02,663 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:02,664 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:44:02,664 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:44:02,664 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 18:44:02,664 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 18:44:02,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:02,665 INFO L85 PathProgramCache]: Analyzing trace with hash 5821223, now seen corresponding path program 1 times [2025-04-26 18:44:02,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:02,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656620314] [2025-04-26 18:44:02,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:02,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:02,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:44:02,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:44:02,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:02,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:44:02,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:44:02,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:02,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:02,678 INFO L85 PathProgramCache]: Analyzing trace with hash 166891, now seen corresponding path program 1 times [2025-04-26 18:44:02,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:02,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5106583] [2025-04-26 18:44:02,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:02,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:02,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:02,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:02,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,684 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:02,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:02,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:02,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:02,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:02,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1621499653, now seen corresponding path program 1 times [2025-04-26 18:44:02,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:02,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114240467] [2025-04-26 18:44:02,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:02,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:02,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:44:02,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:44:02,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,695 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:02,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:44:02,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:44:02,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:02,728 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:02,728 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:02,728 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:02,728 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:02,728 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:02,728 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,728 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:02,728 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:02,728 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:02,728 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:02,728 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:02,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:02,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:02,753 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:02,753 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:02,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:02,755 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 18:44:02,757 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 18:44:02,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:02,758 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:02,778 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 18:44:02,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:02,781 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 18:44:02,781 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 18:44:02,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:02,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:02,811 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:44:02,812 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 18:44:02,817 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 18:44:02,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:02,819 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 18:44:02,820 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 18:44:02,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:02,821 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:02,838 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 18:44:02,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:02,841 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 18:44:02,842 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 18:44:02,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:02,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:02,907 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:02,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:44:02,912 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:02,912 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:02,912 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:02,912 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:02,912 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:02,912 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,912 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:02,912 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:02,912 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:02,912 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:02,912 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:02,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:02,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:02,938 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:02,938 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:02,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:02,940 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 18:44:02,942 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 18:44:02,943 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 18:44:02,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:02,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:02,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:02,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:02,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:02,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:02,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:02,956 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:44:02,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:44:02,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:02,963 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 18:44:02,964 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 18:44:02,965 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 18:44:02,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:02,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:02,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:02,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:02,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:02,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:02,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:02,980 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:02,982 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:02,982 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:02,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:02,984 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 18:44:02,985 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 18:44:02,987 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:02,989 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 18:44:02,990 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:02,990 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:02,990 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 18:44:02,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:44:02,996 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:03,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:44:03,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:44:03,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:03,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:03,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:03,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:03,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:03,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:03,022 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:03,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:03,055 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 18:44:03,055 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 18:44:03,055 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 18:44:04,033 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 18:44:04,034 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 18:44:04,035 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 18:44:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2025-04-26 18:44:04,035 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 137 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 18:44:04,035 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,035 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 137 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 18:44:04,036 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,036 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 137 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 18:44:04,036 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92779 states and 223412 transitions. [2025-04-26 18:44:04,981 INFO L131 ngComponentsAnalysis]: Automaton has 2515 accepting balls. 11272 [2025-04-26 18:44:05,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92779 states to 72670 states and 179285 transitions. [2025-04-26 18:44:05,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27383 [2025-04-26 18:44:05,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30815 [2025-04-26 18:44:05,697 INFO L74 IsDeterministic]: Start isDeterministic. Operand 72670 states and 179285 transitions. [2025-04-26 18:44:05,697 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:05,697 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72670 states and 179285 transitions. [2025-04-26 18:44:05,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72670 states and 179285 transitions. [2025-04-26 18:44:06,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72670 to 57505. [2025-04-26 18:44:06,915 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 18:44:07,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57505 states to 57505 states and 146477 transitions. [2025-04-26 18:44:07,111 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57505 states and 146477 transitions. [2025-04-26 18:44:07,111 INFO L438 stractBuchiCegarLoop]: Abstraction has 57505 states and 146477 transitions. [2025-04-26 18:44:07,111 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:44:07,111 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57505 states and 146477 transitions. [2025-04-26 18:44:07,604 INFO L131 ngComponentsAnalysis]: Automaton has 2168 accepting balls. 10005 [2025-04-26 18:44:07,604 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:07,604 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:07,605 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:44:07,605 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:44:07,606 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 18:44:07,606 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 18:44:07,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:07,607 INFO L85 PathProgramCache]: Analyzing trace with hash 180459048, now seen corresponding path program 1 times [2025-04-26 18:44:07,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:07,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940482085] [2025-04-26 18:44:07,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:07,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:07,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:44:07,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:44:07,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:07,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:07,615 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:07,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:44:07,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:44:07,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:07,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:07,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:07,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:07,619 INFO L85 PathProgramCache]: Analyzing trace with hash 173842, now seen corresponding path program 1 times [2025-04-26 18:44:07,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:07,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019574723] [2025-04-26 18:44:07,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:07,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:07,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:07,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:07,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:07,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:07,622 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:07,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:07,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:07,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:07,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:07,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:07,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:07,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1243411573, now seen corresponding path program 1 times [2025-04-26 18:44:07,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:07,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65695283] [2025-04-26 18:44:07,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:07,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:07,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:44:07,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:44:07,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:07,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:07,630 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:07,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:44:07,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:44:07,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:07,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:07,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:07,663 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:07,663 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:07,663 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:07,663 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:07,663 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:07,663 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:07,663 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:07,663 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:07,663 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:07,663 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:07,663 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:07,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:07,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:07,688 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:07,688 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:07,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:07,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:07,690 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 18:44:07,691 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 18:44:07,693 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:07,693 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:07,709 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 18:44:07,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:07,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:07,711 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 18:44:07,712 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 18:44:07,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:07,713 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:07,738 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:44:07,739 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 18:44:07,744 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 18:44:07,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:07,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:07,747 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 18:44:07,749 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 18:44:07,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:07,752 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:07,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:07,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:07,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:07,771 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 18:44:07,772 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 18:44:07,774 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:07,775 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:07,843 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:07,848 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 18:44:07,848 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:07,848 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:07,848 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:07,848 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:07,848 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:07,848 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:07,848 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:07,848 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:07,848 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:07,848 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:07,848 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:07,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:07,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:07,877 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:07,878 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:07,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:07,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:07,881 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 18:44:07,882 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 18:44:07,883 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 18:44:07,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:07,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:07,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:07,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:07,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:07,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:07,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:07,896 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:44:07,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:07,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:07,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:07,904 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 18:44:07,906 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 18:44:07,908 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 18:44:07,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:07,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:07,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:07,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:07,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:07,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:07,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:07,921 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:07,923 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:07,923 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:07,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:07,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:07,925 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 18:44:07,926 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 18:44:07,927 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:07,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:07,931 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:07,931 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:07,931 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x4, z) = -1*x4 + 1*z Supporting invariants [] [2025-04-26 18:44:07,936 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 18:44:07,937 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:07,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:07,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:44:07,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:44:07,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:07,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:07,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:07,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:07,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:07,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:07,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:07,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:07,967 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:07,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:07,989 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 18:44:07,990 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 18:44:07,990 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 18:44:09,421 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 18:44:09,422 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 18:44:09,423 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 18:44:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2025-04-26 18:44:09,423 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 139 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:44:09,423 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:09,423 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 139 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:44:09,423 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:09,423 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 139 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 18:44:09,423 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:09,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173289 states and 433471 transitions. [2025-04-26 18:44:11,450 INFO L131 ngComponentsAnalysis]: Automaton has 3190 accepting balls. 13378 [2025-04-26 18:44:12,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173289 states to 135255 states and 345751 transitions. [2025-04-26 18:44:12,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37227 [2025-04-26 18:44:12,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40966 [2025-04-26 18:44:12,734 INFO L74 IsDeterministic]: Start isDeterministic. Operand 135255 states and 345751 transitions. [2025-04-26 18:44:12,735 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:12,735 INFO L218 hiAutomatonCegarLoop]: Abstraction has 135255 states and 345751 transitions. [2025-04-26 18:44:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135255 states and 345751 transitions. [2025-04-26 18:44:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135255 to 109063. [2025-04-26 18:44:14,570 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 18:44:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109063 states to 109063 states and 287452 transitions. [2025-04-26 18:44:15,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 109063 states and 287452 transitions. [2025-04-26 18:44:15,291 INFO L438 stractBuchiCegarLoop]: Abstraction has 109063 states and 287452 transitions. [2025-04-26 18:44:15,291 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:44:15,291 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109063 states and 287452 transitions. [2025-04-26 18:44:16,132 INFO L131 ngComponentsAnalysis]: Automaton has 2626 accepting balls. 11425 [2025-04-26 18:44:16,132 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:16,132 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:16,133 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:44:16,133 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:44:16,134 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 18:44:16,134 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 18:44:16,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:16,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1299264210, now seen corresponding path program 1 times [2025-04-26 18:44:16,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:16,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729248596] [2025-04-26 18:44:16,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:16,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:16,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:16,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:16,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:16,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:16,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:16,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:16,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:16,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:16,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:16,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:16,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:16,149 INFO L85 PathProgramCache]: Analyzing trace with hash 180793, now seen corresponding path program 1 times [2025-04-26 18:44:16,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:16,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775219958] [2025-04-26 18:44:16,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:16,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:16,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:16,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:16,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:16,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:16,152 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:16,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:16,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:16,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:16,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:16,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:16,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:16,154 INFO L85 PathProgramCache]: Analyzing trace with hash 134959560, now seen corresponding path program 1 times [2025-04-26 18:44:16,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:16,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221301494] [2025-04-26 18:44:16,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:16,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:16,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:44:16,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:44:16,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:16,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:16,158 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:16,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:44:16,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:44:16,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:16,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:16,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:16,196 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:16,197 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:16,197 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:16,197 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:16,197 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:16,197 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:16,197 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:16,197 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:16,197 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:16,197 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:16,197 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:16,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:16,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:16,219 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:16,219 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:16,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:16,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:16,222 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 18:44:16,223 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 18:44:16,225 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:16,225 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:16,241 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 18:44:16,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:16,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:16,243 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 18:44:16,245 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 18:44:16,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:16,246 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:16,310 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:16,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:16,315 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:16,315 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:16,315 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:16,315 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:16,315 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:16,315 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:16,315 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:16,315 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:16,315 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:16,315 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:16,315 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:16,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:16,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:16,339 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:16,340 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:16,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:16,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:16,342 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 18:44:16,342 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 18:44:16,343 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 18:44:16,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:16,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:16,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:16,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:16,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:16,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:16,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:16,356 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:16,359 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:16,359 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:16,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:16,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:16,361 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 18:44:16,362 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 18:44:16,363 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:16,366 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:44:16,367 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 18:44:16,367 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:16,367 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:16,367 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, z) = -1*x5 + 1*z Supporting invariants [] [2025-04-26 18:44:16,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 18:44:16,384 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:16,407 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:16,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:16,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:16,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:16,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:16,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:16,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:16,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:16,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:16,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:16,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:16,428 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:16,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:16,449 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 18:44:16,450 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 18:44:16,450 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 18:44:18,787 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 18:44:18,787 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 18:44:18,788 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 18:44:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-04-26 18:44:18,788 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 135 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:44:18,788 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:18,788 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 135 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 18:44:18,788 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:18,788 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 135 transitions. Stem has 6 letters. Loop has 6 letters. [2025-04-26 18:44:18,788 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:18,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 308173 states and 760717 transitions. [2025-04-26 18:44:22,519 INFO L131 ngComponentsAnalysis]: Automaton has 4131 accepting balls. 16220 [2025-04-26 18:44:24,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 308173 states to 238112 states and 604580 transitions. [2025-04-26 18:44:24,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49691 [2025-04-26 18:44:24,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52849 [2025-04-26 18:44:24,700 INFO L74 IsDeterministic]: Start isDeterministic. Operand 238112 states and 604580 transitions. [2025-04-26 18:44:24,700 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:24,700 INFO L218 hiAutomatonCegarLoop]: Abstraction has 238112 states and 604580 transitions. [2025-04-26 18:44:24,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238112 states and 604580 transitions. [2025-04-26 18:44:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238112 to 194645. [2025-04-26 18:44:28,569 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 18:44:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194645 states to 194645 states and 512702 transitions. [2025-04-26 18:44:29,607 INFO L240 hiAutomatonCegarLoop]: Abstraction has 194645 states and 512702 transitions. [2025-04-26 18:44:29,607 INFO L438 stractBuchiCegarLoop]: Abstraction has 194645 states and 512702 transitions. [2025-04-26 18:44:29,608 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:44:29,608 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194645 states and 512702 transitions. [2025-04-26 18:44:30,785 INFO L131 ngComponentsAnalysis]: Automaton has 3265 accepting balls. 13312 [2025-04-26 18:44:30,786 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:30,786 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:30,789 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:30,789 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:44:30,789 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 18:44:30,789 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 18:44:30,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:30,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1587821921, now seen corresponding path program 1 times [2025-04-26 18:44:30,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:30,790 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46826283] [2025-04-26 18:44:30,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:30,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:30,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:44:30,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:44:30,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:30,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:44:30,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:44:30,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46826283] [2025-04-26 18:44:30,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46826283] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:44:30,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:44:30,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:44:30,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935162929] [2025-04-26 18:44:30,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:44:30,826 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:44:30,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:30,826 INFO L85 PathProgramCache]: Analyzing trace with hash 159940, now seen corresponding path program 2 times [2025-04-26 18:44:30,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:30,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37825898] [2025-04-26 18:44:30,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:44:30,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:30,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:30,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:30,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:44:30,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:30,829 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:30,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:30,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:30,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:30,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:30,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:30,852 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:30,853 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:30,853 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:30,853 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:30,853 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:30,853 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:30,853 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:30,853 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:30,853 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:44:30,853 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:30,853 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:30,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:30,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:30,876 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:30,876 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:30,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:30,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:30,879 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 18:44:30,881 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 18:44:30,884 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:30,884 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:30,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 18:44:30,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:30,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:30,901 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 18:44:30,902 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 18:44:30,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:30,903 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:30,963 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:30,967 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 18:44:30,967 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:30,967 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:30,967 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:30,967 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:30,967 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:30,967 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:30,967 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:30,967 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:30,967 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock5.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:44:30,967 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:30,967 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:30,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:30,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:30,986 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:30,986 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:30,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:30,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:30,988 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 18:44:30,989 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 18:44:30,990 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 18:44:30,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:30,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:30,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:30,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:30,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:31,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:31,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:31,001 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:31,003 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:31,003 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:31,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:31,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:31,005 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 18:44:31,006 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 18:44:31,006 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:31,009 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 18:44:31,009 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:31,009 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:31,009 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 18:44:31,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 18:44:31,016 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:31,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:31,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:44:31,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:44:31,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:31,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:31,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:31,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:31,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:31,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:31,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:31,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:31,059 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:31,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:31,081 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 18:44:31,081 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 18:44:31,081 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 18:44:37,052 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 18:44:37,053 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 18:44:37,053 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 18:44:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2025-04-26 18:44:37,053 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 149 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 18:44:37,054 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:37,054 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 149 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 18:44:37,054 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:37,054 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 149 transitions. Stem has 7 letters. Loop has 6 letters. [2025-04-26 18:44:37,054 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:37,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 744377 states and 1908702 transitions. [2025-04-26 18:44:45,813 INFO L131 ngComponentsAnalysis]: Automaton has 5565 accepting balls. 21379 [2025-04-26 18:44:51,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 744377 states to 597665 states and 1523553 transitions. [2025-04-26 18:44:51,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99046 [2025-04-26 18:44:51,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108021 [2025-04-26 18:44:51,300 INFO L74 IsDeterministic]: Start isDeterministic. Operand 597665 states and 1523553 transitions. [2025-04-26 18:44:51,300 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:51,300 INFO L218 hiAutomatonCegarLoop]: Abstraction has 597665 states and 1523553 transitions. [2025-04-26 18:44:51,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597665 states and 1523553 transitions. [2025-04-26 18:44:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597665 to 336242. [2025-04-26 18:44:58,459 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 18:45:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336242 states to 336242 states and 928751 transitions. [2025-04-26 18:45:00,136 INFO L240 hiAutomatonCegarLoop]: Abstraction has 336242 states and 928751 transitions. [2025-04-26 18:45:00,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:45:00,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:45:00,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:45:00,139 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 18:45:00,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:45:00,180 INFO L93 Difference]: Finished difference Result 1444 states and 2258 transitions. [2025-04-26 18:45:00,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1444 states and 2258 transitions. [2025-04-26 18:45:00,183 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:45:00,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1444 states to 0 states and 0 transitions. [2025-04-26 18:45:00,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:45:00,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:45:00,183 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:45:00,183 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:45:00,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:45:00,183 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:45:00,183 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:45:00,183 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:45:00,184 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:45:00,184 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:45:00,184 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:45:00,184 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:45:00,192 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 18:45:00,193 INFO L201 PluginConnector]: Adding new model lock5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:45:00 BoogieIcfgContainer [2025-04-26 18:45:00,193 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:45:00,194 INFO L158 Benchmark]: Toolchain (without parser) took 66461.44ms. Allocated memory was 155.2MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 85.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 6.2GB. Max. memory is 8.0GB. [2025-04-26 18:45:00,194 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.87ms. Allocated memory is still 155.2MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:45:00,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.38ms. Allocated memory is still 155.2MB. Free memory was 85.2MB in the beginning and 83.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:45:00,194 INFO L158 Benchmark]: Boogie Preprocessor took 27.18ms. Allocated memory is still 155.2MB. Free memory was 83.2MB in the beginning and 82.3MB in the end (delta: 938.2kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:45:00,194 INFO L158 Benchmark]: RCFGBuilder took 174.89ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 71.5MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:45:00,195 INFO L158 Benchmark]: BuchiAutomizer took 66214.99ms. Allocated memory was 155.2MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 71.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 6.2GB. Max. memory is 8.0GB. [2025-04-26 18:45:00,195 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.87ms. Allocated memory is still 155.2MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.38ms. Allocated memory is still 155.2MB. Free memory was 85.2MB in the beginning and 83.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.18ms. Allocated memory is still 155.2MB. Free memory was 83.2MB in the beginning and 82.3MB in the end (delta: 938.2kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 174.89ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 71.5MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 66214.99ms. Allocated memory was 155.2MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 71.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). 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 66.1s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.5s. Büchi inclusion checks took 11.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 19.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 362934 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 26.3s 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.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 635 mSDsluCounter, 678 SdHoareTripleChecker+Invalid, 0.5s 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: 27ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 3 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s InitialAbstractionConstructionTime: 2.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 2259, 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 18:45:00,207 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...