/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:58:54,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:58:54,155 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:58:54,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:58:54,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:58:54,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:58:54,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:58:54,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:58:54,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:58:54,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:58:54,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:58:54,204 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:58:54,204 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:58:54,206 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:58:54,206 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:58:54,206 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:58:54,207 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:58:54,207 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:58:54,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:58:54,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:58:54,208 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:58:54,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:58:54,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:58:54,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:58:54,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:58:54,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:58:54,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:58:54,211 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:58:54,211 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:58:54,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:58:54,213 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:58:54,213 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:58:54,213 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:58:54,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:58:54,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:58:54,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:58:54,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:58:54,215 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:58:54,215 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 00:58:54,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:58:54,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:58:54,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:58:54,566 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:58:54,566 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:58:54,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update2.bpl [2024-02-10 00:58:54,568 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update2.bpl' [2024-02-10 00:58:54,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:58:54,594 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:58:54,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:58:54,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:58:54,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:58:54,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:54" (1/1) ... [2024-02-10 00:58:54,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:54" (1/1) ... [2024-02-10 00:58:54,616 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 00:58:54,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:58:54,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:58:54,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:58:54,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:58:54,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:54" (1/1) ... [2024-02-10 00:58:54,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:54" (1/1) ... [2024-02-10 00:58:54,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:54" (1/1) ... [2024-02-10 00:58:54,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:54" (1/1) ... [2024-02-10 00:58:54,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:54" (1/1) ... [2024-02-10 00:58:54,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:54" (1/1) ... [2024-02-10 00:58:54,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:54" (1/1) ... [2024-02-10 00:58:54,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:54" (1/1) ... [2024-02-10 00:58:54,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:58:54,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:58:54,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:58:54,671 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:58:54,699 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:54" (1/1) ... [2024-02-10 00:58:54,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:54,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:54,733 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:58:54,748 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:58:54,781 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-02-10 00:58:54,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:58:54,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:58:54,782 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-02-10 00:58:54,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:58:54,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:58:54,782 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-02-10 00:58:54,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-10 00:58:54,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-10 00:58:54,782 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:58:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:58:54,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:58:54,793 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:58:54,846 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:58:54,849 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:58:54,943 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:58:54,964 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:58:54,964 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:58:54,966 INFO L201 PluginConnector]: Adding new model map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:58:54 BoogieIcfgContainer [2024-02-10 00:58:54,966 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:58:54,967 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:58:54,967 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:58:54,970 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:58:54,971 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:58:54,971 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:54" (1/2) ... [2024-02-10 00:58:54,972 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cdd8f0b and model type map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:58:54, skipping insertion in model container [2024-02-10 00:58:54,972 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:58:54,972 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:58:54" (2/2) ... [2024-02-10 00:58:54,973 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-aggr-update2.bpl [2024-02-10 00:58:55,033 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-10 00:58:55,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 91 flow [2024-02-10 00:58:55,075 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2024-02-10 00:58:55,075 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-10 00:58:55,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-02-10 00:58:55,079 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 91 flow [2024-02-10 00:58:55,083 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2024-02-10 00:58:55,088 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:58:55,088 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:58:55,088 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:58:55,088 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:58:55,088 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:58:55,088 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:58:55,088 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:58:55,089 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:58:55,089 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 36 places, 29 transitions, 76 flow [2024-02-10 00:58:55,094 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:58:55,094 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-02-10 00:58:55,094 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 00:58:55,094 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:58:55,097 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:58:55,097 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 36 places, 29 transitions, 76 flow [2024-02-10 00:58:55,099 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:58:55,099 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-02-10 00:58:55,099 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 00:58:55,100 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:58:55,104 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [85] $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[] 45#[L34]true [109] 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] 47#[L34-1, $Ultimate##0]true [88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 49#[L51-1, L34-1]true [2024-02-10 00:58:55,104 INFO L750 eck$LassoCheckResult]: Loop: 49#[L51-1, L34-1]true [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[] 52#[L52, L34-1]true [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] 54#[L34-1, L53]true [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] 49#[L51-1, L34-1]true [2024-02-10 00:58:55,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:55,109 INFO L85 PathProgramCache]: Analyzing trace with hash 114943, now seen corresponding path program 1 times [2024-02-10 00:58:55,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:58:55,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794776614] [2024-02-10 00:58:55,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:58:55,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:58:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:55,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:58:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:55,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:58:55,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:55,221 INFO L85 PathProgramCache]: Analyzing trace with hash 119226, now seen corresponding path program 1 times [2024-02-10 00:58:55,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:58:55,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506418068] [2024-02-10 00:58:55,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:58:55,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:58:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:55,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:58:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:55,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:58:55,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:55,240 INFO L85 PathProgramCache]: Analyzing trace with hash -870610948, now seen corresponding path program 1 times [2024-02-10 00:58:55,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:58:55,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829789142] [2024-02-10 00:58:55,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:58:55,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:58:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:55,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:58:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:55,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:58:55,361 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:58:55,361 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:58:55,361 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:58:55,361 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:58:55,362 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:58:55,362 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:55,362 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:58:55,362 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:58:55,362 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update2.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:58:55,362 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:58:55,362 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:58:55,376 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:58:55,436 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:58:55,489 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:58:55,492 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:58:55,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:55,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:55,497 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:58:55,501 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:58:55,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:55,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:58:55,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:55,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:55,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:55,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:58:55,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:58:55,514 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:58:55,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:55,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-10 00:58:55,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:55,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:55,533 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:58:55,536 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:58:55,536 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:58:55,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:55,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:55,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:55,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:55,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:58:55,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:58:55,564 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:58:55,581 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 00:58:55,581 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 00:58:55,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:55,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:55,603 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:58:55,629 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:58:55,630 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:58:55,648 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:58:55,649 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:58:55,649 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2024-02-10 00:58:55,669 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:58:55,673 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:58:55,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:58:55,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:58:55,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:58:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:58:55,720 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:58:55,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:58:55,750 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:58:55,791 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:58:55,794 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:58:55,954 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:58:56,156 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 439 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:58:56,157 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:58:56,157 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:58:56,158 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:58:56,196 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:58:56,196 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:58:56,198 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:58:56,202 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:58:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-02-10 00:58:56,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 3 letters. Loop has 3 letters. [2024-02-10 00:58:56,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:58:56,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 6 letters. Loop has 3 letters. [2024-02-10 00:58:56,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:58:56,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 3 letters. Loop has 6 letters. [2024-02-10 00:58:56,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:58:56,224 INFO L428 stractBuchiCegarLoop]: Abstraction has has 45 places, 361 transitions, 1663 flow [2024-02-10 00:58:56,224 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:58:56,224 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 places, 361 transitions, 1663 flow [2024-02-10 00:58:56,336 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:58:56,336 INFO L124 PetriNetUnfolderBase]: 257/349 cut-off events. [2024-02-10 00:58:56,336 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-02-10 00:58:56,337 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:58:56,337 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [85] $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[] 45#[L34]true [109] 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] 47#[L34-1, $Ultimate##0]true [112] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_14, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_8, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_pos, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 111#[$Ultimate##0, $Ultimate##0, L35]true [115] 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] 113#[$Ultimate##0, $Ultimate##0, L36, $Ultimate##0]true [101] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] 115#[$Ultimate##0, L85-1, $Ultimate##0, L36]true [2024-02-10 00:58:56,338 INFO L750 eck$LassoCheckResult]: Loop: 115#[$Ultimate##0, L85-1, $Ultimate##0, L36]true [103] L85-1-->L86: 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[] 118#[L86, $Ultimate##0, $Ultimate##0, L36]true [105] L86-->L87: 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] 120#[L87, $Ultimate##0, $Ultimate##0, L36]true [106] L87-->L85-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] 115#[$Ultimate##0, L85-1, $Ultimate##0, L36]true [2024-02-10 00:58:56,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:56,338 INFO L85 PathProgramCache]: Analyzing trace with hash 110486953, now seen corresponding path program 1 times [2024-02-10 00:58:56,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:58:56,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638411666] [2024-02-10 00:58:56,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:58:56,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:58:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:56,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:58:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:56,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:58:56,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:56,348 INFO L85 PathProgramCache]: Analyzing trace with hash 132135, now seen corresponding path program 1 times [2024-02-10 00:58:56,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:58:56,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562825989] [2024-02-10 00:58:56,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:58:56,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:58:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:56,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:58:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:56,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:58:56,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:56,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1571970431, now seen corresponding path program 1 times [2024-02-10 00:58:56,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:58:56,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142779233] [2024-02-10 00:58:56,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:58:56,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:58:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:56,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:58:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:56,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:58:56,492 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:58:56,492 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:58:56,492 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:58:56,492 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:58:56,492 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:58:56,492 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:56,492 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:58:56,492 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:58:56,493 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update2.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:58:56,493 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:58:56,493 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:58:56,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:58:56,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:58:56,501 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:58:56,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:58:56,518 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:58:56,520 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:58:56,523 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:58:56,532 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:58:56,534 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:58:56,536 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:58:56,605 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:58:56,605 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:58:56,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:56,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:56,622 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:58:56,694 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:58:56,695 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:58:56,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:56,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:56,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:56,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:56,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:58:56,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:58:56,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:56,724 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:58:56,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:56,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:56,726 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:58:56,728 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:58:56,730 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:58:56,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:56,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:58:56,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:56,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:56,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:56,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:58:56,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:58:56,746 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:56,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:56,752 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:58:56,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:56,780 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:58:56,782 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:58:56,783 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:58:56,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:56,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:58:56,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:56,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:56,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:56,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:58:56,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:58:56,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:56,844 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:58:56,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:56,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:56,865 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:58:56,916 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:58:56,917 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:58:56,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:56,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:56,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:56,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:56,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:58:56,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:58:56,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:56,951 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:58:56,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:56,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:56,965 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:58:56,996 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:58:57,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:57,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:58:57,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:57,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:57,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:57,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:58:57,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:58:57,006 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:58:57,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:57,046 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:58:57,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:57,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:57,050 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:58:57,073 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:58:57,080 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:58:57,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:57,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:57,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:57,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:57,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:58:57,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:58:57,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:57,120 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:58:57,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:57,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:57,125 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:58:57,128 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:58:57,129 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:58:57,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:57,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:57,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:57,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:57,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:58:57,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:58:57,165 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:58:57,173 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 00:58:57,173 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 00:58:57,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:57,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:57,175 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:58:57,179 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:58:57,179 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:58:57,187 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:58:57,188 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:58:57,188 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_k, N) = -1*thread3Thread1of1ForFork2_k + 1*N Supporting invariants [] [2024-02-10 00:58:57,192 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:58:57,193 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:58:57,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:58:57,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:58:57,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:58:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:58:57,228 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:58:57,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:58:57,246 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:58:57,247 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:58:57,247 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:58:57,335 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 439 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:58:57,335 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:58:57,336 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:58:57,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 439 transitions. [2024-02-10 00:58:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 439 transitions. [2024-02-10 00:58:57,347 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:58:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 439 transitions. [2024-02-10 00:58:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 439 transitions. [2024-02-10 00:58:57,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-02-10 00:58:57,565 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:58:57,565 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:58:57,565 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:58:57,566 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:58:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-02-10 00:58:57,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 5 letters. Loop has 3 letters. [2024-02-10 00:58:57,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:58:57,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 8 letters. Loop has 3 letters. [2024-02-10 00:58:57,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:58:57,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 169 transitions. Stem has 5 letters. Loop has 6 letters. [2024-02-10 00:58:57,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:58:57,567 INFO L428 stractBuchiCegarLoop]: Abstraction has has 58 places, 5838 transitions, 38478 flow [2024-02-10 00:58:57,567 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:58:57,567 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 58 places, 5838 transitions, 38478 flow [2024-02-10 00:58:58,384 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:58:58,384 INFO L124 PetriNetUnfolderBase]: 4138/4944 cut-off events. [2024-02-10 00:58:58,384 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2024-02-10 00:58:58,384 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:58:58,385 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [85] $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[] 45#[L34]true [109] 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] 47#[L34-1, $Ultimate##0]true [88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 49#[L51-1, L34-1]true [89] L51-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} AuxVars[] AssignedVars[] 180#[thread1FINAL, L34-1]true [112] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_14, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_8, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_pos, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 182#[thread1FINAL, $Ultimate##0, L35]true [94] $Ultimate##0-->L64: Formula: (= (+ v_thread2Thread1of1ForFork1_pos_1 1) 0) InVars {} OutVars{thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_pos] 184#[thread1FINAL, L64, L35]true [95] L64-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 186#[thread1FINAL, L65-1, L35]true [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[] 188#[thread1FINAL, L66, L35]true [99] L66-->L70-1: Formula: (and (let ((.cse0 (select v_A_9 v_thread2Thread1of1ForFork1_j_7))) (or (and (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_j_7) (< 0 .cse0)) (and (<= .cse0 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_3)))) (let ((.cse1 (select v_B_7 v_thread2Thread1of1ForFork1_j_7))) (or (and (<= .cse1 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_4)) (and (< 0 .cse1) (= v_thread2Thread1of1ForFork1_pos_4 v_thread2Thread1of1ForFork1_j_7))))) InVars {A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_3, B=v_B_7} OutVars{A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_4, B=v_B_7} AuxVars[v_thread2_pos_16] AssignedVars[thread2Thread1of1ForFork1_pos] 190#[thread1FINAL, L70-1, L35]true [91] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 192#[thread1EXIT, L70-1, L35]true [100] L70-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_10 (+ v_thread2Thread1of1ForFork1_j_9 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 194#[L65-1, thread1EXIT, L35]true [2024-02-10 00:58:58,385 INFO L750 eck$LassoCheckResult]: Loop: 194#[L65-1, thread1EXIT, L35]true [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[] 197#[L66, thread1EXIT, L35]true [99] L66-->L70-1: Formula: (and (let ((.cse0 (select v_A_9 v_thread2Thread1of1ForFork1_j_7))) (or (and (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_j_7) (< 0 .cse0)) (and (<= .cse0 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_3)))) (let ((.cse1 (select v_B_7 v_thread2Thread1of1ForFork1_j_7))) (or (and (<= .cse1 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_4)) (and (< 0 .cse1) (= v_thread2Thread1of1ForFork1_pos_4 v_thread2Thread1of1ForFork1_j_7))))) InVars {A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_3, B=v_B_7} OutVars{A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_4, B=v_B_7} AuxVars[v_thread2_pos_16] AssignedVars[thread2Thread1of1ForFork1_pos] 192#[thread1EXIT, L70-1, L35]true [100] L70-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_10 (+ v_thread2Thread1of1ForFork1_j_9 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 194#[L65-1, thread1EXIT, L35]true [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[] 197#[L66, thread1EXIT, L35]true [99] L66-->L70-1: Formula: (and (let ((.cse0 (select v_A_9 v_thread2Thread1of1ForFork1_j_7))) (or (and (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_j_7) (< 0 .cse0)) (and (<= .cse0 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_3)))) (let ((.cse1 (select v_B_7 v_thread2Thread1of1ForFork1_j_7))) (or (and (<= .cse1 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_4)) (and (< 0 .cse1) (= v_thread2Thread1of1ForFork1_pos_4 v_thread2Thread1of1ForFork1_j_7))))) InVars {A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_3, B=v_B_7} OutVars{A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_4, B=v_B_7} AuxVars[v_thread2_pos_16] AssignedVars[thread2Thread1of1ForFork1_pos] 192#[thread1EXIT, L70-1, L35]true [100] L70-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_10 (+ v_thread2Thread1of1ForFork1_j_9 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 194#[L65-1, thread1EXIT, L35]true [2024-02-10 00:58:58,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:58,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1514058306, now seen corresponding path program 1 times [2024-02-10 00:58:58,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:58:58,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045175000] [2024-02-10 00:58:58,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:58:58,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:58:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:58:58,464 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:58:58,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:58:58,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045175000] [2024-02-10 00:58:58,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045175000] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 00:58:58,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 00:58:58,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-10 00:58:58,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302621825] [2024-02-10 00:58:58,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 00:58:58,468 INFO L753 eck$LassoCheckResult]: stem already infeasible [2024-02-10 00:58:58,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:58,469 INFO L85 PathProgramCache]: Analyzing trace with hash -535931903, now seen corresponding path program 1 times [2024-02-10 00:58:58,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:58:58,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898777989] [2024-02-10 00:58:58,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:58:58,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:58:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:58,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:58:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:58,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:58:58,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:58:58,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-10 00:58:58,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-10 00:58:58,995 INFO L175 Difference]: Start difference. First operand has 58 places, 5838 transitions, 38478 flow. Second operand 5 states and 175 transitions. [2024-02-10 00:58:58,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 5838 transitions, 38478 flow. Second operand 5 states and 175 transitions. [2024-02-10 00:58:58,996 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 35 [2024-02-10 00:58:58,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 00:59:00,254 INFO L124 PetriNetUnfolderBase]: 11167/13467 cut-off events. [2024-02-10 00:59:00,255 INFO L125 PetriNetUnfolderBase]: For 1261/1261 co-relation queries the response was YES. [2024-02-10 00:59:00,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45040 conditions, 13467 events. 11167/13467 cut-off events. For 1261/1261 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 43496 event pairs, 106 based on Foata normal form. 0/5213 useless extension candidates. Maximal degree in co-relation 38624. Up to 5240 conditions per place. [2024-02-10 00:59:00,368 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 117 selfloop transitions, 80 changer transitions 24/1537 dead transitions. [2024-02-10 00:59:00,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 1537 transitions, 10105 flow [2024-02-10 00:59:00,378 INFO L231 Difference]: Finished difference. Result has 64 places, 1513 transitions, 10084 flow [2024-02-10 00:59:00,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-10 00:59:00,381 INFO L428 stractBuchiCegarLoop]: Abstraction has has 64 places, 1513 transitions, 10084 flow [2024-02-10 00:59:00,381 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 00:59:00,381 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 64 places, 1513 transitions, 10084 flow [2024-02-10 00:59:00,480 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:59:00,480 INFO L124 PetriNetUnfolderBase]: 1133/1409 cut-off events. [2024-02-10 00:59:00,480 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2024-02-10 00:59:00,480 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:59:00,481 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [85] $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[] 45#[L34]true [109] 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] 47#[L34-1, $Ultimate##0]true [112] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_14, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_8, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_pos, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 111#[$Ultimate##0, $Ultimate##0, L35]true [94] $Ultimate##0-->L64: Formula: (= (+ v_thread2Thread1of1ForFork1_pos_1 1) 0) InVars {} OutVars{thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_pos] 219#[$Ultimate##0, L64, L35]true [95] L64-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 221#[$Ultimate##0, L65-1, L35]true [88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 223#[L51-1, L65-1, L35]true [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[] 225#[L51-1, L66, L35]true [99] L66-->L70-1: Formula: (and (let ((.cse0 (select v_A_9 v_thread2Thread1of1ForFork1_j_7))) (or (and (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_j_7) (< 0 .cse0)) (and (<= .cse0 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_3)))) (let ((.cse1 (select v_B_7 v_thread2Thread1of1ForFork1_j_7))) (or (and (<= .cse1 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_4)) (and (< 0 .cse1) (= v_thread2Thread1of1ForFork1_pos_4 v_thread2Thread1of1ForFork1_j_7))))) InVars {A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_3, B=v_B_7} OutVars{A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_4, B=v_B_7} AuxVars[v_thread2_pos_16] AssignedVars[thread2Thread1of1ForFork1_pos] 227#[L51-1, L70-1, L35]true [100] L70-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_10 (+ v_thread2Thread1of1ForFork1_j_9 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 223#[L51-1, L65-1, L35]true [2024-02-10 00:59:00,481 INFO L750 eck$LassoCheckResult]: Loop: 223#[L51-1, L65-1, L35]true [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[] 225#[L51-1, L66, L35]true [99] L66-->L70-1: Formula: (and (let ((.cse0 (select v_A_9 v_thread2Thread1of1ForFork1_j_7))) (or (and (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_j_7) (< 0 .cse0)) (and (<= .cse0 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_3)))) (let ((.cse1 (select v_B_7 v_thread2Thread1of1ForFork1_j_7))) (or (and (<= .cse1 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_4)) (and (< 0 .cse1) (= v_thread2Thread1of1ForFork1_pos_4 v_thread2Thread1of1ForFork1_j_7))))) InVars {A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_3, B=v_B_7} OutVars{A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_4, B=v_B_7} AuxVars[v_thread2_pos_16] AssignedVars[thread2Thread1of1ForFork1_pos] 227#[L51-1, L70-1, L35]true [100] L70-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_10 (+ v_thread2Thread1of1ForFork1_j_9 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 223#[L51-1, L65-1, L35]true [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[] 225#[L51-1, L66, L35]true [99] L66-->L70-1: Formula: (and (let ((.cse0 (select v_A_9 v_thread2Thread1of1ForFork1_j_7))) (or (and (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_j_7) (< 0 .cse0)) (and (<= .cse0 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_3)))) (let ((.cse1 (select v_B_7 v_thread2Thread1of1ForFork1_j_7))) (or (and (<= .cse1 0) (= v_thread2_pos_16 v_thread2Thread1of1ForFork1_pos_4)) (and (< 0 .cse1) (= v_thread2Thread1of1ForFork1_pos_4 v_thread2Thread1of1ForFork1_j_7))))) InVars {A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_3, B=v_B_7} OutVars{A=v_A_9, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_4, B=v_B_7} AuxVars[v_thread2_pos_16] AssignedVars[thread2Thread1of1ForFork1_pos] 227#[L51-1, L70-1, L35]true [100] L70-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_10 (+ v_thread2Thread1of1ForFork1_j_9 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 223#[L51-1, L65-1, L35]true [2024-02-10 00:59:00,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:00,482 INFO L85 PathProgramCache]: Analyzing trace with hash 879235138, now seen corresponding path program 1 times [2024-02-10 00:59:00,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:00,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039553006] [2024-02-10 00:59:00,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:00,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:00,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:00,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:00,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:00,517 INFO L85 PathProgramCache]: Analyzing trace with hash -535931903, now seen corresponding path program 2 times [2024-02-10 00:59:00,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:00,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227062755] [2024-02-10 00:59:00,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:00,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:00,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:00,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:00,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:00,543 INFO L85 PathProgramCache]: Analyzing trace with hash -123768958, now seen corresponding path program 2 times [2024-02-10 00:59:00,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:00,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254613145] [2024-02-10 00:59:00,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:00,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:00,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:00,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:00,929 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:59:00,929 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:59:00,929 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:59:00,929 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:59:00,929 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:59:00,930 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:00,930 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:59:00,930 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:59:00,930 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update2.bpl_BEv2_Iteration4_Lasso [2024-02-10 00:59:00,930 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:59:00,930 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:59:00,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:01,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:01,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:01,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:01,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:01,353 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:59:01,353 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:59:01,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:01,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:01,369 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:01,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 00:59:01,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:59:01,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:01,415 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-10 00:59:01,415 INFO L204 nArgumentSynthesizer]: 5 loop disjuncts [2024-02-10 00:59:01,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:01,568 INFO L401 nArgumentSynthesizer]: We have 90 Motzkin's Theorem applications. [2024-02-10 00:59:01,568 INFO L402 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2024-02-10 00:59:01,984 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:59:02,505 INFO L443 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2024-02-10 00:59:02,506 INFO L444 ModelExtractionUtils]: 84 out of 122 variables were initially zero. Simplification set additionally 35 variables to zero. [2024-02-10 00:59:02,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:02,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:02,509 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:02,515 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:59:02,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 00:59:02,547 INFO L438 nArgumentSynthesizer]: Removed 10 redundant supporting invariants from a total of 10. [2024-02-10 00:59:02,548 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:59:02,548 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, N) = -1*thread2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2024-02-10 00:59:02,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:02,574 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 00:59:02,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:59:02,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:59:02,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:59:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:59:02,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 00:59:02,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:59:02,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:59:02,628 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 00:59:02,628 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:59:02,684 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8 states and 406 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:59:02,684 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:59:02,685 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:59:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 406 transitions. [2024-02-10 00:59:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 406 transitions. [2024-02-10 00:59:02,686 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:59:02,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 406 transitions. [2024-02-10 00:59:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 406 transitions. [2024-02-10 00:59:02,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:03,414 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:59:03,414 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:59:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 00:59:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:59:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-02-10 00:59:03,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 9 letters. Loop has 6 letters. [2024-02-10 00:59:03,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:03,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 15 letters. Loop has 6 letters. [2024-02-10 00:59:03,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:03,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 9 letters. Loop has 12 letters. [2024-02-10 00:59:03,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:03,416 INFO L428 stractBuchiCegarLoop]: Abstraction has has 76 places, 22318 transitions, 193884 flow [2024-02-10 00:59:03,417 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-02-10 00:59:03,417 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 76 places, 22318 transitions, 193884 flow [2024-02-10 01:01:48,391 INFO L124 PetriNetUnfolderBase]: 80837/92008 cut-off events. [2024-02-10 01:01:48,391 INFO L125 PetriNetUnfolderBase]: For 12799/12799 co-relation queries the response was YES. [2024-02-10 01:01:48,392 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2024-02-10 01:01:48,398 INFO L201 PluginConnector]: Adding new model map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:01:48 BoogieIcfgContainer [2024-02-10 01:01:48,398 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:01:48,399 INFO L158 Benchmark]: Toolchain (without parser) took 173804.33ms. Allocated memory was 165.7MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 102.1MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2024-02-10 01:01:48,399 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 165.7MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:01:48,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.91ms. Allocated memory is still 165.7MB. Free memory was 102.1MB in the beginning and 100.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:01:48,399 INFO L158 Benchmark]: Boogie Preprocessor took 52.22ms. Allocated memory is still 165.7MB. Free memory was 100.4MB in the beginning and 136.1MB in the end (delta: -35.7MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2024-02-10 01:01:48,400 INFO L158 Benchmark]: RCFGBuilder took 295.74ms. Allocated memory is still 165.7MB. Free memory was 136.0MB in the beginning and 124.7MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-02-10 01:01:48,400 INFO L158 Benchmark]: BuchiAutomizer took 173431.05ms. Allocated memory was 165.7MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 124.6MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2024-02-10 01:01:48,406 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.10ms. Allocated memory is still 165.7MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.91ms. Allocated memory is still 165.7MB. Free memory was 102.1MB in the beginning and 100.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.22ms. Allocated memory is still 165.7MB. Free memory was 100.4MB in the beginning and 136.1MB in the end (delta: -35.7MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * RCFGBuilder took 295.74ms. Allocated memory is still 165.7MB. Free memory was 136.0MB in the beginning and 124.7MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 173431.05ms. Allocated memory was 165.7MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 124.6MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 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 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 173.3s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 4.0s. Construction of modules took 0.3s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/3 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 352 mSDsluCounter, 528 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 241 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 379 IncrementalHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 287 mSDtfsCounter, 379 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital84 mio100 ax100 hnf100 lsp323 ukn39 mio100 lsp100 div100 bol100 ite100 ukn100 eq143 hnf95 smp100 dnf212 smp78 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 1194ms VariablesStem: 6 VariablesLoop: 9 DisjunctsStem: 3 DisjunctsLoop: 5 SupportingInvariants: 10 MotzkinApplications: 90 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 01:01:48,430 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...