/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-comp.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:59:05,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:59:05,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 00:59:05,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:59:05,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:59:05,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:59:05,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:59:05,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:59:05,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:59:05,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:59:05,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:59:05,353 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:59:05,353 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:59:05,354 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:59:05,354 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:59:05,354 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:59:05,354 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:59:05,355 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:59:05,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:59:05,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:59:05,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:59:05,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:59:05,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:59:05,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:59:05,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:59:05,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:59:05,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:59:05,358 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:59:05,359 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:59:05,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:59:05,360 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:59:05,360 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:59:05,360 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:59:05,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:59:05,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:59:05,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:59:05,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:59:05,362 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:59:05,362 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 00:59:05,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:59:05,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:59:05,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:59:05,684 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:59:05,685 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:59:05,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-comp.bpl [2024-02-10 00:59:05,688 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-comp.bpl' [2024-02-10 00:59:05,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:59:05,720 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:59:05,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:59:05,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:59:05,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:59:05,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:05" (1/1) ... [2024-02-10 00:59:05,788 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:05" (1/1) ... [2024-02-10 00:59:05,808 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 00:59:05,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:59:05,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:59:05,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:59:05,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:59:05,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:05" (1/1) ... [2024-02-10 00:59:05,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:05" (1/1) ... [2024-02-10 00:59:05,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:05" (1/1) ... [2024-02-10 00:59:05,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:05" (1/1) ... [2024-02-10 00:59:05,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:05" (1/1) ... [2024-02-10 00:59:05,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:05" (1/1) ... [2024-02-10 00:59:05,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:05" (1/1) ... [2024-02-10 00:59:05,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:05" (1/1) ... [2024-02-10 00:59:05,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:59:05,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:59:05,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:59:05,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:59:05,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:05" (1/1) ... [2024-02-10 00:59:05,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:05,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:05,939 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:06,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 00:59:06,082 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-02-10 00:59:06,082 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:59:06,083 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:59:06,083 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-02-10 00:59:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:59:06,084 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:59:06,084 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-02-10 00:59:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-10 00:59:06,084 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-10 00:59:06,085 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:59:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:59:06,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:59:06,086 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 00:59:06,151 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:59:06,153 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:59:06,375 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:59:06,386 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:59:06,386 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:59:06,388 INFO L201 PluginConnector]: Adding new model map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:59:06 BoogieIcfgContainer [2024-02-10 00:59:06,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:59:06,390 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:59:06,390 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:59:06,414 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:59:06,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:59:06,415 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:05" (1/2) ... [2024-02-10 00:59:06,418 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d28bc0e and model type map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:59:06, skipping insertion in model container [2024-02-10 00:59:06,418 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:59:06,418 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:59:06" (2/2) ... [2024-02-10 00:59:06,420 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-comp.bpl [2024-02-10 00:59:06,519 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-10 00:59:06,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 91 flow [2024-02-10 00:59:06,580 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2024-02-10 00:59:06,580 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-10 00:59:06,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2024-02-10 00:59:06,586 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 91 flow [2024-02-10 00:59:06,589 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2024-02-10 00:59:06,596 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:59:06,596 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:59:06,596 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:59:06,596 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:59:06,596 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:59:06,596 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:59:06,596 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:59:06,597 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:59:06,597 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 36 places, 29 transitions, 76 flow [2024-02-10 00:59:06,604 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:59:06,604 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-02-10 00:59:06,604 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 00:59:06,604 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:59:06,607 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:59:06,608 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 36 places, 29 transitions, 76 flow [2024-02-10 00:59:06,611 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:59:06,611 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-02-10 00:59:06,611 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 00:59:06,611 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:59:06,617 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[] 45#[L16]true [41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B] 47#[L18]true [90] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 49#[L18-1, $Ultimate##0]true [70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 51#[L34-1, L18-1]true [2024-02-10 00:59:06,618 INFO L750 eck$LassoCheckResult]: Loop: 51#[L34-1, L18-1]true [72] L34-1-->L35: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[] 54#[L18-1, L35]true [74] L35-->L36: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 1))) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A] 56#[L18-1, L36]true [75] L36-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 51#[L34-1, L18-1]true [2024-02-10 00:59:06,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:06,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2902197, now seen corresponding path program 1 times [2024-02-10 00:59:06,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:06,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200207185] [2024-02-10 00:59:06,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:06,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:06,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:06,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:06,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:06,751 INFO L85 PathProgramCache]: Analyzing trace with hash 101352, now seen corresponding path program 1 times [2024-02-10 00:59:06,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:06,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249074705] [2024-02-10 00:59:06,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:06,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:06,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:06,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:06,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:06,767 INFO L85 PathProgramCache]: Analyzing trace with hash 560076468, now seen corresponding path program 1 times [2024-02-10 00:59:06,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:06,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138648927] [2024-02-10 00:59:06,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:06,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:06,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:06,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:06,895 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:59:06,896 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:59:06,896 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:59:06,896 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:59:06,896 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:59:06,897 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:06,897 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:59:06,897 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:59:06,897 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:59:06,897 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:59:06,897 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:59:06,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:06,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:07,005 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:59:07,009 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:59:07,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:07,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:07,022 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:07,025 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 [2024-02-10 00:59:07,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-10 00:59:07,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:07,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:59:07,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:07,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:07,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:07,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:59:07,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:59:07,058 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:07,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-10 00:59:07,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:07,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:07,068 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:07,075 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 [2024-02-10 00:59:07,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:07,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:59:07,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:07,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:07,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:07,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:59:07,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:59:07,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-10 00:59:07,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:07,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:07,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:07,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:07,101 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:07,107 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 [2024-02-10 00:59:07,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:07,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:07,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:07,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:07,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-10 00:59:07,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:59:07,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:59:07,160 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:59:07,202 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-10 00:59:07,202 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-02-10 00:59:07,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:07,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:07,210 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:07,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-10 00:59:07,212 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:59:07,222 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:59:07,223 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:59:07,224 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2024-02-10 00:59:07,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:07,233 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:59:07,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:59:07,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:59:07,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:59:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:59:07,324 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:59:07,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:59:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:59:07,384 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 [2024-02-10 00:59:07,387 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:59:07,537 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 439 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:59:07,538 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:59:07,538 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:59:07,563 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:59:07,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:07,667 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:59:07,668 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:59:07,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 00:59:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:59:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-02-10 00:59:07,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 4 letters. Loop has 3 letters. [2024-02-10 00:59:07,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:07,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 7 letters. Loop has 3 letters. [2024-02-10 00:59:07,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:07,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 4 letters. Loop has 6 letters. [2024-02-10 00:59:07,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:07,690 INFO L428 stractBuchiCegarLoop]: Abstraction has has 45 places, 361 transitions, 1663 flow [2024-02-10 00:59:07,691 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:59:07,697 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 places, 361 transitions, 1663 flow [2024-02-10 00:59:07,784 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:59:07,784 INFO L124 PetriNetUnfolderBase]: 216/292 cut-off events. [2024-02-10 00:59:07,784 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-02-10 00:59:07,785 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:59:07,786 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[] 45#[L16]true [41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B] 47#[L18]true [90] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 49#[L18-1, $Ultimate##0]true [93] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 118#[$Ultimate##0, $Ultimate##0, L19]true [76] $Ultimate##0-->L46-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i] 120#[$Ultimate##0, L19, L46-1]true [78] L46-1-->L47: Formula: (< v_thread2Thread1of1ForFork1_i_5 v_N_4) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} AuxVars[] AssignedVars[] 122#[$Ultimate##0, L47, L19]true [80] L47-->L48: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ 2 (select v_A_4 v_thread2Thread1of1ForFork1_i_7))) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A] 124#[$Ultimate##0, L19, L48]true [81] L48-->L46-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i] 120#[$Ultimate##0, L19, L46-1]true [2024-02-10 00:59:07,786 INFO L750 eck$LassoCheckResult]: Loop: 120#[$Ultimate##0, L19, L46-1]true [78] L46-1-->L47: Formula: (< v_thread2Thread1of1ForFork1_i_5 v_N_4) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} AuxVars[] AssignedVars[] 122#[$Ultimate##0, L47, L19]true [80] L47-->L48: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ 2 (select v_A_4 v_thread2Thread1of1ForFork1_i_7))) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A] 124#[$Ultimate##0, L19, L48]true [81] L48-->L46-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i] 120#[$Ultimate##0, L19, L46-1]true [2024-02-10 00:59:07,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:07,787 INFO L85 PathProgramCache]: Analyzing trace with hash 203865551, now seen corresponding path program 1 times [2024-02-10 00:59:07,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:07,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932640881] [2024-02-10 00:59:07,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:07,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:07,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:07,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:07,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:07,823 INFO L85 PathProgramCache]: Analyzing trace with hash 107310, now seen corresponding path program 1 times [2024-02-10 00:59:07,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:07,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967851220] [2024-02-10 00:59:07,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:07,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:07,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:07,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:07,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash 274950816, now seen corresponding path program 2 times [2024-02-10 00:59:07,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:07,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138998786] [2024-02-10 00:59:07,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:07,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:07,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:07,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:08,023 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:59:08,024 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:59:08,024 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:59:08,024 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:59:08,024 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:59:08,024 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:08,024 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:59:08,024 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:59:08,024 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:59:08,025 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:59:08,025 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:59:08,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:08,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:08,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:08,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:08,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:08,145 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:59:08,145 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:59:08,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:08,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:08,147 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:08,161 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 [2024-02-10 00:59:08,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:08,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:59:08,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:08,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:08,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:08,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:59:08,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:59:08,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-10 00:59:08,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:08,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:08,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:08,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:08,198 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:08,205 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 [2024-02-10 00:59:08,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:08,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:08,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:08,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:08,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:59:08,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:59:08,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-10 00:59:08,237 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:08,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:08,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:08,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:08,247 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:08,253 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 [2024-02-10 00:59:08,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:08,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:59:08,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:08,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:08,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:08,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:59:08,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:59:08,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-10 00:59:08,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:08,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:08,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:08,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:08,284 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:08,290 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 [2024-02-10 00:59:08,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:08,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:08,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:08,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:08,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:59:08,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:59:08,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-10 00:59:08,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:08,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:08,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:08,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:08,327 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:08,335 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 [2024-02-10 00:59:08,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:08,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:59:08,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:08,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:08,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:08,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:59:08,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:59:08,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-10 00:59:08,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:08,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:08,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:08,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:08,366 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:08,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-10 00:59:08,371 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 [2024-02-10 00:59:08,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:08,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:08,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:08,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:08,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:59:08,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:59:08,404 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:59:08,413 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 00:59:08,413 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 00:59:08,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:08,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:08,426 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:08,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-10 00:59:08,473 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:59:08,498 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:59:08,498 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:59:08,498 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_i, N) = -1*thread2Thread1of1ForFork1_i + 1*N Supporting invariants [] [2024-02-10 00:59:08,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:08,518 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:59:08,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:59:08,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:59:08,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:59:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:59:08,571 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:59:08,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:59:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:59:08,587 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 [2024-02-10 00:59:08,587 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-02-10 00:59:08,711 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 9 states and 439 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:59:08,711 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:59:08,711 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:59:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 439 transitions. [2024-02-10 00:59:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 439 transitions. [2024-02-10 00:59:08,730 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:59:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 439 transitions. [2024-02-10 00:59:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 439 transitions. [2024-02-10 00:59:08,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:08,921 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:59:08,921 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:59:08,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 00:59:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-02-10 00:59:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-02-10 00:59:08,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 8 letters. Loop has 3 letters. [2024-02-10 00:59:08,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:08,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 11 letters. Loop has 3 letters. [2024-02-10 00:59:08,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:08,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 8 letters. Loop has 6 letters. [2024-02-10 00:59:08,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:08,924 INFO L428 stractBuchiCegarLoop]: Abstraction has has 58 places, 5838 transitions, 38478 flow [2024-02-10 00:59:08,924 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:59:08,924 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 58 places, 5838 transitions, 38478 flow [2024-02-10 00:59:09,084 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:59:09,084 INFO L124 PetriNetUnfolderBase]: 976/1200 cut-off events. [2024-02-10 00:59:09,084 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-02-10 00:59:09,084 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:59:09,085 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[] 45#[L16]true [41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B] 47#[L18]true [90] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 49#[L18-1, $Ultimate##0]true [93] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 118#[$Ultimate##0, $Ultimate##0, L19]true [96] L19-->$Ultimate##0: 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_i=v_thread3Thread1of1ForFork2_i_14, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_i, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 198#[$Ultimate##0, $Ultimate##0, L20, $Ultimate##0]true [82] $Ultimate##0-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i] 200#[L58-1, $Ultimate##0, $Ultimate##0, L20]true [84] L58-1-->L59: Formula: (< v_thread3Thread1of1ForFork2_i_5 v_N_5) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} AuxVars[] AssignedVars[] 202#[$Ultimate##0, $Ultimate##0, L20, L59]true [86] L59-->L60: Formula: (= v_B_1 (store v_B_2 v_thread3Thread1of1ForFork2_i_7 (+ 3 (select v_B_2 v_thread3Thread1of1ForFork2_i_7)))) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_2} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_1} AuxVars[] AssignedVars[B] 204#[L60, $Ultimate##0, $Ultimate##0, L20]true [87] L60-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_10 (+ v_thread3Thread1of1ForFork2_i_9 1)) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_9} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i] 200#[L58-1, $Ultimate##0, $Ultimate##0, L20]true [2024-02-10 00:59:09,085 INFO L750 eck$LassoCheckResult]: Loop: 200#[L58-1, $Ultimate##0, $Ultimate##0, L20]true [84] L58-1-->L59: Formula: (< v_thread3Thread1of1ForFork2_i_5 v_N_5) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} AuxVars[] AssignedVars[] 202#[$Ultimate##0, $Ultimate##0, L20, L59]true [86] L59-->L60: Formula: (= v_B_1 (store v_B_2 v_thread3Thread1of1ForFork2_i_7 (+ 3 (select v_B_2 v_thread3Thread1of1ForFork2_i_7)))) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_2} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_1} AuxVars[] AssignedVars[B] 204#[L60, $Ultimate##0, $Ultimate##0, L20]true [87] L60-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_10 (+ v_thread3Thread1of1ForFork2_i_9 1)) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_9} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i] 200#[L58-1, $Ultimate##0, $Ultimate##0, L20]true [84] L58-1-->L59: Formula: (< v_thread3Thread1of1ForFork2_i_5 v_N_5) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} AuxVars[] AssignedVars[] 202#[$Ultimate##0, $Ultimate##0, L20, L59]true [86] L59-->L60: Formula: (= v_B_1 (store v_B_2 v_thread3Thread1of1ForFork2_i_7 (+ 3 (select v_B_2 v_thread3Thread1of1ForFork2_i_7)))) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_2} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_1} AuxVars[] AssignedVars[B] 204#[L60, $Ultimate##0, $Ultimate##0, L20]true [87] L60-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_10 (+ v_thread3Thread1of1ForFork2_i_9 1)) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_9} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i] 200#[L58-1, $Ultimate##0, $Ultimate##0, L20]true [2024-02-10 00:59:09,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:09,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2043458455, now seen corresponding path program 1 times [2024-02-10 00:59:09,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:09,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896210101] [2024-02-10 00:59:09,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:09,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:09,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:09,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:09,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:09,111 INFO L85 PathProgramCache]: Analyzing trace with hash -920516831, now seen corresponding path program 1 times [2024-02-10 00:59:09,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:09,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563350105] [2024-02-10 00:59:09,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:09,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:09,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:09,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:09,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:09,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1270664649, now seen corresponding path program 2 times [2024-02-10 00:59:09,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:09,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823953931] [2024-02-10 00:59:09,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:09,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:09,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:09,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:09,234 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:59:09,234 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:59:09,234 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:59:09,234 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:59:09,234 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:59:09,234 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:09,234 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:59:09,234 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:59:09,234 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_BEv2_Iteration3_Lasso [2024-02-10 00:59:09,234 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:59:09,235 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:59:09,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:09,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:09,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:09,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:09,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:09,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:09,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:09,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:09,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:09,402 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:59:09,402 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:59:09,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:09,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:09,404 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:09,409 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 [2024-02-10 00:59:09,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:09,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:59:09,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:09,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:09,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:09,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:59:09,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:59:09,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 00:59:09,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:09,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-02-10 00:59:09,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:09,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:09,435 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:09,440 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 [2024-02-10 00:59:09,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:09,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:59:09,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:09,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:09,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:09,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:59:09,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:59:09,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 00:59:09,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:09,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:09,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:09,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:09,466 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:09,471 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 [2024-02-10 00:59:09,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:09,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:59:09,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:09,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:09,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:09,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:59:09,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:59:09,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-10 00:59:09,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:09,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:09,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:09,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:09,509 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:09,514 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 [2024-02-10 00:59:09,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:09,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:59:09,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:09,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:09,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:09,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:59:09,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:59:09,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-02-10 00:59:09,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:09,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:09,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:09,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:09,569 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:09,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-02-10 00:59:09,637 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 [2024-02-10 00:59:09,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:09,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:59:09,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:09,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:09,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:09,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:59:09,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:59:09,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:09,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:09,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:09,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:09,662 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:09,667 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 [2024-02-10 00:59:09,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:09,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:09,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:09,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:09,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:59:09,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:59:09,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-02-10 00:59:09,696 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:59:09,704 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-10 00:59:09,704 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 00:59:09,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:09,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:09,706 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:09,710 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:59:09,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-02-10 00:59:09,729 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:59:09,729 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:59:09,729 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_i, N) = -1*thread3Thread1of1ForFork2_i + 1*N Supporting invariants [] [2024-02-10 00:59:09,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-02-10 00:59:09,752 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 00:59:09,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:59:09,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:59:09,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:59:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:59:09,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 00:59:09,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:59:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:59:09,829 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 00:59:09,830 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2024-02-10 00:59:09,915 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 8 states and 406 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:59:09,915 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:59:09,915 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:59:09,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 406 transitions. [2024-02-10 00:59:09,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 406 transitions. [2024-02-10 00:59:09,917 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:59:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 406 transitions. [2024-02-10 00:59:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 406 transitions. [2024-02-10 00:59:10,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:12,896 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:59:12,897 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:59:12,897 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 [2024-02-10 00:59:12,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2024-02-10 00:59:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-02-10 00:59:12,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 9 letters. Loop has 6 letters. [2024-02-10 00:59:12,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:12,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 15 letters. Loop has 6 letters. [2024-02-10 00:59:12,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:12,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 9 letters. Loop has 12 letters. [2024-02-10 00:59:12,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:12,900 INFO L428 stractBuchiCegarLoop]: Abstraction has has 70 places, 88988 transitions, 762463 flow [2024-02-10 00:59:12,900 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 00:59:12,900 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 70 places, 88988 transitions, 762463 flow Received shutdown request... [2024-02-10 01:03:46,259 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-02-10 01:03:46,455 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-10 01:03:46,462 INFO L201 PluginConnector]: Adding new model map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:03:46 BoogieIcfgContainer [2024-02-10 01:03:46,462 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:03:46,466 INFO L158 Benchmark]: Toolchain (without parser) took 280742.30ms. Allocated memory was 154.1MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 88.9MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2024-02-10 01:03:46,467 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.17ms. Allocated memory is still 154.1MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:03:46,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.64ms. Allocated memory is still 154.1MB. Free memory was 88.9MB in the beginning and 123.1MB in the end (delta: -34.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 01:03:46,470 INFO L158 Benchmark]: Boogie Preprocessor took 54.30ms. Allocated memory is still 154.1MB. Free memory was 122.9MB in the beginning and 121.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:03:46,471 INFO L158 Benchmark]: RCFGBuilder took 522.90ms. Allocated memory is still 154.1MB. Free memory was 121.9MB in the beginning and 112.0MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-10 01:03:46,473 INFO L158 Benchmark]: BuchiAutomizer took 280072.67ms. Allocated memory was 154.1MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 111.9MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2024-02-10 01:03:46,479 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 1.17ms. Allocated memory is still 154.1MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 84.64ms. Allocated memory is still 154.1MB. Free memory was 88.9MB in the beginning and 123.1MB in the end (delta: -34.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.30ms. Allocated memory is still 154.1MB. Free memory was 122.9MB in the beginning and 121.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 522.90ms. Allocated memory is still 154.1MB. Free memory was 121.9MB in the beginning and 112.0MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 280072.67ms. Allocated memory was 154.1MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 111.9MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 3.4GB. 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 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. The remainder module has 762463 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 279.9s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 2.0s. Construction of modules took 0.1s. Büchi inclusion checks took 3.8s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/3 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 291 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 378 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 171 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 256 IncrementalHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 207 mSDtfsCounter, 256 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital55 mio100 ax100 hnf100 lsp83 ukn61 mio100 lsp85 div100 bol100 ite100 ukn100 eq143 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 124ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing PetriNetUnfolderBuchi. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown