/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/map-aggr-update1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:25:31,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:25:31,362 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:25:31,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:25:31,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:25:31,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:25:31,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:25:31,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:25:31,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:25:31,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:25:31,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:25:31,443 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:25:31,443 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:25:31,443 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:25:31,443 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:25:31,444 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:25:31,444 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:25:31,444 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:25:31,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:25:31,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:25:31,444 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:25:31,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:25:31,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:25:31,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:25:31,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:25:31,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:25:31,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:25:31,447 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:25:31,447 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:25:31,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:25:31,448 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:25:31,448 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:25:31,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:25:31,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:25:31,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:25:31,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:25:31,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:25:31,449 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:25:31,449 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:25:31,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:25:31,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:25:31,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:25:31,754 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:25:31,755 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:25:31,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1.bpl [2024-02-10 00:25:31,756 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1.bpl' [2024-02-10 00:25:31,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:25:31,793 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:25:31,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:25:31,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:25:31,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:25:31,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:31" (1/1) ... [2024-02-10 00:25:31,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:31" (1/1) ... [2024-02-10 00:25:31,815 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 00:25:31,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:25:31,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:25:31,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:25:31,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:25:31,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:31" (1/1) ... [2024-02-10 00:25:31,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:31" (1/1) ... [2024-02-10 00:25:31,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:31" (1/1) ... [2024-02-10 00:25:31,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:31" (1/1) ... [2024-02-10 00:25:31,846 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:31" (1/1) ... [2024-02-10 00:25:31,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:31" (1/1) ... [2024-02-10 00:25:31,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:31" (1/1) ... [2024-02-10 00:25:31,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:31" (1/1) ... [2024-02-10 00:25:31,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:25:31,876 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:25:31,876 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:25:31,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:25:31,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:31" (1/1) ... [2024-02-10 00:25:31,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:31,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:31,995 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:25:32,013 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:25:32,036 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-02-10 00:25:32,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:25:32,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:25:32,036 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-02-10 00:25:32,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:25:32,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:25:32,036 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-02-10 00:25:32,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-10 00:25:32,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-10 00:25:32,037 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:25:32,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:25:32,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:25:32,038 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:25:32,079 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:25:32,081 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:25:32,172 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:25:32,178 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:25:32,178 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:25:32,179 INFO L201 PluginConnector]: Adding new model map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:25:32 BoogieIcfgContainer [2024-02-10 00:25:32,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:25:32,180 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:25:32,180 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:25:32,196 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:25:32,196 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:25:32,196 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:25:31" (1/2) ... [2024-02-10 00:25:32,198 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@560d7be and model type map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:25:32, skipping insertion in model container [2024-02-10 00:25:32,198 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:25:32,198 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:25:32" (2/2) ... [2024-02-10 00:25:32,199 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-aggr-update1.bpl [2024-02-10 00:25:32,256 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-10 00:25:32,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 101 flow [2024-02-10 00:25:32,308 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2024-02-10 00:25:32,308 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-10 00:25:32,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 5/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2024-02-10 00:25:32,313 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 40 transitions, 101 flow [2024-02-10 00:25:32,316 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 86 flow [2024-02-10 00:25:32,321 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:25:32,321 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:25:32,322 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:25:32,322 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:25:32,322 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:25:32,322 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:25:32,322 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:25:32,322 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:25:32,322 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:32,323 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 39 places, 34 transitions, 86 flow [2024-02-10 00:25:32,371 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 498 states, 496 states have (on average 3.157258064516129) internal successors, (1566), 497 states have internal predecessors, (1566), 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:25:32,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 498 states, 496 states have (on average 3.157258064516129) internal successors, (1566), 497 states have internal predecessors, (1566), 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:25:32,416 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 426 [2024-02-10 00:25:32,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:25:32,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:25:32,420 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:25:32,420 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:32,420 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 39 places, 34 transitions, 86 flow [2024-02-10 00:25:32,434 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 498 states, 496 states have (on average 3.157258064516129) internal successors, (1566), 497 states have internal predecessors, (1566), 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:25:32,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 498 states, 496 states have (on average 3.157258064516129) internal successors, (1566), 497 states have internal predecessors, (1566), 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:25:32,445 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 426 [2024-02-10 00:25:32,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:25:32,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:25:32,450 INFO L748 eck$LassoCheckResult]: Stem: Black: 1043#[$Ultimate##0]don't care [83] $Ultimate##0-->L34: 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[] 1046#[L34]don't care [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 1048#[$Ultimate##0, L34-1]don't care [88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 1050#[L34-1, L51-1]don't care [2024-02-10 00:25:32,450 INFO L750 eck$LassoCheckResult]: Loop: 1050#[L34-1, L51-1]don't care [90] L51-1-->L52: 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[] 1056#[L34-1, L52]don't care [92] L52-->L53: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork0_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A] 1068#[L53, L34-1]don't care [93] L53-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 1050#[L34-1, L51-1]don't care [2024-02-10 00:25:32,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:32,463 INFO L85 PathProgramCache]: Analyzing trace with hash 113176, now seen corresponding path program 1 times [2024-02-10 00:25:32,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:32,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403862686] [2024-02-10 00:25:32,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:32,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:32,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:32,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:32,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:32,578 INFO L85 PathProgramCache]: Analyzing trace with hash 119226, now seen corresponding path program 1 times [2024-02-10 00:25:32,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:32,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237260161] [2024-02-10 00:25:32,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:32,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:32,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:32,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:32,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:32,598 INFO L85 PathProgramCache]: Analyzing trace with hash -923251645, now seen corresponding path program 1 times [2024-02-10 00:25:32,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:32,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495525456] [2024-02-10 00:25:32,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:32,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:32,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:32,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:32,759 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:25:32,759 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:25:32,759 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:25:32,760 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:25:32,760 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:25:32,760 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:32,760 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:25:32,760 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:25:32,760 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:25:32,760 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:25:32,760 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:25:32,774 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:25:32,815 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:25:32,865 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:25:32,868 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:25:32,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:32,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:32,874 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:25:32,878 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:25:32,880 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:25:32,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:32,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:25:32,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:32,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:32,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:32,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:25:32,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:25:32,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:32,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-10 00:25:32,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:32,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:32,911 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:25:32,913 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:25:32,913 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:25:32,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:32,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:32,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:32,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:32,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:32,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:32,953 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:25:32,968 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 00:25:32,968 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 00:25:32,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:32,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:32,972 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:25:32,977 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:25:32,978 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:25:32,987 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:25:32,987 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:25:32,988 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2024-02-10 00:25:32,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-10 00:25:32,999 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:25:33,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:33,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:25:33,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:33,046 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:25:33,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:33,065 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:25:33,091 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:25:33,093 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:25:33,261 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 504 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:25:33,262 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:25:33,262 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:25:33,263 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:25:33,301 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:25:33,302 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:25:33,304 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:25:33,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:25:33,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2024-02-10 00:25:33,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 3 letters. Loop has 3 letters. [2024-02-10 00:25:33,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:33,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 6 letters. Loop has 3 letters. [2024-02-10 00:25:33,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:33,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 3 letters. Loop has 6 letters. [2024-02-10 00:25:33,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:33,315 INFO L428 stractBuchiCegarLoop]: Abstraction has has 48 places, 426 transitions, 1923 flow [2024-02-10 00:25:33,315 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:25:33,315 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:33,316 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 48 places, 426 transitions, 1923 flow [2024-02-10 00:25:33,392 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1064 states, 1058 states have (on average 4.7240075614366726) internal successors, (4998), 1063 states have internal predecessors, (4998), 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:25:33,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1064 states, 1058 states have (on average 4.7240075614366726) internal successors, (4998), 1063 states have internal predecessors, (4998), 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:25:33,421 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 375 [2024-02-10 00:25:33,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:25:33,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:25:33,427 INFO L748 eck$LassoCheckResult]: Stem: Black: 2083#[$Ultimate##0]don't care [83] $Ultimate##0-->L34: 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: 2086#[L34]don't care [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 2094#[$Ultimate##0, L34-1]don't care [117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] 2102#[$Ultimate##0, L35, $Ultimate##0]don't care [120] L35-->$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_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k] 2130#[$Ultimate##0, L36, $Ultimate##0, $Ultimate##0]don't care [106] $Ultimate##0-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] 2181#[L36, L83-1, $Ultimate##0, $Ultimate##0]don't care [2024-02-10 00:25:33,427 INFO L750 eck$LassoCheckResult]: Loop: 2181#[L36, L83-1, $Ultimate##0, $Ultimate##0]don't care [108] L83-1-->L84: 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[] 2265#[$Ultimate##0, L36, L84, $Ultimate##0]don't care [110] L84-->L85: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork2_k_7 v_thread3Thread1of1ForFork2_k_7)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_3} AuxVars[] AssignedVars[B] 2413#[L36, L85, $Ultimate##0, $Ultimate##0]don't care [111] L85-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_10 (+ v_thread3Thread1of1ForFork2_k_9 1)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_9} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] 2181#[L36, L83-1, $Ultimate##0, $Ultimate##0]don't care [2024-02-10 00:25:33,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:33,428 INFO L85 PathProgramCache]: Analyzing trace with hash 108793831, now seen corresponding path program 1 times [2024-02-10 00:25:33,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:33,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735879242] [2024-02-10 00:25:33,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:33,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:33,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:33,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:33,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:33,459 INFO L85 PathProgramCache]: Analyzing trace with hash 137100, now seen corresponding path program 1 times [2024-02-10 00:25:33,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:33,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526628354] [2024-02-10 00:25:33,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:33,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:33,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:33,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:33,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:33,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1623181850, now seen corresponding path program 1 times [2024-02-10 00:25:33,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:33,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910080851] [2024-02-10 00:25:33,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:33,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:33,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:33,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:33,594 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:25:33,594 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:25:33,594 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:25:33,594 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:25:33,594 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:25:33,594 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:33,594 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:25:33,595 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:25:33,595 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:25:33,595 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:25:33,595 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:25:33,597 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:25:33,601 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:25:33,603 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:25:33,614 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:25:33,615 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:25:33,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 00:25:33,620 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:25:33,624 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:25:33,627 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:25:33,629 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:25:33,698 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:25:33,699 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:25:33,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:33,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:33,700 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:25:33,707 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:25:33,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:33,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:33,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:33,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:33,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:33,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:33,723 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:25:33,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:33,737 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:25:33,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:33,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:33,740 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:25:33,746 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:25:33,760 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:25:33,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:33,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:25:33,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:33,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:33,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:33,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:25:33,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:25:33,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:33,791 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:25:33,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:33,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:33,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:25:33,799 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:25:33,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:33,806 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:25:33,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:33,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:33,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:33,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:33,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:33,829 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:25:33,842 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-02-10 00:25:33,842 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-02-10 00:25:33,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:33,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:33,845 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:25:33,850 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:25:33,859 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:25:33,861 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:25:33,861 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:25:33,861 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_k, N) = -1*thread3Thread1of1ForFork2_k + 1*N Supporting invariants [] [2024-02-10 00:25:33,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:25:33,872 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:25:33,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:33,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:25:33,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:33,908 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:25:33,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:33,928 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:25:33,929 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:25:33,929 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:25:34,006 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 504 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:25:34,006 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:25:34,006 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:25:34,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 504 transitions. [2024-02-10 00:25:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 504 transitions. [2024-02-10 00:25:34,013 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:25:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 504 transitions. [2024-02-10 00:25:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 504 transitions. [2024-02-10 00:25:34,117 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:25:34,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-02-10 00:25:34,262 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:25:34,264 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:25:34,265 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:25:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:25:34,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2024-02-10 00:25:34,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 5 letters. Loop has 3 letters. [2024-02-10 00:25:34,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:34,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 8 letters. Loop has 3 letters. [2024-02-10 00:25:34,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:34,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 5 letters. Loop has 6 letters. [2024-02-10 00:25:34,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:34,268 INFO L428 stractBuchiCegarLoop]: Abstraction has has 61 places, 6943 transitions, 45108 flow [2024-02-10 00:25:34,268 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:25:34,268 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:34,268 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 61 places, 6943 transitions, 45108 flow [2024-02-10 00:25:35,756 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 2751 states, 2721 states have (on average 6.228959941198089) internal successors, (16949), 2750 states have internal predecessors, (16949), 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:25:35,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2751 states, 2721 states have (on average 6.228959941198089) internal successors, (16949), 2750 states have internal predecessors, (16949), 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:25:35,802 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 576 [2024-02-10 00:25:35,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:25:35,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:25:35,803 INFO L748 eck$LassoCheckResult]: Stem: Black: 4832#[$Ultimate##0]don't care [83] $Ultimate##0-->L34: 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: 4835#[L34]don't care [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] Black: 4847#[$Ultimate##0, L34-1]don't care [117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] Black: 4864#[L35, $Ultimate##0, $Ultimate##0]don't care [94] $Ultimate##0-->L64: Formula: (= v_thread2Thread1of1ForFork1_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_cnt] Black: 4904#[L35, L64, $Ultimate##0]don't care [95] L64-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 5022#[L35, L65-1, $Ultimate##0]don't care [2024-02-10 00:25:35,803 INFO L750 eck$LassoCheckResult]: Loop: 5022#[L35, L65-1, $Ultimate##0]don't care [97] L65-1-->L66: 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: 5178#[L35, $Ultimate##0, L66]don't care [100] L66-->L66-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork1_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} AuxVars[] AssignedVars[] 5436#[L35, L66-2, $Ultimate##0]don't care [103] L66-2-->L69-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork1_j_13) 0) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_13, B=v_B_2} AuxVars[] AssignedVars[] Black: 5911#[L35, L69-1, $Ultimate##0]don't care [105] L69-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_16 (+ v_thread2Thread1of1ForFork1_j_15 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_15} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 5022#[L35, L65-1, $Ultimate##0]don't care [2024-02-10 00:25:35,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:35,804 INFO L85 PathProgramCache]: Analyzing trace with hash 108793014, now seen corresponding path program 1 times [2024-02-10 00:25:35,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:35,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048347799] [2024-02-10 00:25:35,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:35,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:35,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:35,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:35,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash 3912646, now seen corresponding path program 1 times [2024-02-10 00:25:35,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:35,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139677344] [2024-02-10 00:25:35,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:35,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:35,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:35,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:35,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:35,817 INFO L85 PathProgramCache]: Analyzing trace with hash 466116091, now seen corresponding path program 1 times [2024-02-10 00:25:35,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:25:35,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521492720] [2024-02-10 00:25:35,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:25:35,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:25:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:35,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:25:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:25:35,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:25:35,879 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:25:35,879 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:25:35,879 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:25:35,879 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:25:35,879 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:25:35,879 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:35,879 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:25:35,879 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:25:35,879 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_BEv2_Iteration3_Lasso [2024-02-10 00:25:35,879 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:25:35,880 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:25:35,882 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:25:35,884 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:25:35,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:25:35,896 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:25:35,898 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:25:35,900 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:25:35,950 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:25:35,951 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:25:35,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:35,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:35,952 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:25:35,957 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:25:35,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:35,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:35,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:35,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:35,968 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:25:35,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:35,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:35,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:35,991 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:25:35,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:35,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:35,993 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:25:36,010 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:25:36,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:36,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:25:36,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:36,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:36,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:36,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:25:36,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:25:36,021 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:25:36,029 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:36,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-10 00:25:36,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:36,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:36,037 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:25:36,041 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:25:36,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:36,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:25:36,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:36,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:36,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:36,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:25:36,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:25:36,050 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:25:36,072 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:25:36,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-10 00:25:36,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:36,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:36,093 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:25:36,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-10 00:25:36,099 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:25:36,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:25:36,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:25:36,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:25:36,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:25:36,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:25:36,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:25:36,128 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:25:36,146 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 00:25:36,146 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 00:25:36,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:25:36,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:25:36,149 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:25:36,152 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:25:36,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 00:25:36,181 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:25:36,181 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:25:36,181 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, N) = -1*thread2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2024-02-10 00:25:36,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-10 00:25:36,189 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:25:36,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:25:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:36,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:25:36,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:25:36,222 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:25:36,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:25:36,262 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:25:36,263 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:25:36,263 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:25:36,346 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 504 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:25:36,346 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:25:36,346 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:25:36,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 504 transitions. [2024-02-10 00:25:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 504 transitions. [2024-02-10 00:25:36,347 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:25:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 504 transitions. [2024-02-10 00:25:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 504 transitions. [2024-02-10 00:25:36,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-02-10 00:25:39,746 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:25:39,746 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:25:39,746 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:25:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:25:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2024-02-10 00:25:39,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 5 letters. Loop has 4 letters. [2024-02-10 00:25:39,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:39,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 9 letters. Loop has 4 letters. [2024-02-10 00:25:39,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:39,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 5 letters. Loop has 8 letters. [2024-02-10 00:25:39,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:25:39,748 INFO L428 stractBuchiCegarLoop]: Abstraction has has 74 places, 112948 transitions, 957593 flow [2024-02-10 00:25:39,748 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 00:25:39,748 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:25:39,748 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 74 places, 112948 transitions, 957593 flow [2024-02-10 00:27:57,992 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 6180 states, 6042 states have (on average 8.707050645481628) internal successors, (52608), 6179 states have internal predecessors, (52608), 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:58,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6180 states, 6042 states have (on average 8.707050645481628) internal successors, (52608), 6179 states have internal predecessors, (52608), 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:58,102 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-10 00:27:58,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-10 00:27:58,112 INFO L201 PluginConnector]: Adding new model map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:27:58 BoogieIcfgContainer [2024-02-10 00:27:58,112 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:27:58,113 INFO L158 Benchmark]: Toolchain (without parser) took 146319.16ms. Allocated memory was 195.0MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 157.8MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2024-02-10 00:27:58,113 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 195.0MB. Free memory is still 158.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:27:58,113 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.74ms. Allocated memory is still 195.0MB. Free memory was 157.8MB in the beginning and 156.2MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-02-10 00:27:58,115 INFO L158 Benchmark]: Boogie Preprocessor took 57.93ms. Allocated memory is still 195.0MB. Free memory was 156.2MB in the beginning and 168.2MB in the end (delta: -12.0MB). Peak memory consumption was 3.6MB. Max. memory is 8.0GB. [2024-02-10 00:27:58,116 INFO L158 Benchmark]: RCFGBuilder took 303.49ms. Allocated memory is still 195.0MB. Free memory was 168.2MB in the beginning and 158.3MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-10 00:27:58,118 INFO L158 Benchmark]: BuchiAutomizer took 145931.53ms. Allocated memory was 195.0MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 158.1MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2024-02-10 00:27:58,121 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 195.0MB. Free memory is still 158.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.74ms. Allocated memory is still 195.0MB. Free memory was 157.8MB in the beginning and 156.2MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.93ms. Allocated memory is still 195.0MB. Free memory was 156.2MB in the beginning and 168.2MB in the end (delta: -12.0MB). Peak memory consumption was 3.6MB. Max. memory is 8.0GB. * RCFGBuilder took 303.49ms. Allocated memory is still 195.0MB. Free memory was 168.2MB in the beginning and 158.3MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 145931.53ms. Allocated memory was 195.0MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 158.1MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 4.2GB. 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 145.8s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 4.1s. 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, 334 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 331 mSDsluCounter, 453 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 269 IncrementalHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 246 mSDtfsCounter, 269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital49 mio100 ax100 hnf100 lsp92 ukn65 mio100 lsp93 div100 bol100 ite100 ukn100 eq143 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 77ms 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:27:58,149 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...