/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 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 00:27:53,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:27:53,578 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:27:53,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:27:53,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:27:53,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:27:53,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:27:53,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:27:53,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:27:53,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:27:53,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:27:53,608 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:27:53,624 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:27:53,628 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:27:53,629 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:27:53,629 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:27:53,630 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:27:53,630 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:27:53,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:27:53,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:27:53,631 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:27:53,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:27:53,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:27:53,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:27:53,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:27:53,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:27:53,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:27:53,633 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:27:53,634 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:27:53,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:27:53,635 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:27:53,635 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:27:53,635 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:27:53,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:27:53,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:27:53,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:27:53,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:27:53,637 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:27:53,637 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 -> true [2024-02-10 00:27:53,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:27:53,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:27:53,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:27:53,990 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:27:53,992 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:27:53,993 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 00:27:53,993 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/motivating-slowitp.bpl' [2024-02-10 00:27:54,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:27:54,019 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:27:54,022 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:27:54,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:27:54,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:27:54,033 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 12:27:54" (1/1) ... [2024-02-10 00:27:54,040 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 12:27:54" (1/1) ... [2024-02-10 00:27:54,047 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 00:27:54,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:27:54,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:27:54,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:27:54,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:27:54,056 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 12:27:54" (1/1) ... [2024-02-10 00:27:54,056 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 12:27:54" (1/1) ... [2024-02-10 00:27:54,057 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 12:27:54" (1/1) ... [2024-02-10 00:27:54,057 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 12:27:54" (1/1) ... [2024-02-10 00:27:54,060 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 12:27:54" (1/1) ... [2024-02-10 00:27:54,065 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 12:27:54" (1/1) ... [2024-02-10 00:27:54,066 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 12:27:54" (1/1) ... [2024-02-10 00:27:54,066 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 12:27:54" (1/1) ... [2024-02-10 00:27:54,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:27:54,072 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:27:54,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:27:54,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:27:54,072 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:54" (1/1) ... [2024-02-10 00:27:54,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:54,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:54,105 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:27:54,124 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:27:54,142 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-02-10 00:27:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:27:54,143 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:27:54,143 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-02-10 00:27:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:27:54,143 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:27:54,143 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-02-10 00:27:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-10 00:27:54,144 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-10 00:27:54,144 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:27:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:27:54,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:27:54,145 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:27:54,184 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:27:54,185 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:27:54,338 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:27:54,367 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:27:54,367 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:27:54,369 INFO L201 PluginConnector]: Adding new model motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:27:54 BoogieIcfgContainer [2024-02-10 00:27:54,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:27:54,370 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:27:54,370 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:27:54,374 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:27:54,374 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:27:54,375 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:54" (1/2) ... [2024-02-10 00:27:54,376 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ce52757 and model type motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:27:54, skipping insertion in model container [2024-02-10 00:27:54,376 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:27:54,376 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 12:27:54" (2/2) ... [2024-02-10 00:27:54,377 INFO L332 chiAutomizerObserver]: Analyzing ICFG motivating-slowitp.bpl [2024-02-10 00:27:54,443 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-10 00:27:54,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 85 flow [2024-02-10 00:27:54,492 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2024-02-10 00:27:54,492 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-10 00:27:54,496 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 00:27:54,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 85 flow [2024-02-10 00:27:54,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2024-02-10 00:27:54,505 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:27:54,505 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:27:54,505 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:27:54,505 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:27:54,505 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:27:54,505 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:27:54,505 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:27:54,506 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:27:54,506 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:27:54,507 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 33 places, 26 transitions, 70 flow [2024-02-10 00:27:54,535 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 00:27:54,537 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 00:27:54,569 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 154 [2024-02-10 00:27:54,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:27:54,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:27:54,573 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:27:54,573 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:27:54,573 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 33 places, 26 transitions, 70 flow [2024-02-10 00:27:54,592 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 00:27:54,593 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 00:27:54,608 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 154 [2024-02-10 00:27:54,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:27:54,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:27:54,616 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 00:27:54,617 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#[L36, L18-1]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 00:27:54,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:54,621 INFO L85 PathProgramCache]: Analyzing trace with hash 114850, now seen corresponding path program 1 times [2024-02-10 00:27:54,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:54,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223020487] [2024-02-10 00:27:54,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:54,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:54,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:54,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:54,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:54,723 INFO L85 PathProgramCache]: Analyzing trace with hash 3843, now seen corresponding path program 1 times [2024-02-10 00:27:54,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:54,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875333877] [2024-02-10 00:27:54,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:54,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:54,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:54,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:54,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:54,740 INFO L85 PathProgramCache]: Analyzing trace with hash 110373732, now seen corresponding path program 1 times [2024-02-10 00:27:54,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:54,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655154396] [2024-02-10 00:27:54,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:54,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:54,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:54,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:54,881 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:27:54,881 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:27:54,881 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:27:54,881 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:27:54,881 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:27:54,881 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:54,881 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:27:54,882 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:27:54,882 INFO L133 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:27:54,882 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:27:54,882 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:27:54,894 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:27:54,930 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:27:54,980 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:27:54,983 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:27:54,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:54,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:54,987 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:27:54,990 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:27:54,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:54,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:27:54,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:54,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:54,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:55,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:27:55,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:27:55,005 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:27:55,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:27:55,020 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 00:27:55,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:55,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:55,022 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:27:55,024 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:27:55,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:27:55,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:55,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:55,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:55,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:55,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:55,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:55,060 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:27:55,070 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 00:27:55,070 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 00:27:55,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:55,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:55,079 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:27:55,080 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:27:55,081 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:27:55,093 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:27:55,093 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:27:55,094 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2024-02-10 00:27:55,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-02-10 00:27:55,109 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:27:55,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:55,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:27:55,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:55,149 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:27:55,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:55,163 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:27:55,191 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:27:55,193 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 00:27:55,359 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 00:27:55,360 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:27:55,360 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:27:55,362 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:27:55,393 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:27:55,393 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:27:55,396 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:27:55,400 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 00:27:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-02-10 00:27:55,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 3 letters. Loop has 2 letters. [2024-02-10 00:27:55,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:55,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 5 letters. Loop has 2 letters. [2024-02-10 00:27:55,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:55,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 3 letters. Loop has 4 letters. [2024-02-10 00:27:55,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:55,402 INFO L428 stractBuchiCegarLoop]: Abstraction has has 42 places, 322 transitions, 1507 flow [2024-02-10 00:27:55,402 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:27:55,402 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:27:55,403 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 42 places, 322 transitions, 1507 flow [2024-02-10 00:27:55,450 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 486 states, 480 states have (on average 4.383333333333334) internal successors, (2104), 485 states have internal predecessors, (2104), 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:27:55,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 486 states, 480 states have (on average 4.383333333333334) internal successors, (2104), 485 states have internal predecessors, (2104), 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:27:55,474 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 120 [2024-02-10 00:27:55,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:27:55,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:27:55,476 INFO L748 eck$LassoCheckResult]: Stem: Black: 986#[$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[] 992#[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] 997#[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] 1005#[$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] 1028#[L20, $Ultimate##0, $Ultimate##0, $Ultimate##0]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] 1066#[L20, L72-1, $Ultimate##0, $Ultimate##0]don't care [2024-02-10 00:27:55,476 INFO L750 eck$LassoCheckResult]: Loop: 1066#[L20, L72-1, $Ultimate##0, $Ultimate##0]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[] 1132#[L20, $Ultimate##0, $Ultimate##0, L72]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] 1066#[L20, L72-1, $Ultimate##0, $Ultimate##0]don't care [2024-02-10 00:27:55,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:55,477 INFO L85 PathProgramCache]: Analyzing trace with hash 110394602, now seen corresponding path program 1 times [2024-02-10 00:27:55,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:55,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897715941] [2024-02-10 00:27:55,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:55,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:55,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:55,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:55,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:55,487 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2024-02-10 00:27:55,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:55,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951104231] [2024-02-10 00:27:55,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:55,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:55,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:55,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:55,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:55,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1284966644, now seen corresponding path program 1 times [2024-02-10 00:27:55,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:55,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57068420] [2024-02-10 00:27:55,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:55,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:55,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:55,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:55,601 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:27:55,602 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:27:55,602 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:27:55,602 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:27:55,602 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:27:55,602 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:55,602 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:27:55,602 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:27:55,602 INFO L133 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:27:55,602 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:27:55,602 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:27:55,605 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:27:55,609 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:27:55,623 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:27:55,626 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:27:55,628 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:27:55,631 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:27:55,634 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:27:55,637 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:27:55,640 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:27:55,642 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:27:55,719 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:27:55,720 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:27:55,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:55,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:55,721 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:27:55,726 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:27:55,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:55,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:55,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:55,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:55,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:55,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:55,741 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:27:55,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:27:55,757 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:27:55,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:55,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:55,760 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:27:55,765 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:27:55,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:55,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:27:55,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:55,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:55,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:55,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:27:55,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:27:55,775 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:27:55,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:27:55,790 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:27:55,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:55,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:55,793 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:27:55,798 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:27:55,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:55,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:55,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:55,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:55,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:55,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:55,820 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:27:55,824 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:27:55,838 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-10 00:27:55,838 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 00:27:55,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:55,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:55,842 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:27:55,846 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:27:55,854 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:27:55,864 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:27:55,864 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:27:55,864 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_k, N) = -1*thread3Thread1of1ForFork2_k + 1*N Supporting invariants [] [2024-02-10 00:27:55,871 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:27:55,872 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:27:55,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:55,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:27:55,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:55,903 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:27:55,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:55,916 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:27:55,917 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:27:55,918 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:27:56,047 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 00:27:56,047 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:27:56,047 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:27:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 400 transitions. [2024-02-10 00:27:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 400 transitions. [2024-02-10 00:27:56,058 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:27:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 400 transitions. [2024-02-10 00:27:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 400 transitions. [2024-02-10 00:27:56,115 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:27:56,146 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:27:56,329 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:27:56,330 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:27:56,332 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:27:56,334 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:27:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-02-10 00:27:56,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 5 letters. Loop has 2 letters. [2024-02-10 00:27:56,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:56,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 7 letters. Loop has 2 letters. [2024-02-10 00:27:56,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:56,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 5 letters. Loop has 4 letters. [2024-02-10 00:27:56,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:56,338 INFO L428 stractBuchiCegarLoop]: Abstraction has has 55 places, 5175 transitions, 34500 flow [2024-02-10 00:27:56,338 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:27:56,338 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:27:56,339 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 55 places, 5175 transitions, 34500 flow [2024-02-10 00:27:56,920 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1255 states, 1225 states have (on average 5.768163265306122) internal successors, (7066), 1254 states have internal predecessors, (7066), 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:27:56,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1255 states, 1225 states have (on average 5.768163265306122) internal successors, (7066), 1254 states have internal predecessors, (7066), 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:27:56,941 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 140 [2024-02-10 00:27:56,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:27:56,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:27:56,943 INFO L748 eck$LassoCheckResult]: Stem: Black: 2270#[$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: 2273#[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: 2288#[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] Black: 2308#[L19, $Ultimate##0, $Ultimate##0]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: 2364#[L50, L19, $Ultimate##0]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] 2497#[L52-1, L19, $Ultimate##0]don't care [2024-02-10 00:27:56,943 INFO L750 eck$LassoCheckResult]: Loop: 2497#[L52-1, L19, $Ultimate##0]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: 2668#[L19, L52, $Ultimate##0]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] 2497#[L52-1, L19, $Ultimate##0]don't care [2024-02-10 00:27:56,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:56,944 INFO L85 PathProgramCache]: Analyzing trace with hash 110394008, now seen corresponding path program 1 times [2024-02-10 00:27:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:56,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823231213] [2024-02-10 00:27:56,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:56,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:56,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:56,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:56,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:56,968 INFO L85 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 1 times [2024-02-10 00:27:56,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:56,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274499546] [2024-02-10 00:27:56,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:56,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:56,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:56,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:56,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:56,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1285537638, now seen corresponding path program 1 times [2024-02-10 00:27:56,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:56,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999122636] [2024-02-10 00:27:56,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:56,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:57,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:57,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:57,180 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:27:57,180 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:27:57,180 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:27:57,181 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:27:57,181 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:27:57,181 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:57,181 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:27:57,181 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:27:57,181 INFO L133 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_BEv2_Iteration3_Lasso [2024-02-10 00:27:57,181 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:27:57,181 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:27:57,185 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:27:57,187 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:27:57,260 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:27:57,263 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:27:57,265 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:27:57,411 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:27:57,411 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:27:57,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:57,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:57,413 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:27:57,418 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:27:57,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:57,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:57,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:57,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:57,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:57,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:57,432 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:27:57,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:27:57,442 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:27:57,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:57,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:57,444 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:27:57,447 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:27:57,447 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:27:57,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:57,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:57,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:57,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:57,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:57,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:57,470 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:27:57,478 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-10 00:27:57,478 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 00:27:57,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:57,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:57,480 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:27:57,483 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:27:57,491 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:27:57,500 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:27:57,500 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:27:57,501 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, N) = -1*thread2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2024-02-10 00:27:57,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-02-10 00:27:57,513 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:27:57,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:57,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:27:57,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:57,536 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:27:57,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:57,546 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:27:57,547 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:27:57,547 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:27:57,626 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 00:27:57,627 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:27:57,627 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:27:57,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 400 transitions. [2024-02-10 00:27:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 400 transitions. [2024-02-10 00:27:57,629 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:27:57,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 400 transitions. [2024-02-10 00:27:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 400 transitions. [2024-02-10 00:27:57,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-02-10 00:28:00,423 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:28:00,424 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:28:00,424 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:28:00,425 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:28:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-02-10 00:28:00,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 5 letters. Loop has 2 letters. [2024-02-10 00:28:00,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:00,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 7 letters. Loop has 2 letters. [2024-02-10 00:28:00,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:00,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 5 letters. Loop has 4 letters. [2024-02-10 00:28:00,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:00,426 INFO L428 stractBuchiCegarLoop]: Abstraction has has 68 places, 82892 transitions, 717145 flow [2024-02-10 00:28:00,426 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 00:28:00,426 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:00,426 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 68 places, 82892 transitions, 717145 flow [2024-02-10 00:28:50,306 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 2851 states, 2713 states have (on average 8.035753778105418) internal successors, (21801), 2850 states have internal predecessors, (21801), 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:28:50,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2851 states, 2713 states have (on average 8.035753778105418) internal successors, (21801), 2850 states have internal predecessors, (21801), 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:28:50,433 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-10 00:28:50,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-10 00:28:50,445 INFO L201 PluginConnector]: Adding new model motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:28:50 BoogieIcfgContainer [2024-02-10 00:28:50,446 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:28:50,447 INFO L158 Benchmark]: Toolchain (without parser) took 56427.02ms. Allocated memory was 182.5MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 148.4MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2024-02-10 00:28:50,448 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 182.5MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:28:50,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.13ms. Allocated memory is still 182.5MB. Free memory was 148.4MB in the beginning and 146.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 00:28:50,449 INFO L158 Benchmark]: Boogie Preprocessor took 21.61ms. Allocated memory is still 182.5MB. Free memory was 146.8MB in the beginning and 145.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:28:50,451 INFO L158 Benchmark]: RCFGBuilder took 297.80ms. Allocated memory is still 182.5MB. Free memory was 145.8MB in the beginning and 134.1MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-02-10 00:28:50,451 INFO L158 Benchmark]: BuchiAutomizer took 56075.45ms. Allocated memory was 182.5MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 134.1MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2024-02-10 00:28:50,456 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.10ms. Allocated memory is still 182.5MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.13ms. Allocated memory is still 182.5MB. Free memory was 148.4MB in the beginning and 146.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.61ms. Allocated memory is still 182.5MB. Free memory was 146.8MB in the beginning and 145.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 297.80ms. Allocated memory is still 182.5MB. Free memory was 145.8MB in the beginning and 134.1MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 56075.45ms. Allocated memory was 182.5MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 134.1MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.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). 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. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 55.9s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 3.4s. 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, 263 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 260 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 274 IncrementalHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 165 mSDtfsCounter, 274 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: 72ms 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 - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-10 00:28:50,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...