/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/3_thr/m5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:49:03,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:49:03,893 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:03,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:49:03,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:49:03,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:49:03,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:49:03,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:49:03,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:49:03,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:49:03,910 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:49:03,910 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:49:03,910 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:49:03,910 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:49:03,910 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:49:03,910 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:49:03,910 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:49:03,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:49:03,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:49:03,910 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:49:03,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:49:03,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:49:03,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:49:03,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:49:03,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:49:03,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:49:03,911 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:49:03,911 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:49:03,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:49:03,911 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:49:03,911 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:49:03,911 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:49:03,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:49:03,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:49:03,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:49:03,911 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:49:03,911 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:04,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:49:04,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:49:04,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:49:04,122 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:49:04,123 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:49:04,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/m5.c.bpl [2025-02-17 22:49:04,125 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/m5.c.bpl' [2025-02-17 22:49:04,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:49:04,140 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:49:04,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:04,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:49:04,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:49:04,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,163 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:49:04,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:04,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:49:04,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:49:04,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:49:04,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,174 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:49:04,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:49:04,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:49:04,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:49:04,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:04,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:04,210 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:04,213 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:04,233 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:49:04,233 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:49:04,233 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:49:04,233 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:49:04,234 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:49:04,234 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:49:04,234 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:49:04,234 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:49:04,234 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:49:04,234 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:49:04,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:49:04,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:49:04,235 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:04,269 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:49:04,270 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:49:04,334 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:49:04,334 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:49:04,344 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:49:04,345 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:49:04,345 INFO L201 PluginConnector]: Adding new model m5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:04 BoogieIcfgContainer [2025-02-17 22:49:04,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:49:04,349 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:49:04,349 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:49:04,353 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:49:04,354 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:04,354 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/2) ... [2025-02-17 22:49:04,355 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d18bf57 and model type m5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:49:04, skipping insertion in model container [2025-02-17 22:49:04,355 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:04,356 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:04" (2/2) ... [2025-02-17 22:49:04,356 INFO L363 chiAutomizerObserver]: Analyzing ICFG m5.c.bpl [2025-02-17 22:49:04,415 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-17 22:49:04,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 77 flow [2025-02-17 22:49:04,484 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-02-17 22:49:04,486 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-17 22:49:04,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-02-17 22:49:04,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 28 transitions, 77 flow [2025-02-17 22:49:04,495 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2025-02-17 22:49:04,500 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:49:04,747 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:49:04,747 INFO L101 AmpleReduction]: Number of pruned transitions: 102, Number of non-trivial ample sets: 151 [2025-02-17 22:49:04,747 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 115 [2025-02-17 22:49:04,756 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:49:04,756 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:49:04,756 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:49:04,756 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:49:04,756 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:49:04,756 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:49:04,756 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:49:04,756 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:49:04,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 145 states, 144 states have (on average 2.2083333333333335) internal successors, (318), 144 states have internal predecessors, (318), 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:04,777 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 88 [2025-02-17 22:49:04,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:04,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:04,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:49:04,782 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:04,782 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:49:04,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 145 states, 144 states have (on average 2.2083333333333335) internal successors, (318), 144 states have internal predecessors, (318), 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:04,786 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 88 [2025-02-17 22:49:04,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:04,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:04,787 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:49:04,787 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:04,793 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L12: Formula: (= v_f_4 0) InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[70] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:49:04,793 INFO L754 eck$LassoCheckResult]: Loop: "[55] L23-->L25: 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[]" "[57] L25-->L23: 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:04,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:04,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2457, now seen corresponding path program 1 times [2025-02-17 22:49:04,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:04,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962260910] [2025-02-17 22:49:04,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:04,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:04,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:04,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:04,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:04,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:04,848 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:04,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:04,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:04,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:04,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:04,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:04,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:04,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 1 times [2025-02-17 22:49:04,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:04,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137523604] [2025-02-17 22:49:04,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:04,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:04,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:04,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:04,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:04,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:04,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:04,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:04,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:04,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:04,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:04,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:04,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:04,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2362939, now seen corresponding path program 1 times [2025-02-17 22:49:04,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:04,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749842401] [2025-02-17 22:49:04,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:04,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:04,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:04,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:04,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:04,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:04,893 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:04,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:04,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:04,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:04,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:04,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:04,938 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:04,938 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:04,938 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:04,938 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:04,939 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:04,939 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:04,939 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:04,939 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:04,939 INFO L132 ssoRankerPreferences]: Filename of dumped script: m5.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:04,939 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:04,939 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:04,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:04,984 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:04,984 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:04,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:04,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:04,989 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:04,991 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:04,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:04,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:05,014 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:05,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:05,016 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:05,018 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:05,019 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:05,019 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:05,092 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:05,097 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:05,097 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:05,097 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:05,097 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:05,097 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:05,097 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:05,097 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,097 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:05,097 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:05,097 INFO L132 ssoRankerPreferences]: Filename of dumped script: m5.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:05,097 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:05,097 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:05,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:05,123 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:05,126 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:05,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:05,129 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:05,130 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:05,132 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:05,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:05,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:05,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:05,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:05,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:05,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:05,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:05,154 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:05,161 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:05,161 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:05,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:05,165 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:05,168 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:05,169 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:05,169 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:05,170 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:05,170 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:49:05,176 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:05,179 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:05,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:05,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:05,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:05,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:05,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:05,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:05,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:05,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:05,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:05,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:05,259 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:05,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:05,286 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:05,330 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:05,335 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 145 states, 144 states have (on average 2.2083333333333335) internal successors, (318), 144 states have internal predecessors, (318), 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.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:05,436 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 145 states, 144 states have (on average 2.2083333333333335) internal successors, (318), 144 states have internal predecessors, (318), 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.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 492 states and 1156 transitions. Complement of second has 7 states. [2025-02-17 22:49:05,437 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:05,440 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:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-02-17 22:49:05,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:49:05,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:05,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:05,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:05,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:49:05,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:05,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 492 states and 1156 transitions. [2025-02-17 22:49:05,460 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 124 [2025-02-17 22:49:05,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 492 states to 327 states and 801 transitions. [2025-02-17 22:49:05,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2025-02-17 22:49:05,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 266 [2025-02-17 22:49:05,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 327 states and 801 transitions. [2025-02-17 22:49:05,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:05,470 INFO L218 hiAutomatonCegarLoop]: Abstraction has 327 states and 801 transitions. [2025-02-17 22:49:05,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states and 801 transitions. [2025-02-17 22:49:05,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 217. [2025-02-17 22:49:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 217 states have (on average 2.608294930875576) internal successors, (566), 216 states have internal predecessors, (566), 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:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 566 transitions. [2025-02-17 22:49:05,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 217 states and 566 transitions. [2025-02-17 22:49:05,502 INFO L432 stractBuchiCegarLoop]: Abstraction has 217 states and 566 transitions. [2025-02-17 22:49:05,502 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:49:05,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 566 transitions. [2025-02-17 22:49:05,506 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 98 [2025-02-17 22:49:05,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:05,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:05,506 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:49:05,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:05,507 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L12: Formula: (= v_f_4 0) InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[70] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[55] L23-->L25: 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[]" "[73] L12-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[76] L13-->L43: 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:05,507 INFO L754 eck$LassoCheckResult]: Loop: "[65] L43-->L45: Formula: (< v_x2_1 v_w_1) InVars {x2=v_x2_1, w=v_w_1} OutVars{x2=v_x2_1, w=v_w_1} AuxVars[] AssignedVars[]" "[67] L45-->L43: 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:05,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:05,508 INFO L85 PathProgramCache]: Analyzing trace with hash 73251681, now seen corresponding path program 1 times [2025-02-17 22:49:05,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:05,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151567732] [2025-02-17 22:49:05,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:05,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:05,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:05,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:05,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,514 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:05,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:05,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:05,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:05,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:05,523 INFO L85 PathProgramCache]: Analyzing trace with hash 3043, now seen corresponding path program 1 times [2025-02-17 22:49:05,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:05,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970969179] [2025-02-17 22:49:05,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:05,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:05,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:05,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:05,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:05,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:05,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:05,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:05,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:05,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1675390787, now seen corresponding path program 1 times [2025-02-17 22:49:05,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:05,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534282860] [2025-02-17 22:49:05,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:05,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:05,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:05,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:05,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:05,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:05,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:05,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:05,563 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:05,563 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:05,563 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:05,563 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:05,563 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:05,563 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,563 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:05,563 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:05,563 INFO L132 ssoRankerPreferences]: Filename of dumped script: m5.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:05,563 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:05,563 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:05,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:05,582 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:05,582 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:05,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:05,586 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:05,588 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:05,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:05,589 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:05,607 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:05,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:05,609 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:05,610 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:05,611 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:05,611 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:05,681 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:05,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-17 22:49:05,685 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:05,685 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:05,686 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:05,686 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:05,686 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:05,686 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,686 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:05,686 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:05,686 INFO L132 ssoRankerPreferences]: Filename of dumped script: m5.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:05,686 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:05,686 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:05,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:05,703 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:05,703 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:05,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:05,705 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:05,705 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:05,706 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:05,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:05,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:05,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:05,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:05,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:05,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:05,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:05,719 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:05,721 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:05,721 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:05,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:05,723 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:05,724 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:05,724 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:05,725 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:05,725 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:05,725 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x2) = 1*w - 1*x2 Supporting invariants [] [2025-02-17 22:49:05,730 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:05,731 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:05,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:05,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:05,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:05,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:05,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:05,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:05,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:05,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:05,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:05,757 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:05,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:05,769 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:05,770 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:05,770 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 217 states and 566 transitions. cyclomatic complexity: 402 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:05,815 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 217 states and 566 transitions. cyclomatic complexity: 402. 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 545 states and 1572 transitions. Complement of second has 6 states. [2025-02-17 22:49:05,816 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:05,816 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:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-02-17 22:49:05,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:05,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:05,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-17 22:49:05,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:05,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-17 22:49:05,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:05,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 545 states and 1572 transitions. [2025-02-17 22:49:05,822 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 63 [2025-02-17 22:49:05,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 545 states to 334 states and 970 transitions. [2025-02-17 22:49:05,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2025-02-17 22:49:05,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 204 [2025-02-17 22:49:05,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 334 states and 970 transitions. [2025-02-17 22:49:05,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:05,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 334 states and 970 transitions. [2025-02-17 22:49:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states and 970 transitions. [2025-02-17 22:49:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 278. [2025-02-17 22:49:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 278 states have (on average 3.014388489208633) internal successors, (838), 277 states have internal predecessors, (838), 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:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 838 transitions. [2025-02-17 22:49:05,843 INFO L240 hiAutomatonCegarLoop]: Abstraction has 278 states and 838 transitions. [2025-02-17 22:49:05,843 INFO L432 stractBuchiCegarLoop]: Abstraction has 278 states and 838 transitions. [2025-02-17 22:49:05,843 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:49:05,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 278 states and 838 transitions. [2025-02-17 22:49:05,845 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 63 [2025-02-17 22:49:05,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:05,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:05,845 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-17 22:49:05,845 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:05,846 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L12: Formula: (= v_f_4 0) InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[70] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[73] L12-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[54] L23-->L27: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[56] L27-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[59] $Ultimate##0-->L34-1: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-02-17 22:49:05,846 INFO L754 eck$LassoCheckResult]: Loop: "[61] L34-1-->L36: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[63] L36-->L34-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-02-17 22:49:05,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:05,846 INFO L85 PathProgramCache]: Analyzing trace with hash -2023647767, now seen corresponding path program 1 times [2025-02-17 22:49:05,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:05,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591896231] [2025-02-17 22:49:05,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:05,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:05,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:05,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:05,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,850 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:05,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:05,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:05,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:05,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2915, now seen corresponding path program 1 times [2025-02-17 22:49:05,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:05,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388413252] [2025-02-17 22:49:05,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:05,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:05,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:05,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,862 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:05,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:05,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:05,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:05,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:05,865 INFO L85 PathProgramCache]: Analyzing trace with hash 894682955, now seen corresponding path program 1 times [2025-02-17 22:49:05,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:05,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800323894] [2025-02-17 22:49:05,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:05,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:05,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:05,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:05,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,869 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:05,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:05,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:05,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:05,885 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:05,885 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:05,885 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:05,885 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:05,885 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:05,885 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,885 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:05,885 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:05,885 INFO L132 ssoRankerPreferences]: Filename of dumped script: m5.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:05,885 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:05,885 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:05,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:05,901 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:05,901 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:05,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:05,903 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:05,904 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:05,905 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:05,906 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:05,922 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:05,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:05,925 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:05,926 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:05,927 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:05,928 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:06,000 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:06,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-17 22:49:06,005 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:06,005 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:06,005 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:06,005 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:06,005 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:06,005 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,005 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:06,005 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:06,005 INFO L132 ssoRankerPreferences]: Filename of dumped script: m5.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:06,005 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:06,005 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:06,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,022 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:06,022 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:06,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,024 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:06,027 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:06,028 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:06,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:06,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:06,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:06,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:06,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:06,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:06,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:06,043 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:06,047 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:06,048 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:06,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,050 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:06,052 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:06,053 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:06,053 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:06,053 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:06,053 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, y) = 1*x1 - 1*y Supporting invariants [] [2025-02-17 22:49:06,059 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:06,059 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:06,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:06,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:06,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:06,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:06,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:06,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:06,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:06,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:06,091 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:06,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:06,104 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:06,104 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:06,104 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 278 states and 838 transitions. cyclomatic complexity: 614 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:06,155 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 278 states and 838 transitions. cyclomatic complexity: 614. 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 917 states and 2793 transitions. Complement of second has 7 states. [2025-02-17 22:49:06,156 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:06,157 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:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2025-02-17 22:49:06,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:49:06,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:49:06,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 6 letters. Loop has 4 letters. [2025-02-17 22:49:06,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 917 states and 2793 transitions. [2025-02-17 22:49:06,165 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 63 [2025-02-17 22:49:06,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 917 states to 527 states and 1575 transitions. [2025-02-17 22:49:06,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 204 [2025-02-17 22:49:06,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2025-02-17 22:49:06,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 527 states and 1575 transitions. [2025-02-17 22:49:06,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:06,172 INFO L218 hiAutomatonCegarLoop]: Abstraction has 527 states and 1575 transitions. [2025-02-17 22:49:06,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states and 1575 transitions. [2025-02-17 22:49:06,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 362. [2025-02-17 22:49:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 362 states have (on average 3.0828729281767955) internal successors, (1116), 361 states have internal predecessors, (1116), 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:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 1116 transitions. [2025-02-17 22:49:06,191 INFO L240 hiAutomatonCegarLoop]: Abstraction has 362 states and 1116 transitions. [2025-02-17 22:49:06,191 INFO L432 stractBuchiCegarLoop]: Abstraction has 362 states and 1116 transitions. [2025-02-17 22:49:06,191 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:49:06,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 362 states and 1116 transitions. [2025-02-17 22:49:06,193 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 63 [2025-02-17 22:49:06,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:06,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:06,193 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:06,193 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:06,194 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L12: Formula: (= v_f_4 0) InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[70] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[73] L12-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[59] $Ultimate##0-->L34-1: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[61] L34-1-->L36: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[63] L36-->L34-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" "[60] L34-1-->thread2FINAL: Formula: (<= v_x1_8 v_y_2) InVars {y=v_y_2, x1=v_x1_8} OutVars{y=v_y_2, x1=v_x1_8} AuxVars[] AssignedVars[]" [2025-02-17 22:49:06,194 INFO L754 eck$LassoCheckResult]: Loop: "[55] L23-->L25: 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[]" "[57] L25-->L23: 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:06,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1691582607, now seen corresponding path program 1 times [2025-02-17 22:49:06,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:06,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805632540] [2025-02-17 22:49:06,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:06,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:06,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:06,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:06,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-17 22:49:06,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:49:06,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805632540] [2025-02-17 22:49:06,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805632540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:49:06,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:49:06,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:49:06,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475651629] [2025-02-17 22:49:06,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:49:06,241 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:49:06,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 2 times [2025-02-17 22:49:06,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:06,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654174452] [2025-02-17 22:49:06,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:49:06,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:06,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:06,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:06,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:49:06,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,249 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:06,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:06,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:06,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:06,272 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:06,272 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:06,273 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:06,273 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:06,273 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:06,273 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,273 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:06,273 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:06,273 INFO L132 ssoRankerPreferences]: Filename of dumped script: m5.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:06,273 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:06,273 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:06,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,293 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:06,293 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:06,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,296 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:06,298 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:06,299 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:06,299 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:06,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-17 22:49:06,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,317 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:06,318 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:06,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:06,319 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:06,384 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:06,388 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:06,389 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:06,389 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:06,389 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:06,389 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:06,389 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:06,389 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,389 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:06,389 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:06,389 INFO L132 ssoRankerPreferences]: Filename of dumped script: m5.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:06,389 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:06,389 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:06,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,405 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:06,405 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:06,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,408 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:06,409 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:06,410 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:06,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:06,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:06,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:06,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:06,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:06,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:06,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:06,422 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:06,426 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:06,426 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:06,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,428 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:06,429 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:06,430 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:06,430 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:06,431 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:06,431 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-02-17 22:49:06,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:06,437 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:06,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:06,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:06,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:06,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:06,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:06,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:06,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:06,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:06,485 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:06,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:06,500 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:06,501 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:49:06,501 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 362 states and 1116 transitions. cyclomatic complexity: 823 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:06,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-17 22:49:06,549 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:06,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-17 22:49:06,557 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 362 states and 1116 transitions. cyclomatic complexity: 823. 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 510 states and 1531 transitions. Complement of second has 6 states. [2025-02-17 22:49:06,557 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:06,558 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:49:06,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-02-17 22:49:06,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-17 22:49:06,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 2 letters. [2025-02-17 22:49:06,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 7 letters. Loop has 4 letters. [2025-02-17 22:49:06,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 510 states and 1531 transitions. [2025-02-17 22:49:06,563 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 43 [2025-02-17 22:49:06,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 510 states to 328 states and 971 transitions. [2025-02-17 22:49:06,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2025-02-17 22:49:06,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2025-02-17 22:49:06,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 328 states and 971 transitions. [2025-02-17 22:49:06,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:06,566 INFO L218 hiAutomatonCegarLoop]: Abstraction has 328 states and 971 transitions. [2025-02-17 22:49:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states and 971 transitions. [2025-02-17 22:49:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-02-17 22:49:06,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 328 states have (on average 2.9603658536585367) internal successors, (971), 327 states have internal predecessors, (971), 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:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 971 transitions. [2025-02-17 22:49:06,573 INFO L240 hiAutomatonCegarLoop]: Abstraction has 328 states and 971 transitions. [2025-02-17 22:49:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:49:06,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:49:06,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:49:06,575 INFO L87 Difference]: Start difference. First operand 328 states and 971 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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:06,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:49:06,580 INFO L93 Difference]: Finished difference Result 41 states and 76 transitions. [2025-02-17 22:49:06,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 76 transitions. [2025-02-17 22:49:06,581 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:06,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2025-02-17 22:49:06,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:06,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:06,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:06,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:06,581 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:06,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:06,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:49:06,582 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:06,582 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:49:06,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:49:06,582 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:06,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:49:06,587 INFO L201 PluginConnector]: Adding new model m5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:49:06 BoogieIcfgContainer [2025-02-17 22:49:06,587 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:49:06,587 INFO L158 Benchmark]: Toolchain (without parser) took 2447.33ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 85.8MB in the beginning and 97.9MB in the end (delta: -12.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:06,587 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:06,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.61ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 84.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:06,588 INFO L158 Benchmark]: Boogie Preprocessor took 11.06ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 83.9MB in the end (delta: 692.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:06,588 INFO L158 Benchmark]: RCFGBuilder took 165.48ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 75.3MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:49:06,588 INFO L158 Benchmark]: BuchiAutomizer took 2237.86ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 75.2MB in the beginning and 97.9MB in the end (delta: -22.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:06,589 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.20ms. Allocated memory is still 159.4MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.61ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 84.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 11.06ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 83.9MB in the end (delta: 692.6kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 165.48ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 75.3MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2237.86ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 75.2MB in the beginning and 97.9MB in the end (delta: -22.7MB). There was no memory consumed. 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 5 terminating modules (1 trivial, 4 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 w + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * y and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 331 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 184 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 112 IncrementalHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 98 mSDtfsCounter, 112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 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: 43ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 298, Trivial Ample Sets caused by loops: 115, Number of non-trivial ample sets: 151, Number of pruned transitions: 102, Number of transitions in reduction automaton: 318, Number of states in reduction automaton: 145, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:49:06,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...