/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 false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/motivating-slowitp.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:36:54,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:36:54,164 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 01:36:54,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:36:54,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:36:54,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:36:54,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:36:54,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:36:54,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:36:54,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:36:54,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:36:54,219 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:36:54,219 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:36:54,223 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:36:54,223 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:36:54,223 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:36:54,224 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:36:54,224 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:36:54,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:36:54,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:36:54,225 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:36:54,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:36:54,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:36:54,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:36:54,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:36:54,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:36:54,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:36:54,228 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:36:54,228 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:36:54,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:36:54,229 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:36:54,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:36:54,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:36:54,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:36:54,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:36:54,230 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:36:54,230 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:36:54,231 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:36:54,231 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 -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 01:36:54,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:36:54,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:36:54,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:36:54,574 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:36:54,575 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:36:54,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/motivating-slowitp.bpl [2024-02-10 01:36:54,576 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/motivating-slowitp.bpl' [2024-02-10 01:36:54,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:36:54,610 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:36:54,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:36:54,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:36:54,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:36:54,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:54" (1/1) ... [2024-02-10 01:36:54,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:54" (1/1) ... [2024-02-10 01:36:54,638 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:36:54,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:36:54,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:36:54,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:36:54,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:36:54,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:54" (1/1) ... [2024-02-10 01:36:54,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:54" (1/1) ... [2024-02-10 01:36:54,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:54" (1/1) ... [2024-02-10 01:36:54,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:54" (1/1) ... [2024-02-10 01:36:54,651 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:54" (1/1) ... [2024-02-10 01:36:54,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:54" (1/1) ... [2024-02-10 01:36:54,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:54" (1/1) ... [2024-02-10 01:36:54,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:54" (1/1) ... [2024-02-10 01:36:54,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:36:54,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:36:54,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:36:54,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:36:54,661 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:54" (1/1) ... [2024-02-10 01:36:54,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:54,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:36:54,754 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 01:36:54,765 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 01:36:54,805 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-02-10 01:36:54,806 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 01:36:54,806 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 01:36:54,806 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-02-10 01:36:54,807 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 01:36:54,807 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 01:36:54,807 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-02-10 01:36:54,807 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-10 01:36:54,807 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-10 01:36:54,807 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:36:54,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:36:54,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:36:54,809 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 01:36:54,866 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:36:54,867 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:36:55,005 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:36:55,037 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:36:55,037 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 01:36:55,039 INFO L201 PluginConnector]: Adding new model motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:36:55 BoogieIcfgContainer [2024-02-10 01:36:55,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:36:55,040 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:36:55,040 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:36:55,049 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:36:55,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:36:55,049 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:54" (1/2) ... [2024-02-10 01:36:55,051 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61414c8d and model type motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:36:55, skipping insertion in model container [2024-02-10 01:36:55,051 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:36:55,051 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:36:55" (2/2) ... [2024-02-10 01:36:55,052 INFO L332 chiAutomizerObserver]: Analyzing ICFG motivating-slowitp.bpl [2024-02-10 01:36:55,119 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-10 01:36:55,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 85 flow [2024-02-10 01:36:55,161 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2024-02-10 01:36:55,161 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-10 01:36:55,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-02-10 01:36:55,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 85 flow [2024-02-10 01:36:55,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2024-02-10 01:36:55,174 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:36:55,174 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:36:55,174 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:36:55,174 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:36:55,174 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:36:55,174 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:36:55,174 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:36:55,174 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:36:55,175 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:36:55,175 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 33 places, 26 transitions, 70 flow [2024-02-10 01:36:55,224 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 226 states, 224 states have (on average 2.9285714285714284) internal successors, (656), 225 states have internal predecessors, (656), 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 01:36:55,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 226 states, 224 states have (on average 2.9285714285714284) internal successors, (656), 225 states have internal predecessors, (656), 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 01:36:55,259 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 154 [2024-02-10 01:36:55,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:36:55,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:36:55,263 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:36:55,263 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:36:55,263 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 33 places, 26 transitions, 70 flow [2024-02-10 01:36:55,278 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 226 states, 224 states have (on average 2.9285714285714284) internal successors, (656), 225 states have internal predecessors, (656), 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 01:36:55,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 226 states, 224 states have (on average 2.9285714285714284) internal successors, (656), 225 states have internal predecessors, (656), 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 01:36:55,291 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 154 [2024-02-10 01:36:55,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:36:55,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:36:55,296 INFO L748 eck$LassoCheckResult]: Stem: Black: 493#[$Ultimate##0]don't care [85] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 496#[L18]don't care [106] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 498#[L18-1, $Ultimate##0]don't care [88] $Ultimate##0-->L36-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 500#[L18-1, L36-1]don't care [2024-02-10 01:36:55,296 INFO L750 eck$LassoCheckResult]: Loop: 500#[L18-1, L36-1]don't care [90] L36-1-->L36: 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[] 508#[L18-1, L36]don't care [92] L36-->L36-1: Formula: (and (= v_A_7 (store v_A_8 v_thread1Thread1of1ForFork0_i_7 (let ((.cse0 (select v_A_8 v_thread1Thread1of1ForFork0_i_7))) (ite (< .cse0 0) 0 .cse0)))) (= (+ v_thread1Thread1of1ForFork0_i_7 1) v_thread1Thread1of1ForFork0_i_8)) InVars {A=v_A_8, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_7, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_8} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork0_i] 500#[L18-1, L36-1]don't care [2024-02-10 01:36:55,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:55,302 INFO L85 PathProgramCache]: Analyzing trace with hash 114850, now seen corresponding path program 1 times [2024-02-10 01:36:55,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:55,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472855618] [2024-02-10 01:36:55,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:55,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:55,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:55,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:55,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:55,427 INFO L85 PathProgramCache]: Analyzing trace with hash 3843, now seen corresponding path program 1 times [2024-02-10 01:36:55,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:55,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33613603] [2024-02-10 01:36:55,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:55,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:55,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:55,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:55,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:55,449 INFO L85 PathProgramCache]: Analyzing trace with hash 110373732, now seen corresponding path program 1 times [2024-02-10 01:36:55,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:55,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208750152] [2024-02-10 01:36:55,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:55,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:55,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:55,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:55,601 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:36:55,602 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:36:55,602 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:36:55,602 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:36:55,602 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:36:55,602 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:55,602 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:36:55,602 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:36:55,602 INFO L133 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:36:55,602 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:36:55,603 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:36:55,618 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 01:36:55,649 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 01:36:55,700 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:36:55,704 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:36:55,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:55,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:36:55,708 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 01:36:55,710 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 01:36:55,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:36:55,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:36:55,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:36:55,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:36:55,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:36:55,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:36:55,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:36:55,728 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 01:36:55,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:36:55,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-10 01:36:55,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:55,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:36:55,753 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 01:36:55,759 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 01:36:55,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:36:55,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:36:55,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:36:55,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:36:55,769 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 01:36:55,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:36:55,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:36:55,798 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:36:55,808 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:36:55,808 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 01:36:55,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:55,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:36:55,816 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 01:36:55,824 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:36:55,833 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 01:36:55,843 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:36:55,843 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:36:55,844 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2024-02-10 01:36:55,848 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 01:36:55,852 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:36:55,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-02-10 01:36:55,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:36:55,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:36:55,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:36:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:36:55,937 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:36:55,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:36:55,954 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 01:36:55,982 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 01:36:55,984 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:36:56,156 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 400 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:36:56,157 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:36:56,158 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:36:56,171 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:36:56,171 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:36:56,173 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 01:36:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:36:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-02-10 01:36:56,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 3 letters. Loop has 2 letters. [2024-02-10 01:36:56,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:36:56,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 5 letters. Loop has 2 letters. [2024-02-10 01:36:56,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:36:56,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 3 letters. Loop has 4 letters. [2024-02-10 01:36:56,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:36:56,184 INFO L428 stractBuchiCegarLoop]: Abstraction has has 51 places, 644 transitions, 3014 flow [2024-02-10 01:36:56,184 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:36:56,185 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:36:56,185 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 51 places, 644 transitions, 3014 flow [2024-02-10 01:36:56,259 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 706 states, 696 states have (on average 3.8419540229885056) internal successors, (2674), 705 states have internal predecessors, (2674), 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 01:36:56,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 706 states, 696 states have (on average 3.8419540229885056) internal successors, (2674), 705 states have internal predecessors, (2674), 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 01:36:56,291 INFO L131 ngComponentsAnalysis]: Automaton has 108 accepting balls. 240 [2024-02-10 01:36:56,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:36:56,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:36:56,296 INFO L748 eck$LassoCheckResult]: Stem: Black: 995#[$Ultimate##0]don't care [85] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] Black: 998#[L18]don't care [106] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] Black: 1003#[$Ultimate##0, L18-1]don't care [109] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_12, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_8, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] Black: 1014#[$Ultimate##0, L19, $Ultimate##0]don't care [112] 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_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_12} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k] Black: 1040#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L20]don't care [99] $Ultimate##0-->L72-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] 1102#[$Ultimate##0, $Ultimate##0, L20, L72-1]don't care [2024-02-10 01:36:56,297 INFO L750 eck$LassoCheckResult]: Loop: 1102#[$Ultimate##0, $Ultimate##0, L20, L72-1]don't care [101] L72-1-->L72: Formula: (< v_thread3Thread1of1ForFork2_k_5 v_N_5) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} AuxVars[] AssignedVars[] Black: 1214#[$Ultimate##0, $Ultimate##0, L72, L20]don't care [103] L72-->L72-1: Formula: (and (= v_B_5 (store v_B_6 v_thread3Thread1of1ForFork2_k_7 v_thread3Thread1of1ForFork2_k_7)) (= v_thread3Thread1of1ForFork2_k_8 (+ v_thread3Thread1of1ForFork2_k_7 1))) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_6} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_8, B=v_B_5} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k, B] 1102#[$Ultimate##0, $Ultimate##0, L20, L72-1]don't care [2024-02-10 01:36:56,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:56,298 INFO L85 PathProgramCache]: Analyzing trace with hash 110394602, now seen corresponding path program 1 times [2024-02-10 01:36:56,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:56,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235164312] [2024-02-10 01:36:56,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:56,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:56,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:56,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:56,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:56,319 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2024-02-10 01:36:56,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:56,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958786161] [2024-02-10 01:36:56,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:56,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:56,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:56,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:56,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1284966644, now seen corresponding path program 1 times [2024-02-10 01:36:56,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:56,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985829088] [2024-02-10 01:36:56,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:56,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:56,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:56,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:56,469 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:36:56,469 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:36:56,469 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:36:56,469 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:36:56,469 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:36:56,469 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:56,469 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:36:56,470 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:36:56,470 INFO L133 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:36:56,470 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:36:56,470 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:36:56,473 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 01:36:56,476 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 01:36:56,489 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 01:36:56,492 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 01:36:56,494 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 01:36:56,497 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 01:36:56,500 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 01:36:56,503 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 01:36:56,505 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 01:36:56,508 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 01:36:56,591 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:36:56,591 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:36:56,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:56,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:36:56,593 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 01:36:56,604 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 01:36:56,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:36:56,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:36:56,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:36:56,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:36:56,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:36:56,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:36:56,619 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 01:36:56,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:36:56,636 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 01:36:56,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:56,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:36:56,640 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 01:36:56,647 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 01:36:56,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:36:56,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:36:56,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:36:56,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:36:56,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:36:56,656 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:36:56,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:36:56,658 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 01:36:56,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:36:56,676 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 01:36:56,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:56,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:36:56,678 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 01:36:56,687 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 01:36:56,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:36:56,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:36:56,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:36:56,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:36:56,703 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 01:36:56,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:36:56,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:36:56,715 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:36:56,725 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-10 01:36:56,725 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 01:36:56,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:56,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:36:56,729 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 01:36:56,732 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 01:36:56,732 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:36:56,750 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:36:56,750 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:36:56,750 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_k, N) = -1*thread3Thread1of1ForFork2_k + 1*N Supporting invariants [] [2024-02-10 01:36:56,757 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 01:36:56,759 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:36:56,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:36:56,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:36:56,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:36:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:36:56,794 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:36:56,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:36:56,811 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 01:36:56,812 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 01:36:56,812 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 01:36:56,935 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 400 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:36:56,935 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:36:56,936 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:36:57,023 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 01:36:57,052 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:36:57,052 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:36:57,053 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 01:36:57,053 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 01:36:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-02-10 01:36:57,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 5 letters. Loop has 2 letters. [2024-02-10 01:36:57,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:36:57,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 7 letters. Loop has 2 letters. [2024-02-10 01:36:57,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:36:57,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 5 letters. Loop has 4 letters. [2024-02-10 01:36:57,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:36:57,060 INFO L428 stractBuchiCegarLoop]: Abstraction has has 69 places, 15912 transitions, 106080 flow [2024-02-10 01:36:57,060 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:36:57,060 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:36:57,060 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 69 places, 15912 transitions, 106080 flow [2024-02-10 01:36:59,618 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1924 states, 1870 states have (on average 4.971657754010695) internal successors, (9297), 1923 states have internal predecessors, (9297), 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 01:36:59,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1924 states, 1870 states have (on average 4.971657754010695) internal successors, (9297), 1923 states have internal predecessors, (9297), 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 01:36:59,656 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 140 [2024-02-10 01:36:59,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:36:59,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:36:59,657 INFO L748 eck$LassoCheckResult]: Stem: Black: 2944#[$Ultimate##0]don't care [85] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] Black: 2947#[L18]don't care [106] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] Black: 2961#[L18-1, $Ultimate##0]don't care [109] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_12, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_8, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] 2992#[$Ultimate##0, $Ultimate##0, L19]don't care [93] $Ultimate##0-->L50: Formula: (= v_thread2Thread1of1ForFork1_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_cnt] Black: 3076#[$Ultimate##0, L50, L19]don't care [94] L50-->L52-1: Formula: (= v_thread2Thread1of1ForFork1_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 3198#[$Ultimate##0, L52-1, L19]don't care [2024-02-10 01:36:59,657 INFO L750 eck$LassoCheckResult]: Loop: 3198#[$Ultimate##0, L52-1, L19]don't care [96] L52-1-->L52: Formula: (< v_thread2Thread1of1ForFork1_j_5 v_N_4) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, N=v_N_4} AuxVars[] AssignedVars[] Black: 3468#[L52, $Ultimate##0, L19]don't care [98] L52-->L52-1: Formula: (and (let ((.cse0 (select v_A_13 v_thread2Thread1of1ForFork1_j_7))) (or (and (= (+ v_thread2Thread1of1ForFork1_cnt_3 1) v_thread2_cnt_26) (< 0 .cse0)) (and (= v_thread2_cnt_26 v_thread2Thread1of1ForFork1_cnt_3) (<= .cse0 0)))) (= (+ v_thread2Thread1of1ForFork1_j_7 1) v_thread2Thread1of1ForFork1_j_8) (let ((.cse1 (select v_B_13 v_thread2Thread1of1ForFork1_j_7))) (or (and (= v_thread2_cnt_26 v_thread2Thread1of1ForFork1_cnt_4) (<= .cse1 0)) (and (< 0 .cse1) (= (+ v_thread2_cnt_26 1) v_thread2Thread1of1ForFork1_cnt_4))))) InVars {A=v_A_13, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_3, B=v_B_13} OutVars{A=v_A_13, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_8, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_4, B=v_B_13} AuxVars[v_thread2_cnt_26] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_cnt] 3198#[$Ultimate##0, L52-1, L19]don't care [2024-02-10 01:36:59,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:59,658 INFO L85 PathProgramCache]: Analyzing trace with hash 110394008, now seen corresponding path program 1 times [2024-02-10 01:36:59,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:59,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486506609] [2024-02-10 01:36:59,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:59,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:59,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:59,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:59,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:59,672 INFO L85 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 1 times [2024-02-10 01:36:59,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:59,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170157992] [2024-02-10 01:36:59,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:59,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:59,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:59,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:59,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:59,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1285537638, now seen corresponding path program 1 times [2024-02-10 01:36:59,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:59,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071093341] [2024-02-10 01:36:59,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:59,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:59,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:59,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:59,913 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:36:59,913 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:36:59,913 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:36:59,913 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:36:59,913 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:36:59,913 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:59,913 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:36:59,913 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:36:59,913 INFO L133 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_BEv2_Iteration3_Lasso [2024-02-10 01:36:59,913 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:36:59,913 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:36:59,918 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 01:36:59,920 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 01:37:00,009 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 01:37:00,012 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 01:37:00,014 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 01:37:00,195 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:37:00,195 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:37:00,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:00,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:00,201 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 01:37:00,204 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 01:37:00,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:00,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:00,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:00,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:00,215 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 01:37:00,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:00,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:00,226 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:00,232 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 01:37:00,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:00,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:00,234 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 01:37:00,243 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 01:37:00,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:00,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:00,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:00,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:00,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:00,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:00,263 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 01:37:00,272 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:37:00,281 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-10 01:37:00,281 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 01:37:00,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:00,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:00,283 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 01:37:00,288 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:37:00,289 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 01:37:00,306 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:37:00,306 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:37:00,306 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, N) = -1*thread2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2024-02-10 01:37:00,315 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 01:37:00,316 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:37:00,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:00,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:37:00,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:00,364 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:37:00,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:00,377 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 01:37:00,377 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 01:37:00,377 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 01:37:00,382 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 01:37:00,473 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 400 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:37:00,474 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:37:00,474 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:37:04,203 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:37:04,203 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:37:04,203 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 01:37:04,212 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 01:37:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-02-10 01:37:04,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 5 letters. Loop has 2 letters. [2024-02-10 01:37:04,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:04,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 7 letters. Loop has 2 letters. [2024-02-10 01:37:04,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:04,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 5 letters. Loop has 4 letters. [2024-02-10 01:37:04,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:04,214 INFO L428 stractBuchiCegarLoop]: Abstraction has has 87 places, 392080 transitions, 3392168 flow [2024-02-10 01:37:04,214 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 01:37:04,214 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:37:04,214 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 87 places, 392080 transitions, 3392168 flow Received shutdown request... [2024-02-10 01:40:50,103 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:40:50,104 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-10 01:40:50,109 INFO L201 PluginConnector]: Adding new model motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:40:50 BoogieIcfgContainer [2024-02-10 01:40:50,110 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:40:50,110 INFO L158 Benchmark]: Toolchain (without parser) took 235500.23ms. Allocated memory was 163.6MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 100.9MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 5.5GB. Max. memory is 8.0GB. [2024-02-10 01:40:50,110 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 163.6MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:40:50,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.94ms. Allocated memory is still 163.6MB. Free memory was 100.9MB in the beginning and 99.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:40:50,112 INFO L158 Benchmark]: Boogie Preprocessor took 18.43ms. Allocated memory is still 163.6MB. Free memory was 99.6MB in the beginning and 98.5MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:40:50,112 INFO L158 Benchmark]: RCFGBuilder took 380.80ms. Allocated memory is still 163.6MB. Free memory was 98.2MB in the beginning and 125.2MB in the end (delta: -27.0MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2024-02-10 01:40:50,113 INFO L158 Benchmark]: BuchiAutomizer took 235069.31ms. Allocated memory was 163.6MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 125.0MB in the beginning and 5.8GB in the end (delta: -5.6GB). Peak memory consumption was 5.5GB. Max. memory is 8.0GB. [2024-02-10 01:40:50,115 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.12ms. Allocated memory is still 163.6MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.94ms. Allocated memory is still 163.6MB. Free memory was 100.9MB in the beginning and 99.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.43ms. Allocated memory is still 163.6MB. Free memory was 99.6MB in the beginning and 98.5MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 380.80ms. Allocated memory is still 163.6MB. Free memory was 98.2MB in the beginning and 125.2MB in the end (delta: -27.0MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 235069.31ms. Allocated memory was 163.6MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 125.0MB in the beginning and 5.8GB in the end (delta: -5.6GB). Peak memory consumption was 5.5GB. 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 * k + N and consists of 5 locations. One deterministic module has affine ranking function N + -1 * j and consists of 5 locations. The remainder module has 3392168 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 234.9s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 4.3s. 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: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 264 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 270 IncrementalHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 165 mSDtfsCounter, 270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital64 mio100 ax100 hnf100 lsp161 ukn45 mio100 lsp89 div100 bol100 ite100 ukn100 eq146 hnf95 smp100 dnf154 smp78 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 94ms 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 BuchiPetriNet2FiniteAutomaton. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown