/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 --buchiautomizer.automaton.type.for.concurrent.programs PARTIAL_ORDER_BA -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/indep_loops_6.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:49:12,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:49:12,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:49:12,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:49:12,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:49:12,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:49:12,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:49:12,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:49:12,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:49:12,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:49:12,577 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:49:12,577 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:49:12,578 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:49:12,578 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:49:12,578 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:49:12,578 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:49:12,578 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:49:12,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:49:12,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:49:12,578 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:49:12,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:49:12,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:49:12,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:49:12,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:49:12,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:49:12,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:49:12,578 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:49:12,578 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:49:12,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:49:12,579 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:49:12,579 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:49:12,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:49:12,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:49:12,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:49:12,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:49:12,579 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:49:12,579 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> PARTIAL_ORDER_BA [2025-02-17 22:49:12,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:49:12,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:49:12,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:49:12,845 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:49:12,846 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:49:12,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_6.c.bpl [2025-02-17 22:49:12,849 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_6.c.bpl' [2025-02-17 22:49:12,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:49:12,869 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:49:12,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:12,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:49:12,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:49:12,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:12" (1/1) ... [2025-02-17 22:49:12,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:12" (1/1) ... [2025-02-17 22:49:12,886 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:49:12,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:12,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:49:12,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:49:12,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:49:12,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:12" (1/1) ... [2025-02-17 22:49:12,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:12" (1/1) ... [2025-02-17 22:49:12,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:12" (1/1) ... [2025-02-17 22:49:12,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:12" (1/1) ... [2025-02-17 22:49:12,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:12" (1/1) ... [2025-02-17 22:49:12,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:12" (1/1) ... [2025-02-17 22:49:12,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:12" (1/1) ... [2025-02-17 22:49:12,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:12" (1/1) ... [2025-02-17 22:49:12,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:12" (1/1) ... [2025-02-17 22:49:12,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:49:12,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:49:12,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:49:12,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:49:12,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:12" (1/1) ... [2025-02-17 22:49:12,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:12,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:12,936 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-02-17 22:49:12,941 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-02-17 22:49:12,964 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:49:12,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:49:12,965 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:49:12,965 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:49:12,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:49:12,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:49:12,966 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:49:12,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:49:12,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:49:12,966 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:49:12,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:49:12,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:49:12,966 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-02-17 22:49:12,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-17 22:49:12,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-17 22:49:12,966 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-02-17 22:49:12,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-02-17 22:49:12,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-02-17 22:49:12,966 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-02-17 22:49:12,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-02-17 22:49:12,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-02-17 22:49:12,967 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:49:13,010 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:49:13,011 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:49:13,098 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:49:13,098 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:49:13,109 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:49:13,110 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:49:13,111 INFO L201 PluginConnector]: Adding new model indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:13 BoogieIcfgContainer [2025-02-17 22:49:13,111 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:49:13,111 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:49:13,112 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:49:13,117 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:49:13,118 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:13,118 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:12" (1/2) ... [2025-02-17 22:49:13,119 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cb1ec01 and model type indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:49:13, skipping insertion in model container [2025-02-17 22:49:13,119 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:13,119 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:13" (2/2) ... [2025-02-17 22:49:13,121 INFO L363 chiAutomizerObserver]: Analyzing ICFG indep_loops_6.c.bpl [2025-02-17 22:49:13,222 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-02-17 22:49:13,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 49 transitions, 140 flow [2025-02-17 22:49:13,309 INFO L124 PetriNetUnfolderBase]: 6/37 cut-off events. [2025-02-17 22:49:13,313 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-17 22:49:13,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 37 events. 6/37 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-02-17 22:49:13,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 49 transitions, 140 flow [2025-02-17 22:49:13,321 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 37 transitions, 110 flow [2025-02-17 22:49:13,328 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:49:15,615 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:49:15,615 INFO L101 AmpleReduction]: Number of pruned transitions: 2534, Number of non-trivial ample sets: 19420 [2025-02-17 22:49:15,615 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 18016 [2025-02-17 22:49:15,630 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:49:15,630 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:49:15,630 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:49:15,631 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:49:15,631 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:49:15,632 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:49:15,632 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:49:15,632 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:49:15,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6827 states, 6826 states have (on average 5.496191034280692) internal successors, (37517), 6826 states have internal predecessors, (37517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:15,925 INFO L131 ngComponentsAnalysis]: Automaton has 1267 accepting balls. 6636 [2025-02-17 22:49:15,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:15,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:15,931 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:49:15,931 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:15,931 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:49:15,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6827 states, 6826 states have (on average 5.496191034280692) internal successors, (37517), 6826 states have internal predecessors, (37517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:16,124 INFO L131 ngComponentsAnalysis]: Automaton has 1267 accepting balls. 6636 [2025-02-17 22:49:16,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:16,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:16,125 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:49:16,125 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:16,131 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:49:16,131 INFO L754 eck$LassoCheckResult]: Loop: "[93] L29-->L31: 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[]" "[95] L31-->L29: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-02-17 22:49:16,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:16,135 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 1 times [2025-02-17 22:49:16,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:16,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809655642] [2025-02-17 22:49:16,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:16,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:16,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:49:16,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:49:16,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:16,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:16,197 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:16,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:49:16,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:49:16,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:16,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:16,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:16,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:16,220 INFO L85 PathProgramCache]: Analyzing trace with hash 3939, now seen corresponding path program 1 times [2025-02-17 22:49:16,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:16,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252856126] [2025-02-17 22:49:16,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:16,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:16,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:16,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:16,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:16,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:16,229 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:16,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:16,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:16,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:16,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:16,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:16,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:16,238 INFO L85 PathProgramCache]: Analyzing trace with hash 146167, now seen corresponding path program 1 times [2025-02-17 22:49:16,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:16,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111903904] [2025-02-17 22:49:16,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:16,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:16,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:16,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:16,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:16,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:16,246 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:16,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:16,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:16,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:16,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:16,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:16,288 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:16,292 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:16,292 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:16,292 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:16,292 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:16,292 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:16,292 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:16,292 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:16,292 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:16,292 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:16,293 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:16,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:16,345 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:16,345 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:16,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:16,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:16,349 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-02-17 22:49:16,351 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-02-17 22:49:16,353 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:16,353 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:16,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:16,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:16,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:16,375 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-02-17 22:49:16,377 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-02-17 22:49:16,378 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:16,378 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:16,563 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:16,573 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-02-17 22:49:16,573 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:16,573 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:16,573 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:16,573 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:16,574 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:16,574 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:16,574 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:16,574 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:16,574 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:16,574 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:16,574 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:16,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:16,616 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:16,621 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:16,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:16,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:16,624 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-02-17 22:49:16,627 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-02-17 22:49:16,631 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-02-17 22:49:16,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:16,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:16,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:16,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:16,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:16,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:16,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:16,654 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:16,660 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:16,661 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:16,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:16,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:16,665 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-02-17 22:49:16,668 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-02-17 22:49:16,669 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:16,669 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:16,670 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:16,670 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:49:16,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:16,680 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:16,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:16,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:49:16,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:49:16,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:16,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:16,718 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:16,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:16,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:16,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:16,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:16,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:16,731 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:16,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:16,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:16,769 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-02-17 22:49:16,791 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 6827 states, 6826 states have (on average 5.496191034280692) internal successors, (37517), 6826 states have internal predecessors, (37517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:17,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-17 22:49:17,542 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 6827 states, 6826 states have (on average 5.496191034280692) internal successors, (37517), 6826 states have internal predecessors, (37517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19109 states and 115361 transitions. Complement of second has 6 states. [2025-02-17 22:49:17,544 INFO L141 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-02-17 22:49:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-02-17 22:49:17,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 89 transitions. Stem has 1 letters. Loop has 2 letters. [2025-02-17 22:49:17,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:17,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 89 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:49:17,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:17,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 89 transitions. Stem has 1 letters. Loop has 4 letters. [2025-02-17 22:49:17,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:17,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19109 states and 115361 transitions. [2025-02-17 22:49:18,020 INFO L131 ngComponentsAnalysis]: Automaton has 1493 accepting balls. 6486 [2025-02-17 22:49:18,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19109 states to 14629 states and 90410 transitions. [2025-02-17 22:49:18,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6633 [2025-02-17 22:49:18,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10631 [2025-02-17 22:49:18,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14629 states and 90410 transitions. [2025-02-17 22:49:18,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:18,598 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14629 states and 90410 transitions. [2025-02-17 22:49:18,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14629 states and 90410 transitions. [2025-02-17 22:49:19,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14629 to 10633. [2025-02-17 22:49:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10633 states, 10633 states have (on average 6.377409950155177) internal successors, (67811), 10632 states have internal predecessors, (67811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10633 states to 10633 states and 67811 transitions. [2025-02-17 22:49:19,409 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10633 states and 67811 transitions. [2025-02-17 22:49:19,409 INFO L432 stractBuchiCegarLoop]: Abstraction has 10633 states and 67811 transitions. [2025-02-17 22:49:19,409 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:49:19,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10633 states and 67811 transitions. [2025-02-17 22:49:19,528 INFO L131 ngComponentsAnalysis]: Automaton has 1493 accepting balls. 6486 [2025-02-17 22:49:19,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:19,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:19,529 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:49:19,529 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:19,529 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[121] L12-->L38: 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-02-17 22:49:19,530 INFO L754 eck$LassoCheckResult]: Loop: "[97] L38-->L40: 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[]" "[99] L40-->L38: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:49:19,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:19,531 INFO L85 PathProgramCache]: Analyzing trace with hash 4740, now seen corresponding path program 1 times [2025-02-17 22:49:19,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:19,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913176634] [2025-02-17 22:49:19,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:19,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:19,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:19,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:19,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,537 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:19,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:19,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:19,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:19,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:19,540 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-02-17 22:49:19,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:19,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925753420] [2025-02-17 22:49:19,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:19,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:19,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:19,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:19,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,549 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:19,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:19,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:19,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:19,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:19,555 INFO L85 PathProgramCache]: Analyzing trace with hash 4558246, now seen corresponding path program 1 times [2025-02-17 22:49:19,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:19,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910453317] [2025-02-17 22:49:19,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:19,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:19,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:19,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:19,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,561 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:19,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:19,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:19,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:19,582 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:19,582 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:19,582 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:19,582 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:19,582 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:19,582 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:19,582 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:19,583 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:19,583 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:19,583 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:19,583 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:19,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:19,603 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:19,603 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:19,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:19,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:19,605 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-02-17 22:49:19,607 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-02-17 22:49:19,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:19,609 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:19,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:19,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:19,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:19,629 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-02-17 22:49:19,633 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-02-17 22:49:19,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:19,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:19,701 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:19,705 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-02-17 22:49:19,705 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:19,705 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:19,705 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:19,705 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:19,706 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:19,706 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:19,706 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:19,706 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:19,706 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:19,706 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:19,706 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:19,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:19,727 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:19,727 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:19,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:19,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:19,729 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-02-17 22:49:19,730 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-02-17 22:49:19,732 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-02-17 22:49:19,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:19,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:19,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:19,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:19,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:19,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:19,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:19,746 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:19,751 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:19,751 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:19,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:19,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:19,753 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-02-17 22:49:19,754 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-02-17 22:49:19,755 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:19,755 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:19,755 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:19,755 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-02-17 22:49:19,761 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-02-17 22:49:19,762 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:19,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:19,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:19,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:19,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:19,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:19,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:19,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:19,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:19,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:19,789 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:19,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:19,803 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-02-17 22:49:19,804 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10633 states and 67811 transitions. cyclomatic complexity: 59003 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:20,568 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10633 states and 67811 transitions. cyclomatic complexity: 59003. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32644 states and 215483 transitions. Complement of second has 6 states. [2025-02-17 22:49:20,569 INFO L141 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-02-17 22:49:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:20,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-02-17 22:49:20,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:49:20,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:20,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:20,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:20,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:49:20,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:20,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32644 states and 215483 transitions. [2025-02-17 22:49:20,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:21,455 INFO L131 ngComponentsAnalysis]: Automaton has 1656 accepting balls. 5887 [2025-02-17 22:49:21,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32644 states to 24413 states and 162421 transitions. [2025-02-17 22:49:21,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8715 [2025-02-17 22:49:21,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13299 [2025-02-17 22:49:21,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24413 states and 162421 transitions. [2025-02-17 22:49:21,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:21,912 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24413 states and 162421 transitions. [2025-02-17 22:49:22,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24413 states and 162421 transitions. [2025-02-17 22:49:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24413 to 19829. [2025-02-17 22:49:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19829 states, 19829 states have (on average 6.943214483836805) internal successors, (137677), 19828 states have internal predecessors, (137677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19829 states to 19829 states and 137677 transitions. [2025-02-17 22:49:23,276 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19829 states and 137677 transitions. [2025-02-17 22:49:23,276 INFO L432 stractBuchiCegarLoop]: Abstraction has 19829 states and 137677 transitions. [2025-02-17 22:49:23,276 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:49:23,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19829 states and 137677 transitions. [2025-02-17 22:49:23,482 INFO L131 ngComponentsAnalysis]: Automaton has 1656 accepting balls. 5887 [2025-02-17 22:49:23,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:23,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:23,483 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:49:23,483 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:23,484 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[121] L12-->L38: 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]" "[124] L13-->L47: 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-02-17 22:49:23,484 INFO L754 eck$LassoCheckResult]: Loop: "[101] L47-->L49: 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[]" "[103] L49-->L47: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-02-17 22:49:23,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash 147064, now seen corresponding path program 1 times [2025-02-17 22:49:23,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:23,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817394651] [2025-02-17 22:49:23,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:23,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:23,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:23,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:23,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:23,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:23,489 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:23,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:23,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:23,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:23,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:23,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:23,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:23,492 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-02-17 22:49:23,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:23,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530796673] [2025-02-17 22:49:23,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:23,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:23,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:23,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:23,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:23,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:23,495 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:23,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:23,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:23,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:23,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:23,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:23,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:23,498 INFO L85 PathProgramCache]: Analyzing trace with hash 141331738, now seen corresponding path program 1 times [2025-02-17 22:49:23,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:23,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105870645] [2025-02-17 22:49:23,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:23,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:23,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:23,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:23,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:23,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:23,501 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:23,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:23,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:23,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:23,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:23,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:23,523 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:23,524 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:23,524 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:23,524 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:23,524 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:23,524 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:23,524 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:23,524 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:23,524 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:23,524 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:23,524 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:23,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:23,541 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:23,541 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:23,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:23,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:23,543 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-02-17 22:49:23,545 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-02-17 22:49:23,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:23,547 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:23,563 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-02-17 22:49:23,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:23,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:23,566 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-02-17 22:49:23,568 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-02-17 22:49:23,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:23,569 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:23,639 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:23,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:23,644 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:23,644 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:23,644 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:23,644 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:23,644 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:23,644 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:23,644 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:23,644 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:23,644 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:23,644 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:23,644 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:23,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:23,663 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:23,663 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:23,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:23,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:23,665 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-02-17 22:49:23,669 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-02-17 22:49:23,670 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-02-17 22:49:23,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:23,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:23,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:23,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:23,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:23,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:23,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:23,684 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:23,686 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:23,686 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:23,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:23,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:23,688 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-02-17 22:49:23,691 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-02-17 22:49:23,692 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:23,692 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:23,692 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:23,692 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-02-17 22:49:23,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-17 22:49:23,699 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:23,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:23,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:23,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:23,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:23,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:23,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:23,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:23,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:23,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:23,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:23,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:23,729 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:23,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:23,743 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-02-17 22:49:23,743 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19829 states and 137677 transitions. cyclomatic complexity: 120515 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:24,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:25,005 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19829 states and 137677 transitions. cyclomatic complexity: 120515. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 61929 states and 437651 transitions. Complement of second has 6 states. [2025-02-17 22:49:25,006 INFO L141 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-02-17 22:49:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-02-17 22:49:25,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:49:25,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:25,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:25,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:25,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:49:25,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:25,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61929 states and 437651 transitions. [2025-02-17 22:49:26,535 INFO L131 ngComponentsAnalysis]: Automaton has 1779 accepting balls. 5163 [2025-02-17 22:49:27,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61929 states to 44205 states and 314833 transitions. [2025-02-17 22:49:27,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12703 [2025-02-17 22:49:27,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17043 [2025-02-17 22:49:27,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44205 states and 314833 transitions. [2025-02-17 22:49:27,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:27,818 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44205 states and 314833 transitions. [2025-02-17 22:49:27,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44205 states and 314833 transitions. [2025-02-17 22:49:28,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44205 to 37505. [2025-02-17 22:49:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37505 states, 37505 states have (on average 7.369977336355153) internal successors, (276411), 37504 states have internal predecessors, (276411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37505 states to 37505 states and 276411 transitions. [2025-02-17 22:49:29,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37505 states and 276411 transitions. [2025-02-17 22:49:29,584 INFO L432 stractBuchiCegarLoop]: Abstraction has 37505 states and 276411 transitions. [2025-02-17 22:49:29,584 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:49:29,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37505 states and 276411 transitions. [2025-02-17 22:49:30,107 INFO L131 ngComponentsAnalysis]: Automaton has 1779 accepting balls. 5163 [2025-02-17 22:49:30,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:30,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:30,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:49:30,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:30,109 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[121] L12-->L38: 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]" "[96] L38-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[124] L13-->L47: 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]" "[127] L14-->L56: 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-02-17 22:49:30,109 INFO L754 eck$LassoCheckResult]: Loop: "[105] L56-->L58: 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[]" "[107] L58-->L56: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-02-17 22:49:30,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash 141305567, now seen corresponding path program 1 times [2025-02-17 22:49:30,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:30,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000109781] [2025-02-17 22:49:30,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:30,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:30,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:30,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:30,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:30,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:30,125 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:30,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:30,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:30,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:30,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:30,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:30,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:30,139 INFO L85 PathProgramCache]: Analyzing trace with hash 4323, now seen corresponding path program 1 times [2025-02-17 22:49:30,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:30,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799703547] [2025-02-17 22:49:30,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:30,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:30,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:30,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:30,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:30,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:30,146 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:30,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:30,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:30,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:30,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:30,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:30,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:30,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1644300223, now seen corresponding path program 1 times [2025-02-17 22:49:30,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:30,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051313988] [2025-02-17 22:49:30,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:30,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:30,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:30,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:30,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:30,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:30,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:30,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:30,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:30,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:30,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:30,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:30,196 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:30,196 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:30,196 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:30,196 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:30,196 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:30,196 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:30,196 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:30,196 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:30,196 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:30,196 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:30,196 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:30,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:30,214 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:30,214 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:30,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:30,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:30,217 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-02-17 22:49:30,220 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-02-17 22:49:30,221 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:30,221 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:30,245 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-02-17 22:49:30,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:30,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:30,248 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-02-17 22:49:30,250 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-02-17 22:49:30,251 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:30,251 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:30,321 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:30,326 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-02-17 22:49:30,326 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:30,326 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:30,326 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:30,326 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:30,326 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:30,326 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:30,326 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:30,326 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:30,326 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:30,327 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:30,327 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:30,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:30,348 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:30,348 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:30,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:30,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:30,350 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-02-17 22:49:30,352 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-02-17 22:49:30,353 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-02-17 22:49:30,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:30,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:30,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:30,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:30,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:30,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:30,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:30,367 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:30,371 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:30,372 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:30,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:30,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:30,374 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-02-17 22:49:30,374 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-02-17 22:49:30,375 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:30,375 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:30,375 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:30,375 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-02-17 22:49:30,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-17 22:49:30,381 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:30,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:30,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:30,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:30,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:30,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:30,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:30,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:30,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:30,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:30,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:30,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:30,418 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:30,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:30,433 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-02-17 22:49:30,433 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37505 states and 276411 transitions. cyclomatic complexity: 242970 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:30,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:32,457 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37505 states and 276411 transitions. cyclomatic complexity: 242970. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 111336 states and 827565 transitions. Complement of second has 6 states. [2025-02-17 22:49:32,457 INFO L141 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-02-17 22:49:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-02-17 22:49:32,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 99 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:32,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:32,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 99 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-17 22:49:32,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:32,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 99 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-17 22:49:32,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:32,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111336 states and 827565 transitions. [2025-02-17 22:49:35,375 INFO L131 ngComponentsAnalysis]: Automaton has 1716 accepting balls. 4109 [2025-02-17 22:49:37,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111336 states to 73844 states and 551735 transitions. [2025-02-17 22:49:37,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17897 [2025-02-17 22:49:37,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21614 [2025-02-17 22:49:37,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73844 states and 551735 transitions. [2025-02-17 22:49:37,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:37,191 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73844 states and 551735 transitions. [2025-02-17 22:49:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73844 states and 551735 transitions. [2025-02-17 22:49:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73844 to 64665. [2025-02-17 22:49:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64665 states, 64665 states have (on average 7.666512023505761) internal successors, (495755), 64664 states have internal predecessors, (495755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64665 states to 64665 states and 495755 transitions. [2025-02-17 22:49:40,864 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64665 states and 495755 transitions. [2025-02-17 22:49:40,864 INFO L432 stractBuchiCegarLoop]: Abstraction has 64665 states and 495755 transitions. [2025-02-17 22:49:40,865 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:49:40,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64665 states and 495755 transitions. [2025-02-17 22:49:41,880 INFO L131 ngComponentsAnalysis]: Automaton has 1716 accepting balls. 4109 [2025-02-17 22:49:41,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:41,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:41,882 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-17 22:49:41,882 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:41,882 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[121] L12-->L38: 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]" "[97] L38-->L40: 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[]" "[124] L13-->L47: 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]" "[127] L14-->L56: 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]" "[130] L15-->L65: 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-02-17 22:49:41,882 INFO L754 eck$LassoCheckResult]: Loop: "[109] L65-->L67: Formula: (< v_x5_1 v_z_9) InVars {x5=v_x5_1, z=v_z_9} OutVars{x5=v_x5_1, z=v_z_9} AuxVars[] AssignedVars[]" "[111] L67-->L65: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" [2025-02-17 22:49:41,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:41,883 INFO L85 PathProgramCache]: Analyzing trace with hash 85535202, now seen corresponding path program 1 times [2025-02-17 22:49:41,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:41,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267113523] [2025-02-17 22:49:41,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:41,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:41,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:41,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:41,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:41,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:41,888 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:41,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:41,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:41,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:41,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:41,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:41,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:41,895 INFO L85 PathProgramCache]: Analyzing trace with hash 4451, now seen corresponding path program 1 times [2025-02-17 22:49:41,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:41,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586235047] [2025-02-17 22:49:41,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:41,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:41,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:41,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:41,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:41,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:41,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:41,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:41,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:41,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:41,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:41,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:41,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:41,905 INFO L85 PathProgramCache]: Analyzing trace with hash 594953988, now seen corresponding path program 1 times [2025-02-17 22:49:41,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:41,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034748898] [2025-02-17 22:49:41,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:41,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:41,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:41,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:41,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:41,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:41,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:41,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:41,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:41,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:41,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:41,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:41,945 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:41,945 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:41,945 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:41,945 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:41,945 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:41,945 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:41,945 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:41,945 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:41,945 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:49:41,945 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:41,946 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:41,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:41,961 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:41,961 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:41,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:41,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:41,963 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-02-17 22:49:41,964 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-02-17 22:49:41,965 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:41,965 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:41,981 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-02-17 22:49:41,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:41,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:41,983 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-02-17 22:49:41,984 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-02-17 22:49:41,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:41,986 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:42,052 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:42,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-17 22:49:42,056 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:42,056 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:42,056 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:42,056 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:42,056 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:42,056 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:42,056 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:42,056 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:42,056 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:49:42,057 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:42,057 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:42,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:42,079 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:42,079 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:42,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:42,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:42,082 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-02-17 22:49:42,083 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-02-17 22:49:42,084 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-02-17 22:49:42,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:42,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:42,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:42,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:42,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:42,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:42,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:42,099 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:42,101 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:42,101 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:42,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:42,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:42,103 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-02-17 22:49:42,104 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-02-17 22:49:42,104 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:42,104 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:42,105 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:42,105 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-02-17 22:49:42,110 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-02-17 22:49:42,110 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:42,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:42,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:42,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:42,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:42,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:42,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:42,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:42,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:42,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:42,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:42,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:42,155 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:42,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:42,167 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-02-17 22:49:42,167 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64665 states and 495755 transitions. cyclomatic complexity: 437086 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:42,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-17 22:49:45,837 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64665 states and 495755 transitions. cyclomatic complexity: 437086. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 179067 states and 1376119 transitions. Complement of second has 6 states. [2025-02-17 22:49:45,837 INFO L141 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-02-17 22:49:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-02-17 22:49:45,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 103 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:49:45,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:45,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 103 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:49:45,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:45,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 103 transitions. Stem has 6 letters. Loop has 4 letters. [2025-02-17 22:49:45,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:45,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179067 states and 1376119 transitions. [2025-02-17 22:49:50,920 INFO L131 ngComponentsAnalysis]: Automaton has 1340 accepting balls. 2680 [2025-02-17 22:49:53,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179067 states to 99144 states and 763568 transitions. [2025-02-17 22:49:53,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21136 [2025-02-17 22:49:53,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23689 [2025-02-17 22:49:53,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99144 states and 763568 transitions. [2025-02-17 22:49:53,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:53,303 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99144 states and 763568 transitions. [2025-02-17 22:49:53,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99144 states and 763568 transitions. [2025-02-17 22:49:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99144 to 89125. [2025-02-17 22:49:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89125 states, 89125 states have (on average 7.8622384291725105) internal successors, (700722), 89124 states have internal predecessors, (700722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89125 states to 89125 states and 700722 transitions. [2025-02-17 22:49:57,553 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89125 states and 700722 transitions. [2025-02-17 22:49:57,553 INFO L432 stractBuchiCegarLoop]: Abstraction has 89125 states and 700722 transitions. [2025-02-17 22:49:57,553 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:49:57,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89125 states and 700722 transitions. [2025-02-17 22:49:58,798 INFO L131 ngComponentsAnalysis]: Automaton has 1340 accepting balls. 2680 [2025-02-17 22:49:58,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:58,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:58,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:58,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:58,799 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[121] L12-->L38: 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]" "[96] L38-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[124] L13-->L47: 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]" "[127] L14-->L56: 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]" "[130] L15-->L65: 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]" "[133] L16-->L74: Formula: (and (= v_thread6Thread1of1ForFork5_thidvar3_2 6) (= v_thread6Thread1of1ForFork5_thidvar5_2 6) (= v_thread6Thread1of1ForFork5_thidvar4_2 6) (= v_thread6Thread1of1ForFork5_thidvar2_2 6) (= v_thread6Thread1of1ForFork5_thidvar0_2 6) (= v_thread6Thread1of1ForFork5_thidvar1_2 6)) InVars {} OutVars{thread6Thread1of1ForFork5_thidvar0=v_thread6Thread1of1ForFork5_thidvar0_2, thread6Thread1of1ForFork5_thidvar1=v_thread6Thread1of1ForFork5_thidvar1_2, thread6Thread1of1ForFork5_thidvar2=v_thread6Thread1of1ForFork5_thidvar2_2, thread6Thread1of1ForFork5_thidvar3=v_thread6Thread1of1ForFork5_thidvar3_2, thread6Thread1of1ForFork5_thidvar4=v_thread6Thread1of1ForFork5_thidvar4_2, thread6Thread1of1ForFork5_thidvar5=v_thread6Thread1of1ForFork5_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_thidvar0, thread6Thread1of1ForFork5_thidvar1, thread6Thread1of1ForFork5_thidvar2, thread6Thread1of1ForFork5_thidvar3, thread6Thread1of1ForFork5_thidvar4, thread6Thread1of1ForFork5_thidvar5]" [2025-02-17 22:49:58,799 INFO L754 eck$LassoCheckResult]: Loop: "[113] L74-->L76: Formula: (< v_x6_1 v_z_11) InVars {x6=v_x6_1, z=v_z_11} OutVars{x6=v_x6_1, z=v_z_11} AuxVars[] AssignedVars[]" "[115] L76-->L74: Formula: (= v_x6_2 (+ v_x6_3 1)) InVars {x6=v_x6_3} OutVars{x6=v_x6_2} AuxVars[] AssignedVars[x6]" [2025-02-17 22:49:58,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:58,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1644299422, now seen corresponding path program 1 times [2025-02-17 22:49:58,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:58,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848461494] [2025-02-17 22:49:58,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:58,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:58,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:58,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:58,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:58,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:58,811 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:58,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:58,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:58,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:58,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:58,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:58,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:58,816 INFO L85 PathProgramCache]: Analyzing trace with hash 4579, now seen corresponding path program 1 times [2025-02-17 22:49:58,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:58,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934383155] [2025-02-17 22:49:58,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:58,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:58,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:58,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:58,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:58,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:58,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:58,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:58,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:58,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:58,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:58,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:58,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:58,821 INFO L85 PathProgramCache]: Analyzing trace with hash 376224004, now seen corresponding path program 1 times [2025-02-17 22:49:58,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:58,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984300810] [2025-02-17 22:49:58,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:58,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:58,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:49:58,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:49:58,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:58,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:58,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:58,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:49:58,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:49:58,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:58,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:58,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:58,847 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:58,848 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:58,848 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:58,848 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:58,848 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:58,848 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:58,848 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:58,848 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:58,848 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:49:58,848 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:58,848 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:58,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:58,862 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:58,862 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:58,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:58,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:58,864 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-02-17 22:49:58,865 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-02-17 22:49:58,866 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:58,866 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:58,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-17 22:49:58,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:58,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:58,884 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-02-17 22:49:58,885 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-02-17 22:49:58,886 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:58,886 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:58,948 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:58,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-17 22:49:58,952 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:58,952 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:58,952 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:58,952 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:58,952 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:58,952 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:58,952 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:58,952 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:58,952 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:49:58,952 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:58,952 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:58,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:58,965 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:58,965 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:58,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:58,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:58,967 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-02-17 22:49:58,968 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-02-17 22:49:58,969 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-02-17 22:49:58,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:58,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:58,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:58,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:58,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:58,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:58,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:58,985 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:58,988 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:58,988 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:58,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:58,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:58,990 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:58,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-17 22:49:58,992 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:58,992 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:58,993 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:58,993 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x6) = 1*z - 1*x6 Supporting invariants [] [2025-02-17 22:49:58,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-17 22:49:58,998 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:59,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:59,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:59,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:59,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:59,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:59,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:59,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:59,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:59,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:59,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:59,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:59,031 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:59,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:59,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:59,045 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-02-17 22:49:59,045 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89125 states and 700722 transitions. cyclomatic complexity: 619153 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:59,386 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2025-02-17 22:49:59,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-17 22:50:03,008 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89125 states and 700722 transitions. cyclomatic complexity: 619153. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 210208 states and 1624248 transitions. Complement of second has 6 states. [2025-02-17 22:50:03,009 INFO L141 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-02-17 22:50:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:50:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-02-17 22:50:03,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 103 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-17 22:50:03,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:50:03,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 103 transitions. Stem has 9 letters. Loop has 2 letters. [2025-02-17 22:50:03,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:50:03,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 103 transitions. Stem has 7 letters. Loop has 4 letters. [2025-02-17 22:50:03,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:50:03,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210208 states and 1624248 transitions. [2025-02-17 22:50:08,923 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:50:08,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210208 states to 0 states and 0 transitions. [2025-02-17 22:50:08,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:50:08,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:50:08,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:50:08,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:50:08,924 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:50:08,924 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:50:08,924 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:50:08,924 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-17 22:50:08,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:50:08,924 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:50:08,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:50:08,930 INFO L201 PluginConnector]: Adding new model indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:50:08 BoogieIcfgContainer [2025-02-17 22:50:08,930 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:50:08,930 INFO L158 Benchmark]: Toolchain (without parser) took 56061.75ms. Allocated memory was 159.4MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 85.2MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 5.0GB. Max. memory is 8.0GB. [2025-02-17 22:50:08,931 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.26ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 86.1MB in the end (delta: 107.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:50:08,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.50ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 83.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:50:08,931 INFO L158 Benchmark]: Boogie Preprocessor took 16.94ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 83.2MB in the end (delta: 692.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:50:08,931 INFO L158 Benchmark]: RCFGBuilder took 205.94ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 73.9MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:50:08,931 INFO L158 Benchmark]: BuchiAutomizer took 55818.50ms. Allocated memory was 159.4MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 73.8MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 5.0GB. Max. memory is 8.0GB. [2025-02-17 22:50:08,932 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.26ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 86.1MB in the end (delta: 107.9kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.50ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 83.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 16.94ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 83.2MB in the end (delta: 692.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 205.94ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 73.9MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 55818.50ms. Allocated memory was 159.4MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 73.8MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 5.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x6 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 55.6s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.4s. Büchi inclusion checks took 12.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 11.9s AutomataMinimizationTime, 5 MinimizatonAttempts, 34478 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 22.6s Buchi closure took 0.6s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 403 mSDsluCounter, 376 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 191 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 550 IncrementalHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 185 mSDtfsCounter, 550 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 48ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 2.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 2358, Trivial Ample Sets caused by loops: 18016, Number of non-trivial ample sets: 19420, Number of pruned transitions: 2534, Number of transitions in reduction automaton: 37517, Number of states in reduction automaton: 6827, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:50:08,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...