/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -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 16:25:12,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:25:12,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:25:12,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:25:12,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:25:12,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:25:12,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:25:12,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:25:12,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:25:12,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:25:12,362 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:25:12,362 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:25:12,362 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:25:12,363 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:25:12,363 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:25:12,363 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:25:12,363 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:25:12,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:25:12,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:25:12,363 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:25:12,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:25:12,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:25:12,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:25:12,363 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:25:12,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:25:12,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:25:12,364 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:25:12,364 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:25:12,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:25:12,364 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:25:12,364 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:25:12,364 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:25:12,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:25:12,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:25:12,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:25:12,365 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:25:12,365 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:25:12,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:25:12,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:25:12,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:25:12,587 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:25:12,587 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:25:12,588 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 16:25:12,588 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_5.c.bpl' [2025-04-26 16:25:12,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:25:12,603 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:25:12,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:25:12,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:25:12,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:25:12,613 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 04:25:12" (1/1) ... [2025-04-26 16:25:12,641 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 04:25:12" (1/1) ... [2025-04-26 16:25:12,645 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:25:12,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:25:12,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:25:12,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:25:12,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:25:12,653 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 04:25:12" (1/1) ... [2025-04-26 16:25:12,653 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 04:25:12" (1/1) ... [2025-04-26 16:25:12,655 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 04:25:12" (1/1) ... [2025-04-26 16:25:12,655 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 04:25:12" (1/1) ... [2025-04-26 16:25:12,658 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 04:25:12" (1/1) ... [2025-04-26 16:25:12,658 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 04:25:12" (1/1) ... [2025-04-26 16:25:12,661 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 04:25:12" (1/1) ... [2025-04-26 16:25:12,661 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 04:25:12" (1/1) ... [2025-04-26 16:25:12,662 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 04:25:12" (1/1) ... [2025-04-26 16:25:12,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:25:12,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:25:12,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:25:12,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:25:12,674 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 04:25:12" (1/1) ... [2025-04-26 16:25:12,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:12,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:12,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:12,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:25:12,722 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:25:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:25:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:25:12,723 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:25:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:25:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:25:12,723 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:25:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:25:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:25:12,723 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:25:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:25:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:25:12,723 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:25:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:25:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:25:12,724 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:25:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:25:12,724 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:25:12,724 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:25:12,761 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:25:12,763 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:25:12,832 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:25:12,832 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:25:12,839 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:25:12,839 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:25:12,840 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:25:12 BoogieIcfgContainer [2025-04-26 16:25:12,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:25:12,841 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:25:12,841 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:25:12,845 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:25:12,846 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:25:12,846 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 04:25:12" (1/2) ... [2025-04-26 16:25:12,847 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@be00e0b and model type indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:25:12, skipping insertion in model container [2025-04-26 16:25:12,847 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:25:12,847 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 04:25:12" (2/2) ... [2025-04-26 16:25:12,848 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_minus1_5.c.bpl [2025-04-26 16:25:12,910 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 16:25:12,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 42 transitions, 119 flow [2025-04-26 16:25:12,960 INFO L116 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-04-26 16:25:12,961 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 16:25:12,964 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 16:25:12,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 42 transitions, 119 flow [2025-04-26 16:25:12,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 32 transitions, 94 flow [2025-04-26 16:25:12,967 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 43 places, 32 transitions, 94 flow [2025-04-26 16:25:12,976 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:25:12,977 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:25:12,977 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:25:12,977 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:25:12,977 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:25:12,977 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:25:12,977 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:25:12,977 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:25:12,978 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:25:13,265 INFO L131 ngComponentsAnalysis]: Automaton has 391 accepting balls. 2016 [2025-04-26 16:25:13,266 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:13,267 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:13,270 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:25:13,270 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:13,271 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:25:13,271 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 2110 states, but on-demand construction may add more states [2025-04-26 16:25:13,315 INFO L131 ngComponentsAnalysis]: Automaton has 391 accepting balls. 2016 [2025-04-26 16:25:13,316 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:13,316 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:13,316 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:25:13,316 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:13,320 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 16:25:13,320 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 16:25:13,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:13,324 INFO L85 PathProgramCache]: Analyzing trace with hash 133, now seen corresponding path program 1 times [2025-04-26 16:25:13,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:13,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47728222] [2025-04-26 16:25:13,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:13,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:13,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:25:13,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:25:13,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,381 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:13,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:25:13,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:25:13,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:13,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:13,400 INFO L85 PathProgramCache]: Analyzing trace with hash 3523, now seen corresponding path program 1 times [2025-04-26 16:25:13,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:13,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349307429] [2025-04-26 16:25:13,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:13,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:13,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:13,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:13,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,409 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:13,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:13,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:13,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:13,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:13,417 INFO L85 PathProgramCache]: Analyzing trace with hash 130375, now seen corresponding path program 1 times [2025-04-26 16:25:13,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:13,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985537199] [2025-04-26 16:25:13,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:13,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:13,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:13,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:13,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,427 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:13,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:13,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:13,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:13,481 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:13,481 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:13,481 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:13,481 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:13,481 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:13,482 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,482 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:13,482 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:13,482 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:25:13,482 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:13,482 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:13,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:13,532 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:13,532 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:13,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:13,536 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:13,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:25:13,539 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:13,539 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:13,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:25:13,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:13,560 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:13,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:25:13,562 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:13,562 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:13,633 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:13,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:25:13,638 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:13,638 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:13,638 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:13,638 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:13,638 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:13,638 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,638 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:13,638 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:13,638 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:25:13,638 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:13,638 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:13,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:13,664 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:13,667 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:13,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:13,670 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:13,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:25:13,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:25:13,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:13,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:13,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:13,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:13,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:13,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:13,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:13,694 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:13,699 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:25:13,699 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:25:13,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:13,702 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:13,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:25:13,705 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:13,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:13,709 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:13,710 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:13,710 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 16:25:13,716 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 16:25:13,720 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:13,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:13,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:25:13,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:25:13,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:13,775 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:13,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:13,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:13,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:13,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:13,793 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:13,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:25:13,859 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:25:13,865 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 2110 states, but on-demand construction may add more states 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 16:25:14,116 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 2110 states, but on-demand construction may add more states. 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 5901 states and 31410 transitions. Complement of second has 6 states. [2025-04-26 16:25:14,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:25:14,122 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 16:25:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-04-26 16:25:14,128 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 16:25:14,129 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:14,129 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:25:14,129 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:14,129 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 16:25:14,129 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:14,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5901 states and 31410 transitions. [2025-04-26 16:25:14,276 INFO L131 ngComponentsAnalysis]: Automaton has 450 accepting balls. 1954 [2025-04-26 16:25:14,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5901 states to 4441 states and 23833 transitions. [2025-04-26 16:25:14,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2013 [2025-04-26 16:25:14,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3227 [2025-04-26 16:25:14,375 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4441 states and 23833 transitions. [2025-04-26 16:25:14,376 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:25:14,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4441 states and 23833 transitions. [2025-04-26 16:25:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4441 states and 23833 transitions. [2025-04-26 16:25:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4441 to 3229. [2025-04-26 16:25:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3229 states, 3229 states have (on average 5.526478786001858) internal successors, (in total 17845), 3228 states have internal predecessors, (17845), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 17845 transitions. [2025-04-26 16:25:14,613 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3229 states and 17845 transitions. [2025-04-26 16:25:14,613 INFO L438 stractBuchiCegarLoop]: Abstraction has 3229 states and 17845 transitions. [2025-04-26 16:25:14,613 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:25:14,614 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3229 states and 17845 transitions. [2025-04-26 16:25:14,641 INFO L131 ngComponentsAnalysis]: Automaton has 450 accepting balls. 1954 [2025-04-26 16:25:14,641 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:14,641 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:14,641 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:25:14,642 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:14,642 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]" "[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 16:25:14,642 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 16:25:14,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:14,643 INFO L85 PathProgramCache]: Analyzing trace with hash 4228, now seen corresponding path program 1 times [2025-04-26 16:25:14,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:14,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564885966] [2025-04-26 16:25:14,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:14,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:14,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:14,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:14,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,649 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:14,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:14,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:14,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:14,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:14,654 INFO L85 PathProgramCache]: Analyzing trace with hash 3651, now seen corresponding path program 1 times [2025-04-26 16:25:14,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:14,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301067350] [2025-04-26 16:25:14,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:14,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:14,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:14,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:14,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,661 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:14,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:14,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:14,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:14,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:14,666 INFO L85 PathProgramCache]: Analyzing trace with hash 4065798, now seen corresponding path program 1 times [2025-04-26 16:25:14,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:14,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371717057] [2025-04-26 16:25:14,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:14,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:14,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:14,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:14,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,673 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:14,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:14,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:14,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:14,699 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:14,700 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:14,700 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:14,700 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:14,700 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:14,700 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,700 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:14,700 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:14,700 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:25:14,700 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:14,700 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:14,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:14,718 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:14,718 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:14,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:14,722 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:14,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:25:14,724 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:14,724 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:14,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:25:14,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:14,744 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:14,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:25:14,746 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:14,746 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:14,810 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:14,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:14,815 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:14,815 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:14,815 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:14,815 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:14,815 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:14,815 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,815 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:14,815 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:14,815 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:25:14,816 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:14,816 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:14,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:14,837 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:14,837 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:14,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:14,840 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:14,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:25:14,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:25:14,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:14,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:14,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:14,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:14,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:14,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:14,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:14,857 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:14,861 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:25:14,862 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:25:14,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:14,864 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:14,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:25:14,866 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:14,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:25:14,870 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:14,870 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:14,870 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 16:25:14,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:25:14,878 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:14,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:14,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:14,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:14,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:14,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:14,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:14,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:14,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:14,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:14,907 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:14,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:25:14,923 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:25:14,923 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3229 states and 17845 transitions. cyclomatic complexity: 15171 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:15,280 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3229 states and 17845 transitions. cyclomatic complexity: 15171. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 9935 states and 57182 transitions. Complement of second has 6 states. [2025-04-26 16:25:15,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:25:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-26 16:25:15,281 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:25:15,281 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:15,281 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:25:15,282 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:15,282 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:25:15,282 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:15,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9935 states and 57182 transitions. [2025-04-26 16:25:15,445 INFO L131 ngComponentsAnalysis]: Automaton has 501 accepting balls. 1818 [2025-04-26 16:25:15,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9935 states to 7313 states and 42241 transitions. [2025-04-26 16:25:15,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2615 [2025-04-26 16:25:15,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3994 [2025-04-26 16:25:15,632 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7313 states and 42241 transitions. [2025-04-26 16:25:15,633 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:25:15,633 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7313 states and 42241 transitions. [2025-04-26 16:25:15,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7313 states and 42241 transitions. [2025-04-26 16:25:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7313 to 5934. [2025-04-26 16:25:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5934 states, 5934 states have (on average 6.017694641051567) internal successors, (in total 35709), 5933 states have internal predecessors, (35709), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:15,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5934 states to 5934 states and 35709 transitions. [2025-04-26 16:25:15,885 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5934 states and 35709 transitions. [2025-04-26 16:25:15,885 INFO L438 stractBuchiCegarLoop]: Abstraction has 5934 states and 35709 transitions. [2025-04-26 16:25:15,885 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:25:15,886 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5934 states and 35709 transitions. [2025-04-26 16:25:15,922 INFO L131 ngComponentsAnalysis]: Automaton has 501 accepting balls. 1818 [2025-04-26 16:25:15,922 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:15,922 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:15,923 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:25:15,923 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:15,923 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]" "[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]" "[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]" [2025-04-26 16:25:15,923 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 16:25:15,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:15,924 INFO L85 PathProgramCache]: Analyzing trace with hash 131176, now seen corresponding path program 1 times [2025-04-26 16:25:15,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:15,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603865585] [2025-04-26 16:25:15,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:15,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:15,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:15,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:15,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:15,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:15,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:15,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:15,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:15,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:15,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:15,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:15,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:15,930 INFO L85 PathProgramCache]: Analyzing trace with hash 3779, now seen corresponding path program 1 times [2025-04-26 16:25:15,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:15,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881016669] [2025-04-26 16:25:15,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:15,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:15,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:15,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:15,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:15,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:15,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:15,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:15,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:15,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:15,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:15,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:15,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:15,935 INFO L85 PathProgramCache]: Analyzing trace with hash 126062954, now seen corresponding path program 1 times [2025-04-26 16:25:15,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:15,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008735484] [2025-04-26 16:25:15,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:15,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:15,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:25:15,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:25:15,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:15,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:15,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:15,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:25:15,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:25:15,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:15,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:15,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:15,959 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:15,959 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:15,959 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:15,959 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:15,959 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:15,959 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:15,959 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:15,959 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:15,959 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:25:15,959 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:15,960 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:15,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:15,978 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:15,978 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:15,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:15,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:15,981 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:15,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:25:15,984 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:15,984 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:16,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:16,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:16,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:16,004 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:16,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:25:16,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:16,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:16,075 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:16,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:25:16,079 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:16,080 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:16,080 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:16,080 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:16,080 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:16,080 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:16,080 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:16,080 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:16,080 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:25:16,080 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:16,080 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:16,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:16,097 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:16,098 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:16,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:16,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:16,100 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:16,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:25:16,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:25:16,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:16,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:16,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:16,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:16,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:16,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:16,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:16,116 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:16,118 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:25:16,118 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:25:16,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:16,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:16,120 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:16,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:25:16,122 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:16,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:25:16,125 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:16,126 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:16,126 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:25:16,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:16,132 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:16,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:16,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:16,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:16,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:16,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:16,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:16,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:16,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:16,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:16,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:16,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:16,161 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:16,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:25:16,174 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:25:16,175 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5934 states and 35709 transitions. cyclomatic complexity: 30584 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:16,529 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5934 states and 35709 transitions. cyclomatic complexity: 30584. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 18697 states and 115179 transitions. Complement of second has 6 states. [2025-04-26 16:25:16,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:25:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-04-26 16:25:16,534 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:25:16,534 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:16,534 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:25:16,534 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:16,534 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:25:16,534 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:16,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18697 states and 115179 transitions. [2025-04-26 16:25:16,961 INFO L131 ngComponentsAnalysis]: Automaton has 490 accepting balls. 1554 [2025-04-26 16:25:17,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18697 states to 12831 states and 78985 transitions. [2025-04-26 16:25:17,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3674 [2025-04-26 16:25:17,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4969 [2025-04-26 16:25:17,194 INFO L74 IsDeterministic]: Start isDeterministic. Operand 12831 states and 78985 transitions. [2025-04-26 16:25:17,195 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:25:17,195 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12831 states and 78985 transitions. [2025-04-26 16:25:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12831 states and 78985 transitions. [2025-04-26 16:25:17,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12831 to 10809. [2025-04-26 16:25:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10809 states, 10809 states have (on average 6.376723101119437) internal successors, (in total 68926), 10808 states have internal predecessors, (68926), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10809 states to 10809 states and 68926 transitions. [2025-04-26 16:25:17,630 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10809 states and 68926 transitions. [2025-04-26 16:25:17,630 INFO L438 stractBuchiCegarLoop]: Abstraction has 10809 states and 68926 transitions. [2025-04-26 16:25:17,630 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:25:17,630 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10809 states and 68926 transitions. [2025-04-26 16:25:17,830 INFO L131 ngComponentsAnalysis]: Automaton has 490 accepting balls. 1554 [2025-04-26 16:25:17,830 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:17,830 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:17,831 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:25:17,831 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:25:17,831 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]" "[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]" "[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]" "[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]" [2025-04-26 16:25:17,831 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 16:25:17,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:17,832 INFO L85 PathProgramCache]: Analyzing trace with hash 4066567, now seen corresponding path program 1 times [2025-04-26 16:25:17,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:17,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498476410] [2025-04-26 16:25:17,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:17,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:17,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:17,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:17,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:17,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:17,836 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:17,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:17,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:17,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:17,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:17,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:17,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:17,843 INFO L85 PathProgramCache]: Analyzing trace with hash 121212, now seen corresponding path program 1 times [2025-04-26 16:25:17,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:17,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735320554] [2025-04-26 16:25:17,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:17,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:17,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:17,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:17,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:17,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:17,846 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:17,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:17,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:17,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:17,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:17,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:17,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:17,849 INFO L85 PathProgramCache]: Analyzing trace with hash 888104630, now seen corresponding path program 1 times [2025-04-26 16:25:17,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:17,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791760941] [2025-04-26 16:25:17,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:17,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:17,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:25:17,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:25:17,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:17,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:17,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:17,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:25:17,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:25:17,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:17,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:17,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:17,929 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:17,930 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:17,930 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:17,930 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:17,930 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:17,930 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:17,930 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:17,930 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:17,930 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:25:17,930 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:17,930 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:17,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:17,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:17,978 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:17,978 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:17,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:17,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:17,985 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:17,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:25:17,989 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:17,990 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:18,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:18,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:18,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:18,011 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:18,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:25:18,013 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:18,013 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:18,061 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:25:18,061 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x5=0} Honda state: {x5=0} Generalized eigenvectors: [{x5=-1}, {x5=2}, {x5=0}] Lambdas: [3, 1, 1] Nus: [1, 0] [2025-04-26 16:25:18,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:25:18,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:18,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:18,075 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:18,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:25:18,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:18,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:18,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:18,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:18,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:18,099 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:18,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:25:18,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:18,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:18,189 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:18,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:25:18,194 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:18,194 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:18,194 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:18,194 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:18,194 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:18,194 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:18,194 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:18,194 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:18,194 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:25:18,194 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:18,194 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:18,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:18,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:18,237 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:18,237 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:18,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:18,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:18,243 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:18,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:25:18,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:25:18,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:18,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:18,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:18,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:18,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:18,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:18,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:18,270 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:25:18,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:25:18,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:18,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:18,289 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:18,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:25:18,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:25:18,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:18,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:18,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:18,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:18,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:18,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:18,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:18,313 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:18,316 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:25:18,317 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:25:18,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:18,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:18,319 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:18,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:25:18,322 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:18,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:25:18,326 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:18,327 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:18,327 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:25:18,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:18,333 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:18,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:18,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:18,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:18,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:18,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:18,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:18,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:18,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:18,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:18,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:18,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:18,385 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:18,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:25:18,424 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:25:18,425 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10809 states and 68926 transitions. cyclomatic complexity: 59257 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:18,832 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10809 states and 68926 transitions. cyclomatic complexity: 59257. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 30671 states and 196450 transitions. Complement of second has 6 states. [2025-04-26 16:25:18,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:25:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-04-26 16:25:18,833 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:25:18,833 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:18,833 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:25:18,833 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:18,833 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:25:18,834 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:18,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30671 states and 196450 transitions. [2025-04-26 16:25:19,358 INFO L131 ngComponentsAnalysis]: Automaton has 426 accepting balls. 852 [2025-04-26 16:25:19,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30671 states to 17067 states and 109798 transitions. [2025-04-26 16:25:19,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4373 [2025-04-26 16:25:19,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4968 [2025-04-26 16:25:19,602 INFO L74 IsDeterministic]: Start isDeterministic. Operand 17067 states and 109798 transitions. [2025-04-26 16:25:19,602 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:25:19,602 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17067 states and 109798 transitions. [2025-04-26 16:25:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17067 states and 109798 transitions. [2025-04-26 16:25:20,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17067 to 15670. [2025-04-26 16:25:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15670 states, 15670 states have (on average 6.509955328653478) internal successors, (in total 102011), 15669 states have internal predecessors, (102011), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15670 states to 15670 states and 102011 transitions. [2025-04-26 16:25:20,478 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15670 states and 102011 transitions. [2025-04-26 16:25:20,478 INFO L438 stractBuchiCegarLoop]: Abstraction has 15670 states and 102011 transitions. [2025-04-26 16:25:20,479 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:25:20,479 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15670 states and 102011 transitions. [2025-04-26 16:25:20,589 INFO L131 ngComponentsAnalysis]: Automaton has 426 accepting balls. 852 [2025-04-26 16:25:20,589 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:20,589 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:20,589 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:25:20,589 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:20,590 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]" "[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]" "[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]" "[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]" "[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 16:25:20,590 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 16:25:20,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:20,591 INFO L85 PathProgramCache]: Analyzing trace with hash 126063691, now seen corresponding path program 1 times [2025-04-26 16:25:20,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:20,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741052628] [2025-04-26 16:25:20,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:20,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:20,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:25:20,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:25:20,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:20,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:20,598 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:20,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:25:20,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:25:20,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:20,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:20,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:20,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:20,602 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 16:25:20,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:20,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935872337] [2025-04-26 16:25:20,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:20,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:20,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:20,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:20,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:20,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:20,605 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:20,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:20,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:20,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:20,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:20,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:20,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:20,607 INFO L85 PathProgramCache]: Analyzing trace with hash 888125869, now seen corresponding path program 1 times [2025-04-26 16:25:20,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:20,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869288053] [2025-04-26 16:25:20,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:20,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:20,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:25:20,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:25:20,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:20,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:20,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:20,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:25:20,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:25:20,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:20,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:20,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:20,628 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:20,629 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:20,629 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:20,629 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:20,629 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:20,629 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:20,629 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:20,629 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:20,629 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:25:20,629 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:20,629 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:20,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:20,644 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:20,644 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:20,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:20,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:20,646 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:20,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:25:20,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:20,649 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:20,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:20,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:20,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:20,668 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:20,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:25:20,670 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:20,670 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:20,736 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:20,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:20,740 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:20,740 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:20,740 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:20,740 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:20,740 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:20,740 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:20,740 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:20,741 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:20,741 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:25:20,741 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:20,741 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:20,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:20,759 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:20,759 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:20,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:20,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:20,762 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:20,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:25:20,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:25:20,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:20,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:20,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:20,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:20,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:20,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:20,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:20,777 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:20,779 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:25:20,779 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:25:20,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:20,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:20,781 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:20,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:25:20,784 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:20,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:20,788 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:20,788 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:20,788 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, z) = -1*x5 + 1*z Supporting invariants [] [2025-04-26 16:25:20,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:20,795 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:20,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:20,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:25:20,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:25:20,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:20,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:20,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:20,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:20,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:20,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:20,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:20,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:20,824 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:20,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:20,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:25:20,841 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:25:20,841 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15670 states and 102011 transitions. cyclomatic complexity: 87919 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:21,575 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15670 states and 102011 transitions. cyclomatic complexity: 87919. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 53270 states and 340448 transitions. Complement of second has 6 states. [2025-04-26 16:25:21,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:25:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-04-26 16:25:21,576 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:25:21,576 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:21,576 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:25:21,576 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:21,576 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:25:21,576 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:21,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53270 states and 340448 transitions. [2025-04-26 16:25:22,902 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:25:22,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53270 states to 0 states and 0 transitions. [2025-04-26 16:25:22,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:25:22,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:25:22,903 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:25:22,903 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:25:22,903 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:25:22,903 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:25:22,903 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:25:22,903 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:25:22,903 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:25:22,903 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:25:22,903 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:25:22,910 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:25:22 BoogieIcfgContainer [2025-04-26 16:25:22,910 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:25:22,910 INFO L158 Benchmark]: Toolchain (without parser) took 10307.29ms. Allocated memory was 159.4MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 86.8MB in the beginning and 419.4MB in the end (delta: -332.6MB). Peak memory consumption was 619.4MB. Max. memory is 8.0GB. [2025-04-26 16:25:22,911 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:25:22,911 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.78ms. Allocated memory is still 159.4MB. Free memory was 86.8MB in the beginning and 84.9MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:25:22,911 INFO L158 Benchmark]: Boogie Preprocessor took 23.82ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:25:22,911 INFO L158 Benchmark]: RCFGBuilder took 167.57ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 74.7MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:25:22,911 INFO L158 Benchmark]: BuchiAutomizer took 10068.85ms. Allocated memory was 159.4MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 74.5MB in the beginning and 419.4MB in the end (delta: -344.9MB). Peak memory consumption was 606.8MB. Max. memory is 8.0GB. [2025-04-26 16:25:22,920 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.78ms. Allocated memory is still 159.4MB. Free memory was 86.8MB in the beginning and 84.9MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.82ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 167.57ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 74.7MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 10068.85ms. Allocated memory was 159.4MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 74.5MB in the beginning and 419.4MB in the end (delta: -344.9MB). Peak memory consumption was 606.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.2s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 1.8s AutomataMinimizationTime, 4 MinimizatonAttempts, 6010 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 3.2s 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, 284 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 279 mSDsluCounter, 274 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 381 IncrementalHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 133 mSDtfsCounter, 381 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: 42ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - 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 * x4 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + 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 16:25:22,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...