/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/indep_loops_minus1_5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:43:32,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:43:32,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:43:32,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:43:32,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:43:32,062 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:32,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:43:32,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:43:32,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:43:32,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:43:32,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:43:32,086 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:43:32,086 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:43:32,086 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:43:32,086 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:43:32,086 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:43:32,086 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:43:32,086 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:43:32,086 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:43:32,086 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:43:32,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:43:32,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:43:32,086 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:43:32,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:43:32,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:43:32,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:43:32,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:43:32,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:43:32,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:43:32,087 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:43:32,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:43:32,087 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:43:32,087 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:43:32,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:43:32,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:43:32,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:43:32,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:43:32,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:43:32,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:43:32,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:43:32,088 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:43:32,088 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:43:32,088 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:43:32,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:43:32,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:43:32,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:43:32,331 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:43:32,333 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:43:32,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_5.c.bpl [2025-04-26 18:43:32,335 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_5.c.bpl' [2025-04-26 18:43:32,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:43:32,350 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:43:32,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:43:32,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:43:32,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:43:32,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:32" (1/1) ... [2025-04-26 18:43:32,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:32" (1/1) ... [2025-04-26 18:43:32,379 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:43:32,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:43:32,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:43:32,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:43:32,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:43:32,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:32" (1/1) ... [2025-04-26 18:43:32,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:32" (1/1) ... [2025-04-26 18:43:32,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:32" (1/1) ... [2025-04-26 18:43:32,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:32" (1/1) ... [2025-04-26 18:43:32,391 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:32" (1/1) ... [2025-04-26 18:43:32,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:32" (1/1) ... [2025-04-26 18:43:32,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:32" (1/1) ... [2025-04-26 18:43:32,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:32" (1/1) ... [2025-04-26 18:43:32,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:32" (1/1) ... [2025-04-26 18:43:32,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:43:32,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:43:32,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:43:32,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:43:32,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:32" (1/1) ... [2025-04-26 18:43:32,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:43:32,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:32,437 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:32,441 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:32,463 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:43:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:43:32,464 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:43:32,464 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:43:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:43:32,464 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:43:32,464 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:43:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:43:32,464 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:43:32,464 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:43:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:43:32,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:43:32,464 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:43:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:43:32,464 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:43:32,464 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 18:43:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 18:43:32,464 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 18:43:32,465 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:32,502 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:43:32,504 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:43:32,589 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:43:32,589 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:43:32,599 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:43:32,599 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:43:32,601 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:43:32 BoogieIcfgContainer [2025-04-26 18:43:32,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:43:32,602 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:43:32,602 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:43:32,606 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:43:32,607 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:43:32,607 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:32" (1/2) ... [2025-04-26 18:43:32,608 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b0de537 and model type indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:43:32, skipping insertion in model container [2025-04-26 18:43:32,608 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:43:32,608 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:43:32" (2/2) ... [2025-04-26 18:43:32,609 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_minus1_5.c.bpl [2025-04-26 18:43:32,670 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 18:43:32,707 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:43:32,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:43:32,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:32,710 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:32,711 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:32,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 42 transitions, 119 flow [2025-04-26 18:43:32,777 INFO L116 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-04-26 18:43:32,780 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 18:43:32,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 32 events. 5/32 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-04-26 18:43:32,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 42 transitions, 119 flow [2025-04-26 18:43:32,788 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 32 transitions, 94 flow [2025-04-26 18:43:32,788 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 43 places, 32 transitions, 94 flow [2025-04-26 18:43:32,789 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 32 transitions, 94 flow [2025-04-26 18:43:32,930 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2111 states, 2110 states have (on average 4.882938388625592) internal successors, (in total 10303), 2110 states have internal predecessors, (10303), 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:32,936 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 2111 states, 2110 states have (on average 4.882938388625592) internal successors, (in total 10303), 2110 states have internal predecessors, (10303), 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:32,938 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:43:33,275 WARN L140 AmpleReduction]: Number of pruned transitions: 3824 [2025-04-26 18:43:33,276 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:43:33,276 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 939 [2025-04-26 18:43:33,276 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:28 [2025-04-26 18:43:33,276 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:1127 [2025-04-26 18:43:33,276 WARN L145 AmpleReduction]: Times succ was already a loop node:1721 [2025-04-26 18:43:33,276 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:331 [2025-04-26 18:43:33,276 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:43:33,282 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 2095 states, 2094 states have (on average 3.0659025787965617) internal successors, (in total 6420), 2094 states have internal predecessors, (6420), 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:33,289 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:43:33,289 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:43:33,289 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:43:33,289 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:43:33,289 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:43:33,289 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:43:33,289 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:43:33,289 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:43:33,295 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2095 states, 2094 states have (on average 3.0659025787965617) internal successors, (in total 6420), 2094 states have internal predecessors, (6420), 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:33,353 INFO L131 ngComponentsAnalysis]: Automaton has 377 accepting balls. 1931 [2025-04-26 18:43:33,354 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:33,354 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:33,357 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:43:33,357 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:33,357 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:43:33,361 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2095 states, 2094 states have (on average 3.0659025787965617) internal successors, (in total 6420), 2094 states have internal predecessors, (6420), 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:33,393 INFO L131 ngComponentsAnalysis]: Automaton has 377 accepting balls. 1931 [2025-04-26 18:43:33,393 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:33,393 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:33,394 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:43:33,394 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:33,398 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:43:33,399 INFO L754 eck$LassoCheckResult]: Loop: "[80] L27-->L29: 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[]" "[82] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:43:33,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:33,402 INFO L85 PathProgramCache]: Analyzing trace with hash 133, now seen corresponding path program 1 times [2025-04-26 18:43:33,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:33,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253633663] [2025-04-26 18:43:33,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:33,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:33,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:43:33,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:43:33,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:33,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:43:33,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:43:33,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:33,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:33,468 INFO L85 PathProgramCache]: Analyzing trace with hash 3523, now seen corresponding path program 1 times [2025-04-26 18:43:33,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:33,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483955275] [2025-04-26 18:43:33,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:33,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:33,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:33,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:33,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,475 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:33,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:33,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:33,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:33,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:33,483 INFO L85 PathProgramCache]: Analyzing trace with hash 130375, now seen corresponding path program 1 times [2025-04-26 18:43:33,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:33,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614018269] [2025-04-26 18:43:33,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:33,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:33,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:33,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:33,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:33,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:33,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:33,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:33,562 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:33,563 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:33,563 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:33,564 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:33,564 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:33,564 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,564 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:33,564 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:33,564 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:43:33,564 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:33,564 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:33,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:33,635 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:33,636 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:33,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:33,643 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:33,660 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:33,663 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:33,664 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:33,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:43:33,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:33,689 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:33,691 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:33,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:33,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:33,763 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:33,768 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:33,768 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:33,768 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:33,768 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:33,768 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:33,768 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:33,768 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,768 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:33,768 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:33,768 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:43:33,768 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:33,768 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:33,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:33,791 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:33,794 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:33,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:33,799 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:33,801 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:33,802 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:33,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:33,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:33,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:33,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:33,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:33,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:33,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:33,820 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:33,825 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:43:33,825 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:43:33,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:33,828 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:33,830 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:33,831 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:33,834 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:33,834 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:33,835 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:33,835 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 18:43:33,841 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:33,844 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:33,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:33,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:43:33,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:43:33,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:33,875 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:33,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:33,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:33,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:33,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:33,888 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:33,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:33,913 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:33,929 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:43:33,934 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 2095 states, 2094 states have (on average 3.0659025787965617) internal successors, (in total 6420), 2094 states have internal predecessors, (6420), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:34,167 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 2095 states, 2094 states have (on average 3.0659025787965617) internal successors, (in total 6420), 2094 states have internal predecessors, (6420), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 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 5507 states and 17702 transitions. Complement of second has 6 states. [2025-04-26 18:43:34,170 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:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:34,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-04-26 18:43:34,181 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 18:43:34,182 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:34,182 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:43:34,182 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:34,182 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 18:43:34,182 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:34,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5507 states and 17702 transitions. [2025-04-26 18:43:34,249 INFO L131 ngComponentsAnalysis]: Automaton has 288 accepting balls. 1153 [2025-04-26 18:43:34,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5507 states to 3410 states and 10708 transitions. [2025-04-26 18:43:34,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1503 [2025-04-26 18:43:34,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2286 [2025-04-26 18:43:34,310 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3410 states and 10708 transitions. [2025-04-26 18:43:34,311 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:34,311 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3410 states and 10708 transitions. [2025-04-26 18:43:34,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states and 10708 transitions. [2025-04-26 18:43:34,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 2692. [2025-04-26 18:43:34,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 2692 states have (on average 3.2429420505200595) internal successors, (in total 8730), 2691 states have internal predecessors, (8730), 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:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 8730 transitions. [2025-04-26 18:43:34,485 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2692 states and 8730 transitions. [2025-04-26 18:43:34,485 INFO L438 stractBuchiCegarLoop]: Abstraction has 2692 states and 8730 transitions. [2025-04-26 18:43:34,486 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:43:34,486 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2692 states and 8730 transitions. [2025-04-26 18:43:34,499 INFO L131 ngComponentsAnalysis]: Automaton has 288 accepting balls. 1153 [2025-04-26 18:43:34,499 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:34,499 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:34,499 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:43:34,499 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:34,500 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[79] L27-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[81] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[105] L12-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:43:34,500 INFO L754 eck$LassoCheckResult]: Loop: "[84] L36-->L38: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[86] L38-->L36: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:43:34,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:34,500 INFO L85 PathProgramCache]: Analyzing trace with hash 4040738, now seen corresponding path program 1 times [2025-04-26 18:43:34,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:34,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661477429] [2025-04-26 18:43:34,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:34,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:34,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:34,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:34,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:34,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:34,506 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:34,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:34,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:34,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:34,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:34,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:34,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:34,511 INFO L85 PathProgramCache]: Analyzing trace with hash 3651, now seen corresponding path program 1 times [2025-04-26 18:43:34,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:34,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468388298] [2025-04-26 18:43:34,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:34,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:34,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:34,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:34,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:34,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:34,515 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:34,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:34,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:34,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:34,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:34,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:34,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:34,518 INFO L85 PathProgramCache]: Analyzing trace with hash -411815388, now seen corresponding path program 1 times [2025-04-26 18:43:34,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:34,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731869404] [2025-04-26 18:43:34,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:34,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:34,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:43:34,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:43:34,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:34,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:34,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:34,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:43:34,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:43:34,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:34,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:34,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:34,544 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:34,544 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:34,544 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:34,544 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:34,544 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:34,544 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:34,545 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:34,545 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:34,545 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:43:34,545 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:34,545 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:34,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:34,567 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:34,567 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:34,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:34,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:34,569 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:34,570 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:34,571 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:34,571 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:34,587 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:34,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:34,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:34,589 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:34,589 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:34,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:34,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:34,656 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:34,661 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:34,661 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:34,661 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:34,661 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:34,661 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:34,661 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:34,661 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:34,661 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:34,661 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:34,661 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:43:34,661 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:34,661 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:34,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:34,682 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:34,682 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:34,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:34,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:34,685 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:34,686 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:34,687 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:34,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:34,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:34,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:34,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:34,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:34,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:34,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:34,703 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:34,707 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:43:34,707 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:43:34,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:34,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:34,709 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:34,711 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:34,712 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:34,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:43:34,715 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:34,715 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:34,715 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 18:43:34,722 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:34,723 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:34,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:34,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:34,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:34,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:34,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:34,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:34,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:34,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:34,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:34,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:34,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:34,754 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:34,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:34,767 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:34,768 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:43:34,768 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2692 states and 8730 transitions. cyclomatic complexity: 6431 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:34,908 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2692 states and 8730 transitions. cyclomatic complexity: 6431. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 7393 states and 23645 transitions. Complement of second has 6 states. [2025-04-26 18:43:34,909 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:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-04-26 18:43:34,910 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:43:34,910 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:34,910 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:43:34,911 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:34,911 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:43:34,911 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:34,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7393 states and 23645 transitions. [2025-04-26 18:43:35,012 INFO L131 ngComponentsAnalysis]: Automaton has 205 accepting balls. 621 [2025-04-26 18:43:35,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7393 states to 4723 states and 14830 transitions. [2025-04-26 18:43:35,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1633 [2025-04-26 18:43:35,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2216 [2025-04-26 18:43:35,066 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4723 states and 14830 transitions. [2025-04-26 18:43:35,066 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:35,066 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4723 states and 14830 transitions. [2025-04-26 18:43:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4723 states and 14830 transitions. [2025-04-26 18:43:35,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4723 to 4137. [2025-04-26 18:43:35,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4137 states, 4137 states have (on average 3.2168237853517043) internal successors, (in total 13308), 4136 states have internal predecessors, (13308), 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:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 13308 transitions. [2025-04-26 18:43:35,203 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4137 states and 13308 transitions. [2025-04-26 18:43:35,203 INFO L438 stractBuchiCegarLoop]: Abstraction has 4137 states and 13308 transitions. [2025-04-26 18:43:35,203 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:43:35,203 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4137 states and 13308 transitions. [2025-04-26 18:43:35,225 INFO L131 ngComponentsAnalysis]: Automaton has 205 accepting balls. 621 [2025-04-26 18:43:35,225 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:35,225 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:35,226 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:43:35,226 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:35,226 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[80] L27-->L29: 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[]" "[105] L12-->L36: 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]" "[82] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[108] L13-->L45: 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]" "[79] L27-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[83] L36-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" [2025-04-26 18:43:35,226 INFO L754 eck$LassoCheckResult]: Loop: "[88] L45-->L47: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[90] L47-->L45: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 18:43:35,226 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:35,227 INFO L85 PathProgramCache]: Analyzing trace with hash 168756252, now seen corresponding path program 1 times [2025-04-26 18:43:35,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:35,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192555086] [2025-04-26 18:43:35,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:35,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:35,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:43:35,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:43:35,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,231 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:35,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:43:35,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:43:35,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:35,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:35,237 INFO L85 PathProgramCache]: Analyzing trace with hash 3779, now seen corresponding path program 1 times [2025-04-26 18:43:35,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:35,237 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729727315] [2025-04-26 18:43:35,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:35,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:35,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:35,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:35,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,241 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:35,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:35,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:35,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:35,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1033996258, now seen corresponding path program 1 times [2025-04-26 18:43:35,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:35,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662785811] [2025-04-26 18:43:35,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:35,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:35,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:43:35,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:43:35,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,257 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:35,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:43:35,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:43:35,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:35,278 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:35,278 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:35,278 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:35,278 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:35,279 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:35,279 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:35,279 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:35,279 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:35,279 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:43:35,279 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:35,279 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:35,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:35,298 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:35,299 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:35,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:35,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:35,301 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:35,302 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:35,304 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:35,304 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:35,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:43:35,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:35,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:35,327 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:35,328 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:35,331 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:35,331 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:35,397 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:35,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:35,402 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:35,402 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:35,402 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:35,402 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:35,402 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:35,402 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:35,402 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:35,402 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:35,402 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:43:35,403 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:35,403 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:35,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:35,419 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:35,419 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:35,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:35,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:35,421 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:35,423 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:35,424 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:35,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:35,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:35,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:35,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:35,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:35,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:35,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:35,438 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:35,440 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:43:35,440 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:43:35,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:35,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:35,442 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:43:35,444 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:43:35,445 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:35,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:43:35,448 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:35,448 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:35,448 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 18:43:35,454 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:35,455 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:35,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:35,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:43:35,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:43:35,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:35,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:35,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:35,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:35,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:35,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:35,486 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:35,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:35,501 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:35,501 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:43:35,501 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4137 states and 13308 transitions. cyclomatic complexity: 9606 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 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:43:35,618 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4137 states and 13308 transitions. cyclomatic complexity: 9606. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 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 7877 states and 24412 transitions. Complement of second has 6 states. [2025-04-26 18:43:35,619 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:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 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:43:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-04-26 18:43:35,620 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:43:35,620 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:35,620 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:43:35,620 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:35,620 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:43:35,620 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:35,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7877 states and 24412 transitions. [2025-04-26 18:43:35,681 INFO L131 ngComponentsAnalysis]: Automaton has 151 accepting balls. 343 [2025-04-26 18:43:35,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7877 states to 6079 states and 18608 transitions. [2025-04-26 18:43:35,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2089 [2025-04-26 18:43:35,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2568 [2025-04-26 18:43:35,740 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6079 states and 18608 transitions. [2025-04-26 18:43:35,740 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:35,740 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6079 states and 18608 transitions. [2025-04-26 18:43:35,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6079 states and 18608 transitions. [2025-04-26 18:43:35,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6079 to 5413. [2025-04-26 18:43:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5413 states, 5413 states have (on average 3.192869019028265) internal successors, (in total 17283), 5412 states have internal predecessors, (17283), 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:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5413 states to 5413 states and 17283 transitions. [2025-04-26 18:43:35,919 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5413 states and 17283 transitions. [2025-04-26 18:43:35,919 INFO L438 stractBuchiCegarLoop]: Abstraction has 5413 states and 17283 transitions. [2025-04-26 18:43:35,919 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:43:35,919 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5413 states and 17283 transitions. [2025-04-26 18:43:35,939 INFO L131 ngComponentsAnalysis]: Automaton has 149 accepting balls. 339 [2025-04-26 18:43:35,939 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:35,940 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:35,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-04-26 18:43:35,940 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:35,940 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[80] L27-->L29: 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[]" "[105] L12-->L36: 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]" "[82] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[108] L13-->L45: 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]" "[80] L27-->L29: 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[]" "[111] L14-->L54: 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]" "[82] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[114] L15-->L64: 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]" [2025-04-26 18:43:35,940 INFO L754 eck$LassoCheckResult]: Loop: "[97] L64-->L66: 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[]" "[99] L66-->L64: Formula: (= (+ v_x5_5 1) v_x5_4) InVars {x5=v_x5_5} OutVars{x5=v_x5_4} AuxVars[] AssignedVars[x5]" [2025-04-26 18:43:35,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:35,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1033939721, now seen corresponding path program 1 times [2025-04-26 18:43:35,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:35,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76465139] [2025-04-26 18:43:35,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:35,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:35,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:43:35,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:43:35,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,946 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:35,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:43:35,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:43:35,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:35,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:35,951 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 18:43:35,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:35,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754402889] [2025-04-26 18:43:35,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:35,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:35,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:35,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:35,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,954 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:35,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:35,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:35,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:35,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:35,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1478623399, now seen corresponding path program 1 times [2025-04-26 18:43:35,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:35,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019422059] [2025-04-26 18:43:35,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:35,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:35,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:43:35,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:43:35,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,966 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:35,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:43:35,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:43:35,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:36,000 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:36,000 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:36,000 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:36,000 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:36,000 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:36,000 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:36,000 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:36,000 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:36,001 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:43:36,001 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:36,001 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:36,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:36,019 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:36,019 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:36,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:36,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:36,021 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:43:36,023 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:43:36,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:36,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:36,042 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:43:36,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:36,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:36,044 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:43:36,045 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:43:36,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:36,047 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:36,116 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:36,121 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:43:36,121 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:36,121 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:36,121 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:36,121 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:36,121 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:36,121 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:36,121 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:36,121 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:36,121 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:43:36,121 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:36,121 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:36,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:36,138 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:36,138 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:36,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:36,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:36,140 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:43:36,141 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:43:36,143 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:36,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:36,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:36,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:36,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:36,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:36,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:36,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:36,156 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:36,160 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:43:36,160 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:43:36,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:36,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:36,162 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:43:36,164 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:43:36,165 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:36,167 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:43:36,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:36,169 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:36,169 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:36,169 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 18:43:36,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:36,175 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:36,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:36,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:43:36,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:43:36,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:36,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:36,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:36,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:36,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:36,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:36,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:36,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:36,219 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:36,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:36,233 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:36,233 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:43:36,234 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5413 states and 17283 transitions. cyclomatic complexity: 12347 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 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:43:36,513 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5413 states and 17283 transitions. cyclomatic complexity: 12347. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 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 16346 states and 53664 transitions. Complement of second has 6 states. [2025-04-26 18:43:36,518 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:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 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:43:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-04-26 18:43:36,519 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:43:36,519 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:36,519 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:43:36,519 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:36,519 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:43:36,519 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:36,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16346 states and 53664 transitions. [2025-04-26 18:43:36,690 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 117 [2025-04-26 18:43:36,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16346 states to 7993 states and 26199 transitions. [2025-04-26 18:43:36,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2115 [2025-04-26 18:43:36,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2315 [2025-04-26 18:43:36,749 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7993 states and 26199 transitions. [2025-04-26 18:43:36,749 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:36,749 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7993 states and 26199 transitions. [2025-04-26 18:43:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7993 states and 26199 transitions. [2025-04-26 18:43:36,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7993 to 7475. [2025-04-26 18:43:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7475 states, 7475 states have (on average 3.297926421404682) internal successors, (in total 24652), 7474 states have internal predecessors, (24652), 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:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7475 states to 7475 states and 24652 transitions. [2025-04-26 18:43:36,956 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7475 states and 24652 transitions. [2025-04-26 18:43:36,956 INFO L438 stractBuchiCegarLoop]: Abstraction has 7475 states and 24652 transitions. [2025-04-26 18:43:36,956 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:43:36,956 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7475 states and 24652 transitions. [2025-04-26 18:43:36,992 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 117 [2025-04-26 18:43:36,993 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:36,993 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:36,993 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:43:36,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:43:36,994 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[80] L27-->L29: 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[]" "[105] L12-->L36: 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]" "[82] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[108] L13-->L45: 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]" "[79] L27-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[111] L14-->L54: 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]" "[83] L36-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[87] L45-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" [2025-04-26 18:43:36,994 INFO L754 eck$LassoCheckResult]: Loop: "[92] L54-->L56: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[94] L56-->L57: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" "[95] L57-->L54: Formula: (= v_x5_1 (+ v_x5_2 1)) InVars {x5=v_x5_2} OutVars{x5=v_x5_1} AuxVars[] AssignedVars[x5]" [2025-04-26 18:43:36,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:36,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1033969508, now seen corresponding path program 1 times [2025-04-26 18:43:36,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:36,994 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856738926] [2025-04-26 18:43:36,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:36,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:36,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:43:37,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:43:37,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:37,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:37,000 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:37,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:43:37,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:43:37,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:37,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:37,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:37,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:37,004 INFO L85 PathProgramCache]: Analyzing trace with hash 121212, now seen corresponding path program 1 times [2025-04-26 18:43:37,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:37,005 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483128463] [2025-04-26 18:43:37,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:37,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:37,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:37,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:37,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:37,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:37,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:37,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:37,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:37,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:37,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:37,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:37,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:37,010 INFO L85 PathProgramCache]: Analyzing trace with hash 519925505, now seen corresponding path program 1 times [2025-04-26 18:43:37,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:37,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388814750] [2025-04-26 18:43:37,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:37,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:37,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:43:37,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:43:37,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:37,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:37,015 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:37,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:43:37,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:43:37,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:37,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:37,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:37,037 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:37,037 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:37,037 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:37,037 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:37,037 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:37,037 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:37,037 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:37,037 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:37,037 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:43:37,037 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:37,037 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:37,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:37,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:37,066 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:37,067 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:37,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:37,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:37,069 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:43:37,071 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:43:37,072 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:37,072 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:37,088 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:43:37,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:37,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:37,090 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:43:37,091 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:43:37,094 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:37,094 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:37,163 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:37,168 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:43:37,169 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:37,169 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:37,169 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:37,169 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:37,169 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:37,169 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:37,169 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:37,169 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:37,169 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:43:37,169 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:37,169 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:37,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:37,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:37,196 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:37,196 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:37,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:37,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:37,198 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:43:37,199 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:43:37,200 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:37,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:37,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:37,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:37,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:37,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:37,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:37,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:37,213 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:37,215 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:43:37,215 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:43:37,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:37,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:37,218 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:43:37,218 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:43:37,219 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:37,222 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:43:37,223 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:43:37,223 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:37,223 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:37,223 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 18:43:37,228 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:43:37,229 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:37,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:37,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:43:37,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:43:37,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:37,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:37,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:37,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:37,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:37,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:37,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:37,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:37,264 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:37,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:37,307 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:37,307 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:37,308 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7475 states and 24652 transitions. cyclomatic complexity: 17544 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 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:37,469 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7475 states and 24652 transitions. cyclomatic complexity: 17544. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 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 14217 states and 43779 transitions. Complement of second has 6 states. [2025-04-26 18:43:37,469 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:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 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:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-04-26 18:43:37,470 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 18:43:37,470 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:37,470 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 12 letters. Loop has 3 letters. [2025-04-26 18:43:37,470 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:37,470 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 9 letters. Loop has 6 letters. [2025-04-26 18:43:37,470 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:37,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14217 states and 43779 transitions. [2025-04-26 18:43:37,575 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:43:37,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14217 states to 0 states and 0 transitions. [2025-04-26 18:43:37,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:43:37,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:43:37,576 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:43:37,576 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:43:37,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:43:37,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:43:37,576 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:43:37,576 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:43:37,576 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:43:37,576 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:43:37,576 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:43:37,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:43:37,587 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:43:37 BoogieIcfgContainer [2025-04-26 18:43:37,587 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:43:37,588 INFO L158 Benchmark]: Toolchain (without parser) took 5237.88ms. Allocated memory was 159.4MB in the beginning and 893.4MB in the end (delta: 734.0MB). Free memory was 86.3MB in the beginning and 512.3MB in the end (delta: -426.0MB). Peak memory consumption was 308.8MB. Max. memory is 8.0GB. [2025-04-26 18:43:37,588 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.79ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:43:37,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.08ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 83.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:43:37,589 INFO L158 Benchmark]: Boogie Preprocessor took 27.54ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 82.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:43:37,589 INFO L158 Benchmark]: RCFGBuilder took 190.26ms. Allocated memory is still 159.4MB. Free memory was 82.4MB in the beginning and 73.3MB in the end (delta: 9.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:43:37,589 INFO L158 Benchmark]: BuchiAutomizer took 4985.91ms. Allocated memory was 159.4MB in the beginning and 893.4MB in the end (delta: 734.0MB). Free memory was 73.1MB in the beginning and 512.3MB in the end (delta: -439.1MB). Peak memory consumption was 296.2MB. Max. memory is 8.0GB. [2025-04-26 18:43:37,590 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.79ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.08ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 83.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.54ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 82.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 190.26ms. Allocated memory is still 159.4MB. Free memory was 82.4MB in the beginning and 73.3MB in the end (delta: 9.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 4985.91ms. Allocated memory was 159.4MB in the beginning and 893.4MB in the end (delta: 734.0MB). Free memory was 73.1MB in the beginning and 512.3MB in the end (delta: -439.1MB). Peak memory consumption was 296.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.3s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.7s AutomataMinimizationTime, 4 MinimizatonAttempts, 2488 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.7s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 297 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 280 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 360 IncrementalHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 146 mSDtfsCounter, 360 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp94 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 37ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 575, Number of transitions in reduction automaton: 6420, Number of states in reduction automaton: 2095, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (0 trivial, 5 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 * x5 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:43:37,600 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...