/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf --buchiautomizer.automaton.type.for.concurrent.programs PARTIAL_ORDER_BA -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/me1.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:51:51,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:51:51,549 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:51:51,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:51:51,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:51:51,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:51:51,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:51:51,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:51:51,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:51:51,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:51:51,584 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:51:51,584 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:51:51,584 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:51:51,585 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:51:51,585 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:51:51,585 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:51:51,585 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:51:51,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:51:51,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:51:51,585 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:51:51,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:51:51,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:51:51,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:51:51,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:51:51,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:51:51,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:51:51,585 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:51:51,585 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:51:51,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:51:51,586 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:51:51,586 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:51:51,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:51:51,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:51:51,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:51:51,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:51:51,586 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:51:51,586 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:51:51,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:51:51,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:51:51,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:51:51,804 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:51:51,805 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:51:51,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/me1.c.bpl [2025-02-17 22:51:51,806 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/me1.c.bpl' [2025-02-17 22:51:51,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:51:51,821 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:51:51,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:51:51,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:51:51,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:51:51,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:51" (1/1) ... [2025-02-17 22:51:51,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:51" (1/1) ... [2025-02-17 22:51:51,836 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:51:51,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:51:51,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:51:51,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:51:51,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:51:51,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:51" (1/1) ... [2025-02-17 22:51:51,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:51" (1/1) ... [2025-02-17 22:51:51,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:51" (1/1) ... [2025-02-17 22:51:51,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:51" (1/1) ... [2025-02-17 22:51:51,845 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:51" (1/1) ... [2025-02-17 22:51:51,845 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:51" (1/1) ... [2025-02-17 22:51:51,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:51" (1/1) ... [2025-02-17 22:51:51,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:51" (1/1) ... [2025-02-17 22:51:51,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:51" (1/1) ... [2025-02-17 22:51:51,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:51:51,852 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:51:51,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:51:51,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:51:51,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:51" (1/1) ... [2025-02-17 22:51:51,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:51,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:51,884 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:51:51,886 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:51:51,909 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:51:51,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:51:51,909 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:51:51,909 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:51:51,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:51:51,909 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:51:51,909 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:51:51,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:51:51,909 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:51:51,910 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:51:51,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:51:51,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:51:51,910 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-02-17 22:51:51,910 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-17 22:51:51,910 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-17 22:51:51,910 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:51:51,946 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:51:51,948 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:51:52,019 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:51:52,019 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:51:52,032 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:51:52,033 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:51:52,033 INFO L201 PluginConnector]: Adding new model me1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:51:52 BoogieIcfgContainer [2025-02-17 22:51:52,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:51:52,035 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:51:52,036 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:51:52,040 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:51:52,040 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:51:52,041 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:51" (1/2) ... [2025-02-17 22:51:52,042 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20b3c417 and model type me1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:51:52, skipping insertion in model container [2025-02-17 22:51:52,042 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:51:52,042 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:51:52" (2/2) ... [2025-02-17 22:51:52,044 INFO L363 chiAutomizerObserver]: Analyzing ICFG me1.c.bpl [2025-02-17 22:51:52,120 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-17 22:51:52,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 38 transitions, 104 flow [2025-02-17 22:51:52,192 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-02-17 22:51:52,195 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-17 22:51:52,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 30 events. 4/30 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 67 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-02-17 22:51:52,201 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 38 transitions, 104 flow [2025-02-17 22:51:52,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 30 transitions, 84 flow [2025-02-17 22:51:52,211 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:51:52,829 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:51:52,830 INFO L101 AmpleReduction]: Number of pruned transitions: 1123, Number of non-trivial ample sets: 1178 [2025-02-17 22:51:52,830 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 806 [2025-02-17 22:51:52,838 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:51:52,838 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:51:52,838 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:51:52,838 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:51:52,838 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:51:52,838 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:51:52,838 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:51:52,839 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:51:52,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 807 states, 806 states have (on average 2.5818858560794045) internal successors, (2081), 806 states have internal predecessors, (2081), 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:51:52,907 INFO L131 ngComponentsAnalysis]: Automaton has 143 accepting balls. 460 [2025-02-17 22:51:52,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:51:52,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:51:52,914 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:51:52,914 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:51:52,914 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:51:52,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 807 states, 806 states have (on average 2.5818858560794045) internal successors, (2081), 806 states have internal predecessors, (2081), 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:51:52,935 INFO L131 ngComponentsAnalysis]: Automaton has 143 accepting balls. 460 [2025-02-17 22:51:52,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:51:52,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:51:52,935 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:51:52,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:51:52,940 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:51:52,940 INFO L754 eck$LassoCheckResult]: Loop: "[75] L27-->L29: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[77] L29-->L27: 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:51:52,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:52,944 INFO L85 PathProgramCache]: Analyzing trace with hash 3165, now seen corresponding path program 1 times [2025-02-17 22:51:52,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:52,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391936919] [2025-02-17 22:51:52,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:52,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:52,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:52,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:52,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:52,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:52,999 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:53,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:53,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:53,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:53,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:53,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:53,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:53,021 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2025-02-17 22:51:53,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:53,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095374722] [2025-02-17 22:51:53,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:53,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:53,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:53,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:53,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:53,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:53,047 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:53,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:53,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:53,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:53,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:53,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:53,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:53,063 INFO L85 PathProgramCache]: Analyzing trace with hash 3043967, now seen corresponding path program 1 times [2025-02-17 22:51:53,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:53,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985090252] [2025-02-17 22:51:53,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:53,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:53,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:51:53,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:51:53,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:53,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:53,072 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:53,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:51:53,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:51:53,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:53,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:53,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:53,136 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:53,137 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:53,137 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:53,137 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:53,138 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:51:53,138 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:53,138 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:53,138 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:53,138 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:51:53,138 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:53,138 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:53,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:53,172 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:53,173 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:51:53,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:53,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:53,176 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:51:53,178 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:51:53,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:51:53,180 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:53,201 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:51:53,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:53,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:53,204 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:51:53,206 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:51:53,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:51:53,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:53,287 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:51:53,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:53,292 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:53,292 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:53,292 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:53,292 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:53,292 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:51:53,293 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:53,293 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:53,293 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:53,293 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:51:53,293 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:53,293 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:53,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:53,320 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:53,323 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:51:53,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:53,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:53,328 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:51:53,329 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:51:53,330 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:51:53,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:51:53,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:51:53,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:51:53,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:51:53,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:51:53,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:51:53,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:51:53,351 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:51:53,356 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:51:53,356 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:51:53,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:53,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:53,360 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:51:53,363 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:51:53,364 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:51:53,365 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:51:53,365 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:51:53,365 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-02-17 22:51:53,373 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:51:53,376 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:51:53,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:53,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:53,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:53,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:53,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:53,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:51:53,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:53,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:53,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:53,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:53,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:53,426 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:51:53,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:53,452 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:51:53,472 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:51:53,476 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 807 states, 806 states have (on average 2.5818858560794045) internal successors, (2081), 806 states have internal predecessors, (2081), 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:51:53,640 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 807 states, 806 states have (on average 2.5818858560794045) internal successors, (2081), 806 states have internal predecessors, (2081), 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 2776 states and 7884 transitions. Complement of second has 7 states. [2025-02-17 22:51:53,641 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:51:53,644 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:51:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-02-17 22:51:53,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:51:53,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:53,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:51:53,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:53,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:51:53,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:53,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2776 states and 7884 transitions. [2025-02-17 22:51:53,694 INFO L131 ngComponentsAnalysis]: Automaton has 260 accepting balls. 707 [2025-02-17 22:51:53,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2776 states to 2087 states and 6218 transitions. [2025-02-17 22:51:53,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1349 [2025-02-17 22:51:53,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1698 [2025-02-17 22:51:53,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2087 states and 6218 transitions. [2025-02-17 22:51:53,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:51:53,745 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2087 states and 6218 transitions. [2025-02-17 22:51:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states and 6218 transitions. [2025-02-17 22:51:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1362. [2025-02-17 22:51:53,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1362 states have (on average 3.2202643171806167) internal successors, (4386), 1361 states have internal predecessors, (4386), 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:51:53,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 4386 transitions. [2025-02-17 22:51:53,852 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1362 states and 4386 transitions. [2025-02-17 22:51:53,852 INFO L432 stractBuchiCegarLoop]: Abstraction has 1362 states and 4386 transitions. [2025-02-17 22:51:53,852 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:51:53,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1362 states and 4386 transitions. [2025-02-17 22:51:53,861 INFO L131 ngComponentsAnalysis]: Automaton has 202 accepting balls. 580 [2025-02-17 22:51:53,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:51:53,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:51:53,861 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:51:53,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:51:53,862 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-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]" "[102] L15-->L47: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-02-17 22:51:53,862 INFO L754 eck$LassoCheckResult]: Loop: "[85] L47-->L49: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[87] L49-->L47: 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:51:53,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:53,862 INFO L85 PathProgramCache]: Analyzing trace with hash 3044736, now seen corresponding path program 1 times [2025-02-17 22:51:53,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:53,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516120917] [2025-02-17 22:51:53,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:53,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:53,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:51:53,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:51:53,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:53,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:53,866 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:53,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:51:53,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:51:53,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:53,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:53,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:53,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:53,873 INFO L85 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2025-02-17 22:51:53,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:53,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525039795] [2025-02-17 22:51:53,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:53,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:53,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:53,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:53,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:53,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:53,878 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:53,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:53,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:53,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:53,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:53,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:53,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1368973278, now seen corresponding path program 1 times [2025-02-17 22:51:53,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:53,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701837052] [2025-02-17 22:51:53,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:53,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:53,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:51:53,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:51:53,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:53,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:53,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:53,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:51:53,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:51:53,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:53,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:53,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:53,934 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:51:53,935 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:53,935 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:53,935 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:53,935 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:53,935 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:51:53,935 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:53,935 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:53,935 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:53,935 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:51:53,935 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:53,935 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:53,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:53,953 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:53,953 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:51:53,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:53,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:53,955 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:51:53,957 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:51:53,958 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:51:53,958 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:53,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-17 22:51:53,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:53,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:53,977 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:51:53,979 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:51:53,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:51:53,981 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:54,050 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:51:54,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:54,057 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:54,057 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:54,057 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:54,057 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:54,057 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:51:54,057 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:54,057 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:54,057 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:54,057 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:51:54,057 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:54,057 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:54,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:54,080 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:54,081 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:51:54,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:54,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:54,083 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:51:54,085 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:51:54,086 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:51:54,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:51:54,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:51:54,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:51:54,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:51:54,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:51:54,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:51:54,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:51:54,100 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:51:54,105 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:51:54,105 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:51:54,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:54,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:54,108 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:51:54,113 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:51:54,113 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:51:54,113 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:51:54,114 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-02-17 22:51:54,118 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:51:54,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:54,121 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:51:54,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:54,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:51:54,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:51:54,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:54,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:54,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:51:54,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:54,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:54,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:54,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:54,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:54,154 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:51:54,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:51:54,168 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:51:54,168 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1362 states and 4386 transitions. cyclomatic complexity: 3283 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:51:54,268 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1362 states and 4386 transitions. cyclomatic complexity: 3283. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 4595 states and 15829 transitions. Complement of second has 7 states. [2025-02-17 22:51:54,268 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:51:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:51:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-02-17 22:51:54,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:51:54,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:54,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:51:54,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:54,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-17 22:51:54,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:54,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4595 states and 15829 transitions. [2025-02-17 22:51:54,319 INFO L131 ngComponentsAnalysis]: Automaton has 304 accepting balls. 788 [2025-02-17 22:51:54,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4595 states to 3494 states and 12425 transitions. [2025-02-17 22:51:54,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1744 [2025-02-17 22:51:54,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2181 [2025-02-17 22:51:54,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3494 states and 12425 transitions. [2025-02-17 22:51:54,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:51:54,365 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3494 states and 12425 transitions. [2025-02-17 22:51:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states and 12425 transitions. [2025-02-17 22:51:54,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:54,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 2599. [2025-02-17 22:51:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2599 states, 2599 states have (on average 3.7599076567910736) internal successors, (9772), 2598 states have internal predecessors, (9772), 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:51:54,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2599 states and 9772 transitions. [2025-02-17 22:51:54,483 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2599 states and 9772 transitions. [2025-02-17 22:51:54,483 INFO L432 stractBuchiCegarLoop]: Abstraction has 2599 states and 9772 transitions. [2025-02-17 22:51:54,483 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:51:54,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2599 states and 9772 transitions. [2025-02-17 22:51:54,498 INFO L131 ngComponentsAnalysis]: Automaton has 239 accepting balls. 648 [2025-02-17 22:51:54,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:51:54,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:51:54,499 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-17 22:51:54,499 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:51:54,499 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-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]" "[74] L27-->L31: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[76] L31-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[79] $Ultimate##0-->L38-1: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-02-17 22:51:54,500 INFO L754 eck$LassoCheckResult]: Loop: "[81] L38-1-->L40: Formula: (< v_y1_1 v_x1_5) InVars {y1=v_y1_1, x1=v_x1_5} OutVars{y1=v_y1_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[83] L40-->L38-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:51:54,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:54,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1369000473, now seen corresponding path program 1 times [2025-02-17 22:51:54,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:54,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608485725] [2025-02-17 22:51:54,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:54,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:54,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:51:54,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:51:54,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:54,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:54,505 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:54,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:51:54,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:51:54,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:54,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:54,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:54,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:54,511 INFO L85 PathProgramCache]: Analyzing trace with hash 3555, now seen corresponding path program 1 times [2025-02-17 22:51:54,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:54,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097548189] [2025-02-17 22:51:54,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:54,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:54,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:54,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:54,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:54,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:54,514 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:54,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:54,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:54,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:54,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:54,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:54,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:54,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1349459383, now seen corresponding path program 1 times [2025-02-17 22:51:54,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:54,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997492737] [2025-02-17 22:51:54,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:54,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:54,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:51:54,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:51:54,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:54,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:54,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:54,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:51:54,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:51:54,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:54,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:54,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:54,554 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:54,554 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:54,554 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:54,554 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:54,554 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:51:54,554 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:54,554 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:54,554 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:54,554 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:51:54,555 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:54,555 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:54,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:54,570 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:54,570 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:51:54,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:54,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:54,572 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:51:54,574 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:51:54,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:51:54,575 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:54,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-17 22:51:54,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:54,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:54,594 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:51:54,596 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:51:54,597 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:51:54,597 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:54,673 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:51:54,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:54,678 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:54,678 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:54,678 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:54,678 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:54,678 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:51:54,678 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:54,679 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:54,679 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:54,679 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:51:54,679 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:54,679 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:54,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:54,697 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:54,697 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:51:54,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:54,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:54,701 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:51:54,702 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:51:54,703 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:51:54,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:51:54,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:51:54,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:51:54,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:51:54,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:51:54,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:51:54,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:51:54,717 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:51:54,720 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:51:54,720 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:51:54,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:54,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:54,722 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:51:54,724 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:51:54,725 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:51:54,725 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:51:54,725 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:51:54,725 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, y1) = 1*x1 - 1*y1 Supporting invariants [] [2025-02-17 22:51:54,731 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:51:54,732 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:51:54,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:54,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:51:54,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:51:54,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:54,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:54,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:51:54,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:54,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:54,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:54,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:54,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:54,764 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:51:54,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:54,776 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:51:54,777 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:51:54,777 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2599 states and 9772 transitions. cyclomatic complexity: 7624 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:51:54,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-17 22:51:54,954 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2599 states and 9772 transitions. cyclomatic complexity: 7624. 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 8608 states and 32358 transitions. Complement of second has 7 states. [2025-02-17 22:51:54,955 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:51:54,955 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:51:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-02-17 22:51:54,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:51:54,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:54,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:51:54,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:54,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 6 letters. Loop has 4 letters. [2025-02-17 22:51:54,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:54,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8608 states and 32358 transitions. [2025-02-17 22:51:55,082 INFO L131 ngComponentsAnalysis]: Automaton has 370 accepting balls. 953 [2025-02-17 22:51:55,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8608 states to 6576 states and 24839 transitions. [2025-02-17 22:51:55,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2025-02-17 22:51:55,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3170 [2025-02-17 22:51:55,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6576 states and 24839 transitions. [2025-02-17 22:51:55,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:51:55,166 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6576 states and 24839 transitions. [2025-02-17 22:51:55,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6576 states and 24839 transitions. [2025-02-17 22:51:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6576 to 4298. [2025-02-17 22:51:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4298 states, 4298 states have (on average 3.947417403443462) internal successors, (16966), 4297 states have internal predecessors, (16966), 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:51:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4298 states to 4298 states and 16966 transitions. [2025-02-17 22:51:55,328 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4298 states and 16966 transitions. [2025-02-17 22:51:55,328 INFO L432 stractBuchiCegarLoop]: Abstraction has 4298 states and 16966 transitions. [2025-02-17 22:51:55,328 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:51:55,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4298 states and 16966 transitions. [2025-02-17 22:51:55,351 INFO L131 ngComponentsAnalysis]: Automaton has 300 accepting balls. 795 [2025-02-17 22:51:55,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:51:55,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:51:55,351 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:51:55,351 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:51:55,352 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-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]" "[79] $Ultimate##0-->L38-1: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[81] L38-1-->L40: Formula: (< v_y1_1 v_x1_5) InVars {y1=v_y1_1, x1=v_x1_5} OutVars{y1=v_y1_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[83] L40-->L38-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" "[80] L38-1-->thread2FINAL: Formula: (<= v_x1_8 v_y1_2) InVars {y1=v_y1_2, x1=v_x1_8} OutVars{y1=v_y1_2, x1=v_x1_8} AuxVars[] AssignedVars[]" [2025-02-17 22:51:55,352 INFO L754 eck$LassoCheckResult]: Loop: "[75] L27-->L29: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[77] L29-->L27: 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:51:55,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:55,352 INFO L85 PathProgramCache]: Analyzing trace with hash 510812261, now seen corresponding path program 1 times [2025-02-17 22:51:55,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:55,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094904027] [2025-02-17 22:51:55,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:55,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:55,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:51:55,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:51:55,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:55,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:55,396 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:51:55,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:51:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094904027] [2025-02-17 22:51:55,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094904027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:51:55,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:51:55,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:51:55,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915084790] [2025-02-17 22:51:55,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:51:55,402 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:51:55,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:55,402 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 2 times [2025-02-17 22:51:55,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:55,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002526886] [2025-02-17 22:51:55,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:51:55,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:55,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:55,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:55,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:51:55,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:55,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:55,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:55,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:55,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:55,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:55,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:55,431 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:55,431 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:55,432 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:55,432 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:55,432 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:51:55,432 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:55,432 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:55,432 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:55,432 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:51:55,432 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:55,432 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:55,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:55,449 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:55,449 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:51:55,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:55,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:55,451 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:51:55,453 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:51:55,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:51:55,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:55,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:55,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:55,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:55,473 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:51:55,475 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:51:55,476 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:51:55,476 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:55,547 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:51:55,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:55,552 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:55,552 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:55,552 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:55,552 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:55,552 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:51:55,552 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:55,552 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:55,552 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:55,552 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:51:55,552 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:55,552 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:55,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:55,571 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:55,571 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:51:55,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:55,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:55,573 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:51:55,575 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:51:55,576 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:51:55,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:51:55,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:51:55,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:51:55,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:51:55,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:51:55,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:51:55,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:51:55,590 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:51:55,596 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:51:55,596 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:51:55,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:55,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:55,598 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:51:55,599 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:51:55,601 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:51:55,601 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:51:55,601 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:51:55,601 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z1) = -1*x1 + 1*z1 Supporting invariants [] [2025-02-17 22:51:55,606 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:51:55,607 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:51:55,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:55,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:51:55,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:51:55,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:55,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:55,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:51:55,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:55,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:55,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:55,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:55,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:55,643 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:51:55,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:55,655 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:51:55,656 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:51:55,656 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4298 states and 16966 transitions. cyclomatic complexity: 13371 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:51:55,761 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:51:55,789 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4298 states and 16966 transitions. cyclomatic complexity: 13371. 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 7420 states and 29291 transitions. Complement of second has 6 states. [2025-02-17 22:51:55,789 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:51:55,790 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:51:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-02-17 22:51:55,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-17 22:51:55,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:55,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 9 letters. Loop has 2 letters. [2025-02-17 22:51:55,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:55,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 7 letters. Loop has 4 letters. [2025-02-17 22:51:55,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:55,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7420 states and 29291 transitions. [2025-02-17 22:51:55,903 INFO L131 ngComponentsAnalysis]: Automaton has 282 accepting balls. 743 [2025-02-17 22:51:56,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7420 states to 5938 states and 22927 transitions. [2025-02-17 22:51:56,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2359 [2025-02-17 22:51:56,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2845 [2025-02-17 22:51:56,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5938 states and 22927 transitions. [2025-02-17 22:51:56,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:51:56,012 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5938 states and 22927 transitions. [2025-02-17 22:51:56,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5938 states and 22927 transitions. [2025-02-17 22:51:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5938 to 4664. [2025-02-17 22:51:56,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4664 states, 4664 states have (on average 4.014579759862778) internal successors, (18724), 4663 states have internal predecessors, (18724), 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:51:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 18724 transitions. [2025-02-17 22:51:56,173 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4664 states and 18724 transitions. [2025-02-17 22:51:56,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:51:56,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:51:56,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:51:56,178 INFO L87 Difference]: Start difference. First operand 4664 states and 18724 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:51:56,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:51:56,212 INFO L93 Difference]: Finished difference Result 1184 states and 3837 transitions. [2025-02-17 22:51:56,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1184 states and 3837 transitions. [2025-02-17 22:51:56,221 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 137 [2025-02-17 22:51:56,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1184 states to 1108 states and 3615 transitions. [2025-02-17 22:51:56,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 478 [2025-02-17 22:51:56,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 478 [2025-02-17 22:51:56,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1108 states and 3615 transitions. [2025-02-17 22:51:56,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:51:56,228 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1108 states and 3615 transitions. [2025-02-17 22:51:56,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states and 3615 transitions. [2025-02-17 22:51:56,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2025-02-17 22:51:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 1108 states have (on average 3.262635379061372) internal successors, (3615), 1107 states have internal predecessors, (3615), 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:51:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 3615 transitions. [2025-02-17 22:51:56,250 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1108 states and 3615 transitions. [2025-02-17 22:51:56,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:51:56,251 INFO L432 stractBuchiCegarLoop]: Abstraction has 1108 states and 3615 transitions. [2025-02-17 22:51:56,251 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:51:56,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1108 states and 3615 transitions. [2025-02-17 22:51:56,256 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 137 [2025-02-17 22:51:56,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:51:56,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:51:56,257 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:51:56,257 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:51:56,258 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-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]" "[102] L15-->L47: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[105] L16-->$Ultimate##0: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[84] L47-->L51: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[86] L51-->thread3FINAL: Formula: (= v_g_1 (+ v_g_2 1)) InVars {g=v_g_2} OutVars{g=v_g_1} AuxVars[] AssignedVars[g]" "[89] $Ultimate##0-->L58-1: Formula: (< 0 v_g_4) InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" [2025-02-17 22:51:56,258 INFO L754 eck$LassoCheckResult]: Loop: "[91] L58-1-->L60: Formula: (< v_y2_1 v_x2_5) InVars {y2=v_y2_1, x2=v_x2_5} OutVars{y2=v_y2_1, x2=v_x2_5} AuxVars[] AssignedVars[]" "[93] L60-->L58-1: Formula: (= v_x2_7 (+ v_x2_6 1)) InVars {x2=v_x2_7} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[x2]" [2025-02-17 22:51:56,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1322731890, now seen corresponding path program 1 times [2025-02-17 22:51:56,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:56,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565468021] [2025-02-17 22:51:56,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:56,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:56,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:51:56,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:51:56,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:56,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:56,267 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:56,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:51:56,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:51:56,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:56,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:56,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:56,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:56,275 INFO L85 PathProgramCache]: Analyzing trace with hash 3875, now seen corresponding path program 1 times [2025-02-17 22:51:56,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:56,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299037822] [2025-02-17 22:51:56,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:56,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:56,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:56,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:56,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:56,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:56,278 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:56,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:56,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:56,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:56,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:56,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:56,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:56,282 INFO L85 PathProgramCache]: Analyzing trace with hash 164976240, now seen corresponding path program 1 times [2025-02-17 22:51:56,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:56,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163245670] [2025-02-17 22:51:56,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:56,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:56,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:51:56,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:51:56,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:56,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:56,290 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:56,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:51:56,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:51:56,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:56,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:56,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:56,314 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:56,314 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:56,314 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:56,314 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:56,314 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:51:56,314 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:56,314 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:56,314 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:56,314 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:51:56,314 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:56,314 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:56,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:56,331 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:56,331 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:51:56,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:56,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:56,333 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:51:56,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-17 22:51:56,336 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:51:56,336 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:56,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:56,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:56,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:56,356 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:51:56,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-17 22:51:56,359 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:51:56,359 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:56,427 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:51:56,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:56,431 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:56,431 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:56,431 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:56,431 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:56,431 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:51:56,431 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:56,431 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:56,431 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:56,431 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:51:56,431 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:56,431 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:56,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:56,452 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:56,452 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:51:56,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:56,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:56,455 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:51:56,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-17 22:51:56,457 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:51:56,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:51:56,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:51:56,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:51:56,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:51:56,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:51:56,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:51:56,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:51:56,470 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:51:56,473 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:51:56,473 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:51:56,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:56,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:56,475 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:51:56,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-17 22:51:56,478 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:51:56,478 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:51:56,478 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:51:56,478 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, y2) = 1*x2 - 1*y2 Supporting invariants [] [2025-02-17 22:51:56,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:56,485 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:51:56,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:56,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:51:56,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:51:56,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:56,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:56,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:51:56,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:56,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:56,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:56,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:56,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:56,520 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:51:56,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:56,536 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:51:56,537 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:51:56,537 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1108 states and 3615 transitions. cyclomatic complexity: 2687 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:51:56,607 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1108 states and 3615 transitions. cyclomatic complexity: 2687. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 3182 states and 10284 transitions. Complement of second has 7 states. [2025-02-17 22:51:56,607 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:51:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:51:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-02-17 22:51:56,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:51:56,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:56,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:51:56,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:56,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:51:56,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:56,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3182 states and 10284 transitions. [2025-02-17 22:51:56,633 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 137 [2025-02-17 22:51:56,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3182 states to 1943 states and 6379 transitions. [2025-02-17 22:51:56,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 671 [2025-02-17 22:51:56,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 726 [2025-02-17 22:51:56,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1943 states and 6379 transitions. [2025-02-17 22:51:56,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:51:56,649 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1943 states and 6379 transitions. [2025-02-17 22:51:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states and 6379 transitions. [2025-02-17 22:51:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1351. [2025-02-17 22:51:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1351 states have (on average 3.4041450777202074) internal successors, (4599), 1350 states have internal predecessors, (4599), 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:51:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 4599 transitions. [2025-02-17 22:51:56,681 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1351 states and 4599 transitions. [2025-02-17 22:51:56,681 INFO L432 stractBuchiCegarLoop]: Abstraction has 1351 states and 4599 transitions. [2025-02-17 22:51:56,681 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:51:56,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1351 states and 4599 transitions. [2025-02-17 22:51:56,687 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 137 [2025-02-17 22:51:56,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:51:56,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:51:56,687 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:51:56,687 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:51:56,688 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-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]" "[102] L15-->L47: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[85] L47-->L49: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[105] L16-->$Ultimate##0: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[89] $Ultimate##0-->L58-1: Formula: (< 0 v_g_4) InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[87] L49-->L47: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[84] L47-->L51: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[86] L51-->thread3FINAL: Formula: (= v_g_1 (+ v_g_2 1)) InVars {g=v_g_2} OutVars{g=v_g_1} AuxVars[] AssignedVars[g]" [2025-02-17 22:51:56,688 INFO L754 eck$LassoCheckResult]: Loop: "[91] L58-1-->L60: Formula: (< v_y2_1 v_x2_5) InVars {y2=v_y2_1, x2=v_x2_5} OutVars{y2=v_y2_1, x2=v_x2_5} AuxVars[] AssignedVars[]" "[93] L60-->L58-1: Formula: (= v_x2_7 (+ v_x2_6 1)) InVars {x2=v_x2_7} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[x2]" [2025-02-17 22:51:56,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:56,688 INFO L85 PathProgramCache]: Analyzing trace with hash -388125612, now seen corresponding path program 1 times [2025-02-17 22:51:56,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:56,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609951491] [2025-02-17 22:51:56,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:56,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:56,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:51:56,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:51:56,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:56,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:56,707 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:51:56,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:51:56,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609951491] [2025-02-17 22:51:56,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609951491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:51:56,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:51:56,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:51:56,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830059772] [2025-02-17 22:51:56,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:51:56,708 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:51:56,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:56,708 INFO L85 PathProgramCache]: Analyzing trace with hash 3875, now seen corresponding path program 2 times [2025-02-17 22:51:56,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:56,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066654327] [2025-02-17 22:51:56,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:51:56,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:56,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:56,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:56,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:51:56,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:56,711 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:56,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:56,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:56,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:56,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:56,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:56,724 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:56,724 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:56,724 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:56,724 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:56,724 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:51:56,724 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:56,724 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:56,725 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:56,725 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:51:56,725 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:56,725 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:56,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:56,747 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:56,747 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:51:56,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:56,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:56,753 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:51:56,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-17 22:51:56,756 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:51:56,756 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:56,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:56,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:56,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:56,777 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:51:56,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-17 22:51:56,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:51:56,781 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:56,853 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:51:56,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-17 22:51:56,858 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:56,858 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:56,858 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:56,858 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:56,858 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:51:56,858 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:56,858 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:56,858 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:56,858 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:51:56,858 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:56,858 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:56,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:56,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-17 22:51:56,913 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:56,914 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:51:56,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:56,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:56,916 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:51:56,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-17 22:51:56,920 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:51:56,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:51:56,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:51:56,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:51:56,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:51:56,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:51:56,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:51:56,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:51:56,934 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:51:56,936 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:51:56,936 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:51:56,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:56,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:56,939 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:51:56,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-17 22:51:56,942 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:51:56,942 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:51:56,942 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:51:56,942 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, y2) = 1*x2 - 1*y2 Supporting invariants [] [2025-02-17 22:51:56,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:56,948 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:51:56,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:56,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:51:56,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:51:56,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:56,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:56,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:51:56,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:56,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:56,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:56,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:56,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:56,982 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:51:56,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:56,993 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:51:56,993 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:51:56,993 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1351 states and 4599 transitions. cyclomatic complexity: 3462 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:51:57,028 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1351 states and 4599 transitions. cyclomatic complexity: 3462. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 1854 states and 6165 transitions. Complement of second has 6 states. [2025-02-17 22:51:57,028 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:51:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:51:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-02-17 22:51:57,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:51:57,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:57,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 12 letters. Loop has 2 letters. [2025-02-17 22:51:57,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:57,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 10 letters. Loop has 4 letters. [2025-02-17 22:51:57,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:57,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1854 states and 6165 transitions. [2025-02-17 22:51:57,038 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 87 [2025-02-17 22:51:57,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1854 states to 1216 states and 4146 transitions. [2025-02-17 22:51:57,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 460 [2025-02-17 22:51:57,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 460 [2025-02-17 22:51:57,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1216 states and 4146 transitions. [2025-02-17 22:51:57,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:51:57,044 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1216 states and 4146 transitions. [2025-02-17 22:51:57,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states and 4146 transitions. [2025-02-17 22:51:57,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1216. [2025-02-17 22:51:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1216 states have (on average 3.4095394736842106) internal successors, (4146), 1215 states have internal predecessors, (4146), 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:51:57,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 4146 transitions. [2025-02-17 22:51:57,061 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1216 states and 4146 transitions. [2025-02-17 22:51:57,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:51:57,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:51:57,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:51:57,062 INFO L87 Difference]: Start difference. First operand 1216 states and 4146 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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:51:57,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:51:57,069 INFO L93 Difference]: Finished difference Result 303 states and 816 transitions. [2025-02-17 22:51:57,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 816 transitions. [2025-02-17 22:51:57,070 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:51:57,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 0 states and 0 transitions. [2025-02-17 22:51:57,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:51:57,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:51:57,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:51:57,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:51:57,070 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:51:57,070 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:51:57,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:51:57,071 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:51:57,071 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-17 22:51:57,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:51:57,071 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:51:57,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:51:57,076 INFO L201 PluginConnector]: Adding new model me1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:51:57 BoogieIcfgContainer [2025-02-17 22:51:57,076 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:51:57,077 INFO L158 Benchmark]: Toolchain (without parser) took 5256.01ms. Allocated memory was 159.4MB in the beginning and 482.3MB in the end (delta: 323.0MB). Free memory was 86.3MB in the beginning and 302.5MB in the end (delta: -216.3MB). Peak memory consumption was 106.0MB. Max. memory is 8.0GB. [2025-02-17 22:51:57,077 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 87.0MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:51:57,077 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.13ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:51:57,077 INFO L158 Benchmark]: Boogie Preprocessor took 12.95ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 84.3MB in the end (delta: 642.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:51:57,078 INFO L158 Benchmark]: RCFGBuilder took 182.52ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 74.2MB in the end (delta: 10.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-02-17 22:51:57,078 INFO L158 Benchmark]: BuchiAutomizer took 5041.01ms. Allocated memory was 159.4MB in the beginning and 482.3MB in the end (delta: 323.0MB). Free memory was 74.2MB in the beginning and 302.5MB in the end (delta: -228.3MB). Peak memory consumption was 93.4MB. Max. memory is 8.0GB. [2025-02-17 22:51:57,078 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.14ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 87.0MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 16.13ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 12.95ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 84.3MB in the end (delta: 642.0kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 182.52ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 74.2MB in the end (delta: 10.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 5041.01ms. Allocated memory was 159.4MB in the beginning and 482.3MB in the end (delta: 323.0MB). Free memory was 74.2MB in the beginning and 302.5MB in the end (delta: -228.3MB). Peak memory consumption was 93.4MB. 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 8 terminating modules (2 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z1 and consists of 4 locations. One deterministic module has affine ranking function z2 + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * y1 + x1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * y2 + x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * y2 + x2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.6s AutomataMinimizationTime, 7 MinimizatonAttempts, 5764 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 348 mSDsluCounter, 511 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 243 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 255 IncrementalHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 268 mSDtfsCounter, 255 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 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: 41ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.6s InitialAbstraction: Time to compute Ample Reduction [ms]: 687, Trivial Ample Sets caused by loops: 806, Number of non-trivial ample sets: 1178, Number of pruned transitions: 1123, Number of transitions in reduction automaton: 2081, Number of states in reduction automaton: 807, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:51:57,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-17 22:51:57,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...