/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-update1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:58:33,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:58:33,386 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:33,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:58:33,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:58:33,390 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:33,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:58:33,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:58:33,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:58:33,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:58:33,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:58:33,420 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:58:33,420 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:58:33,420 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:58:33,421 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:58:33,421 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:58:33,421 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:58:33,421 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:58:33,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:58:33,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:58:33,422 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:58:33,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:58:33,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:58:33,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:58:33,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:58:33,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:58:33,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:58:33,430 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:58:33,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:58:33,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:58:33,431 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:58:33,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:58:33,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:58:33,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:58:33,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:58:33,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:58:33,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:58:33,432 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:58:33,433 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:33,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:58:33,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:58:33,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:58:33,816 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:58:33,821 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:58:33,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1.bpl [2024-02-10 00:58:33,823 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1.bpl' [2024-02-10 00:58:33,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:58:33,862 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:58:33,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:58:33,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:58:33,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:58:33,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:33" (1/1) ... [2024-02-10 00:58:33,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:33" (1/1) ... [2024-02-10 00:58:33,916 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 00:58:33,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:58:33,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:58:33,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:58:33,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:58:33,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:33" (1/1) ... [2024-02-10 00:58:33,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:33" (1/1) ... [2024-02-10 00:58:33,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:33" (1/1) ... [2024-02-10 00:58:33,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:33" (1/1) ... [2024-02-10 00:58:33,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:33" (1/1) ... [2024-02-10 00:58:33,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:33" (1/1) ... [2024-02-10 00:58:33,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:33" (1/1) ... [2024-02-10 00:58:33,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:33" (1/1) ... [2024-02-10 00:58:33,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:58:33,955 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:58:33,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:58:33,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:58:33,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:33" (1/1) ... [2024-02-10 00:58:33,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:33,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:34,028 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:34,068 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:34,109 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-02-10 00:58:34,109 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:58:34,109 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:58:34,110 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-02-10 00:58:34,110 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:58:34,110 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:58:34,110 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-02-10 00:58:34,110 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-10 00:58:34,110 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-10 00:58:34,110 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:58:34,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:58:34,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:58:34,111 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:34,156 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:58:34,158 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:58:34,311 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:58:34,318 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:58:34,318 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:58:34,320 INFO L201 PluginConnector]: Adding new model map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:58:34 BoogieIcfgContainer [2024-02-10 00:58:34,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:58:34,321 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:58:34,321 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:58:34,325 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:58:34,325 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:58:34,326 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:33" (1/2) ... [2024-02-10 00:58:34,327 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48c7ab1a and model type map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:58:34, skipping insertion in model container [2024-02-10 00:58:34,328 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:58:34,328 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:58:34" (2/2) ... [2024-02-10 00:58:34,331 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-aggr-update1.bpl [2024-02-10 00:58:34,402 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-10 00:58:34,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 101 flow [2024-02-10 00:58:34,447 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2024-02-10 00:58:34,447 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-10 00:58:34,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 5/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2024-02-10 00:58:34,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 40 transitions, 101 flow [2024-02-10 00:58:34,457 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 86 flow [2024-02-10 00:58:34,462 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:58:34,463 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:58:34,463 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:58:34,463 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:58:34,463 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:58:34,463 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:58:34,463 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:58:34,463 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:58:34,464 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 places, 34 transitions, 86 flow [2024-02-10 00:58:34,469 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:58:34,469 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-02-10 00:58:34,469 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 00:58:34,469 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:58:34,472 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:58:34,472 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 places, 34 transitions, 86 flow [2024-02-10 00:58:34,476 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:58:34,476 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-02-10 00:58:34,477 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 00:58:34,477 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:58:34,481 INFO L748 eck$LassoCheckResult]: Stem: 46#[$Ultimate##0]true [83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 48#[L34]true [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 50#[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] 52#[L51-1, L34-1]true [2024-02-10 00:58:34,482 INFO L750 eck$LassoCheckResult]: Loop: 52#[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[] 55#[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] 57#[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] 52#[L51-1, L34-1]true [2024-02-10 00:58:34,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash 113176, now seen corresponding path program 1 times [2024-02-10 00:58:34,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:58:34,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413123380] [2024-02-10 00:58:34,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:58:34,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:58:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:34,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:58:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:34,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:58:34,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:34,592 INFO L85 PathProgramCache]: Analyzing trace with hash 119226, now seen corresponding path program 1 times [2024-02-10 00:58:34,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:58:34,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342656271] [2024-02-10 00:58:34,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:58:34,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:58:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:34,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:58:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:34,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:58:34,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash -923251645, now seen corresponding path program 1 times [2024-02-10 00:58:34,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:58:34,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967218025] [2024-02-10 00:58:34,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:58:34,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:58:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:34,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:58:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:34,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:58:34,792 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:58:34,793 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:58:34,793 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:58:34,793 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:58:34,793 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:58:34,793 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:34,793 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:58:34,794 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:58:34,794 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:58:34,794 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:58:34,794 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:58:34,811 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:34,844 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:34,891 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:58:34,897 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:58:34,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:34,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:34,902 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:34,903 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:34,905 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:34,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:34,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:58:34,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:34,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:34,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:34,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:58:34,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:58:34,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:34,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-10 00:58:34,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:34,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:34,946 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:34,949 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:34,950 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:34,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:34,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:34,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:34,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:34,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:58:34,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:58:34,975 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:58:34,990 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 00:58:34,990 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 00:58:34,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:34,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:35,003 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:35,009 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:35,012 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:58:35,033 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:58:35,034 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:58:35,034 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:35,041 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:35,044 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:58:35,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:58:35,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:58:35,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:58:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:58:35,109 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:58:35,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:58:35,146 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:35,184 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:35,187 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:35,275 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:35,427 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 504 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:58:35,428 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:58:35,428 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:58:35,429 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:58:35,456 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:58:35,457 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:58:35,459 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:35,466 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:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2024-02-10 00:58:35,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 3 letters. Loop has 3 letters. [2024-02-10 00:58:35,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:58:35,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 6 letters. Loop has 3 letters. [2024-02-10 00:58:35,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:58:35,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 3 letters. Loop has 6 letters. [2024-02-10 00:58:35,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:58:35,475 INFO L428 stractBuchiCegarLoop]: Abstraction has has 48 places, 426 transitions, 1923 flow [2024-02-10 00:58:35,475 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:58:35,476 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 places, 426 transitions, 1923 flow [2024-02-10 00:58:35,568 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:58:35,568 INFO L124 PetriNetUnfolderBase]: 387/506 cut-off events. [2024-02-10 00:58:35,568 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-02-10 00:58:35,568 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:58:35,569 INFO L748 eck$LassoCheckResult]: Stem: 46#[$Ultimate##0]true [83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 48#[L34]true [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 50#[L34-1, $Ultimate##0]true [117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] 114#[$Ultimate##0, $Ultimate##0, L35]true [120] L35-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k] 116#[$Ultimate##0, $Ultimate##0, L36, $Ultimate##0]true [106] $Ultimate##0-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] 118#[$Ultimate##0, L83-1, $Ultimate##0, L36]true [108] L83-1-->L84: Formula: (< v_thread3Thread1of1ForFork2_k_5 v_N_5) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} AuxVars[] AssignedVars[] 120#[$Ultimate##0, $Ultimate##0, L36, L84]true [110] L84-->L85: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork2_k_7 v_thread3Thread1of1ForFork2_k_7)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_3} AuxVars[] AssignedVars[B] 122#[L85, $Ultimate##0, $Ultimate##0, L36]true [111] L85-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_10 (+ v_thread3Thread1of1ForFork2_k_9 1)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_9} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] 118#[$Ultimate##0, L83-1, $Ultimate##0, L36]true [2024-02-10 00:58:35,569 INFO L750 eck$LassoCheckResult]: Loop: 118#[$Ultimate##0, L83-1, $Ultimate##0, L36]true [108] L83-1-->L84: Formula: (< v_thread3Thread1of1ForFork2_k_5 v_N_5) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} AuxVars[] AssignedVars[] 120#[$Ultimate##0, $Ultimate##0, L36, L84]true [110] L84-->L85: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork2_k_7 v_thread3Thread1of1ForFork2_k_7)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_3} AuxVars[] AssignedVars[B] 122#[L85, $Ultimate##0, $Ultimate##0, L36]true [111] L85-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_10 (+ v_thread3Thread1of1ForFork2_k_9 1)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_9} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] 118#[$Ultimate##0, L83-1, $Ultimate##0, L36]true [2024-02-10 00:58:35,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:35,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1623181850, now seen corresponding path program 1 times [2024-02-10 00:58:35,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:58:35,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405707479] [2024-02-10 00:58:35,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:58:35,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:58:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:35,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:58:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:35,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:58:35,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:35,586 INFO L85 PathProgramCache]: Analyzing trace with hash 137100, now seen corresponding path program 1 times [2024-02-10 00:58:35,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:58:35,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423696528] [2024-02-10 00:58:35,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:58:35,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:58:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:35,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:58:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:35,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:58:35,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash 826399623, now seen corresponding path program 2 times [2024-02-10 00:58:35,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:58:35,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518281047] [2024-02-10 00:58:35,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:58:35,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:58:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:35,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:58:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:35,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:58:35,746 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:58:35,746 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:58:35,746 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:58:35,746 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:58:35,746 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:58:35,746 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:35,746 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:58:35,746 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:58:35,747 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:58:35,747 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:58:35,747 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:58:35,748 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:35,751 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:35,754 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:35,756 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:35,759 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:35,763 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:35,765 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:35,768 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:35,771 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:35,802 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:35,882 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:58:35,882 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:58:35,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:35,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:35,884 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:35,888 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:35,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:35,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:35,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:35,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:35,900 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:35,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:58:35,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:58:35,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:35,943 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:35,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:35,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:35,951 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:35,952 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:35,956 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:35,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:35,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:35,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:35,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:35,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:58:35,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:58:35,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:35,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-02-10 00:58:35,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:35,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:35,995 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:36,000 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:36,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:36,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:36,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:36,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:36,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:58:36,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:58:36,015 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:36,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:36,044 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:36,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:36,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:36,061 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:36,076 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:36,077 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:36,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:36,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:36,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:36,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:36,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:58:36,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:58:36,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:36,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-10 00:58:36,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:36,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:36,135 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:36,157 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:36,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:36,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:36,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:36,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:36,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:58:36,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:58:36,170 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:36,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:36,219 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:36,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:36,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:36,237 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:36,239 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:36,241 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:36,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:36,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:36,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:36,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:36,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:58:36,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:58:36,262 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:36,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-02-10 00:58:36,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:36,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:36,271 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:36,275 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:36,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:36,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:58:36,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:36,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:36,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:36,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:58:36,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:58:36,291 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:36,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:36,303 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:36,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:36,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:36,306 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:36,312 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:36,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:36,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:58:36,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:36,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:36,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:36,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:58:36,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:58:36,322 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:36,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:36,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-10 00:58:36,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:36,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:36,337 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:58:36,343 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:36,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:36,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:36,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:36,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:36,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:58:36,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:58:36,362 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:58:36,367 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:58:36,406 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 00:58:36,407 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 00:58:36,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:36,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:36,408 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:58:36,420 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:58:36,421 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:58:36,442 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:58:36,442 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:58:36,442 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:36,449 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:58:36,450 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:58:36,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:58:36,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:58:36,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:58:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:58:36,492 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:58:36,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:58:36,514 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:36,515 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:36,515 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:58:36,612 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 504 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:58:36,612 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:58:36,612 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:58:36,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 504 transitions. [2024-02-10 00:58:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 504 transitions. [2024-02-10 00:58:36,624 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:58:36,644 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:58:36,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 504 transitions. [2024-02-10 00:58:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 504 transitions. [2024-02-10 00:58:36,888 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:58:36,889 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:58:36,889 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:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:58:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2024-02-10 00:58:36,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 8 letters. Loop has 3 letters. [2024-02-10 00:58:36,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:58:36,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 11 letters. Loop has 3 letters. [2024-02-10 00:58:36,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:58:36,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 8 letters. Loop has 6 letters. [2024-02-10 00:58:36,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:58:36,894 INFO L428 stractBuchiCegarLoop]: Abstraction has has 61 places, 6943 transitions, 45108 flow [2024-02-10 00:58:36,894 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:58:36,895 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 61 places, 6943 transitions, 45108 flow [2024-02-10 00:58:37,649 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:58:37,649 INFO L124 PetriNetUnfolderBase]: 2654/3151 cut-off events. [2024-02-10 00:58:37,649 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2024-02-10 00:58:37,649 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:58:37,650 INFO L748 eck$LassoCheckResult]: Stem: 46#[$Ultimate##0]true [83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 48#[L34]true [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 50#[L34-1, $Ultimate##0]true [117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] 114#[$Ultimate##0, $Ultimate##0, L35]true [94] $Ultimate##0-->L64: Formula: (= v_thread2Thread1of1ForFork1_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_cnt] 195#[$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] 197#[$Ultimate##0, 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[] 199#[$Ultimate##0, L66, L35]true [100] L66-->L66-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork1_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} AuxVars[] AssignedVars[] 201#[L66-2, $Ultimate##0, L35]true [103] L66-2-->L69-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork1_j_13) 0) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_13, B=v_B_2} AuxVars[] AssignedVars[] 203#[$Ultimate##0, L69-1, L35]true [105] L69-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_16 (+ v_thread2Thread1of1ForFork1_j_15 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_15} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 197#[$Ultimate##0, L65-1, L35]true [2024-02-10 00:58:37,650 INFO L750 eck$LassoCheckResult]: Loop: 197#[$Ultimate##0, 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[] 199#[$Ultimate##0, L66, L35]true [100] L66-->L66-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork1_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} AuxVars[] AssignedVars[] 201#[L66-2, $Ultimate##0, L35]true [103] L66-2-->L69-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork1_j_13) 0) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_13, B=v_B_2} AuxVars[] AssignedVars[] 203#[$Ultimate##0, L69-1, L35]true [105] L69-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_16 (+ v_thread2Thread1of1ForFork1_j_15 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_15} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 197#[$Ultimate##0, L65-1, L35]true [2024-02-10 00:58:37,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:37,651 INFO L85 PathProgramCache]: Analyzing trace with hash 466116091, now seen corresponding path program 1 times [2024-02-10 00:58:37,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:58:37,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231942786] [2024-02-10 00:58:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:58:37,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:58:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:37,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:58:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:37,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:58:37,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:37,683 INFO L85 PathProgramCache]: Analyzing trace with hash 3912646, now seen corresponding path program 1 times [2024-02-10 00:58:37,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:58:37,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689382156] [2024-02-10 00:58:37,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:58:37,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:58:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:37,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:58:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:37,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:58:37,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:37,703 INFO L85 PathProgramCache]: Analyzing trace with hash 609256640, now seen corresponding path program 2 times [2024-02-10 00:58:37,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:58:37,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223126314] [2024-02-10 00:58:37,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:58:37,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:58:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:37,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:58:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:58:37,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:58:37,833 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:58:37,834 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:58:37,834 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:58:37,834 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:58:37,834 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:58:37,834 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:37,834 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:58:37,836 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:58:37,836 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_BEv2_Iteration3_Lasso [2024-02-10 00:58:37,836 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:58:37,836 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:58:37,839 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:37,842 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:37,866 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:37,869 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:37,871 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:37,874 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:37,981 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:58:37,982 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:58:37,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:37,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:37,999 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:58:38,029 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:38,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:38,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:38,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:38,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:38,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:58:38,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:58:38,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-10 00:58:38,060 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:38,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-10 00:58:38,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:38,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:38,085 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:58:38,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-02-10 00:58:38,149 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:38,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:38,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:38,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:38,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:38,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:58:38,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:58:38,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:38,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-02-10 00:58:38,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:38,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:38,185 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:58:38,190 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:38,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:38,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:58:38,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:38,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:38,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:38,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:58:38,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:58:38,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-02-10 00:58:38,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:38,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-02-10 00:58:38,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:38,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:38,216 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:58:38,222 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:38,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:38,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:58:38,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:38,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:38,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:38,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:58:38,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:58:38,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-02-10 00:58:38,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:38,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-02-10 00:58:38,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:38,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:38,250 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:58:38,255 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:38,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:38,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:38,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:38,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:38,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:58:38,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:58:38,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-02-10 00:58:38,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:58:38,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-02-10 00:58:38,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:38,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:38,301 INFO L229 MonitoredProcess]: Starting monitored process 20 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:38,304 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:38,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:58:38,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:58:38,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:58:38,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:58:38,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-02-10 00:58:38,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:58:38,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:58:38,328 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:58:38,335 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-02-10 00:58:38,336 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-02-10 00:58:38,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:58:38,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:58:38,349 INFO L229 MonitoredProcess]: Starting monitored process 21 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:38,399 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:58:38,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-02-10 00:58:38,410 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:58:38,410 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:58:38,410 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, N) = -1*thread2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2024-02-10 00:58:38,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-02-10 00:58:38,428 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:58:38,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:58:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:58:38,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:58:38,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:58:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:58:38,468 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:58:38,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:58:38,489 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:38,490 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:38,490 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:38,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-02-10 00:58:38,648 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 504 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:58:38,648 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:58:38,649 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:58:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 504 transitions. [2024-02-10 00:58:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 504 transitions. [2024-02-10 00:58:38,651 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:58:38,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 504 transitions. [2024-02-10 00:58:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 504 transitions. [2024-02-10 00:58:41,882 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:58:41,882 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:58:41,888 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:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2024-02-10 00:58:41,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 9 letters. Loop has 4 letters. [2024-02-10 00:58:41,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:58:41,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 13 letters. Loop has 4 letters. [2024-02-10 00:58:41,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:58:41,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 9 letters. Loop has 8 letters. [2024-02-10 00:58:41,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:58:41,891 INFO L428 stractBuchiCegarLoop]: Abstraction has has 74 places, 112948 transitions, 957593 flow [2024-02-10 00:58:41,891 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 00:58:41,891 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 74 places, 112948 transitions, 957593 flow Received shutdown request... [2024-02-10 01:03:15,001 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-02-10 01:03:15,074 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-10 01:03:15,085 INFO L201 PluginConnector]: Adding new model map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:03:15 BoogieIcfgContainer [2024-02-10 01:03:15,085 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:03:15,090 INFO L158 Benchmark]: Toolchain (without parser) took 281223.57ms. Allocated memory was 182.5MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 154.5MB in the beginning and 3.5GB in the end (delta: -3.3GB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2024-02-10 01:03:15,091 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 182.5MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:03:15,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.34ms. Allocated memory is still 182.5MB. Free memory was 154.4MB in the beginning and 152.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:03:15,092 INFO L158 Benchmark]: Boogie Preprocessor took 31.55ms. Allocated memory is still 182.5MB. Free memory was 152.8MB in the beginning and 151.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:03:15,094 INFO L158 Benchmark]: RCFGBuilder took 365.39ms. Allocated memory is still 182.5MB. Free memory was 151.7MB in the beginning and 141.4MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 01:03:15,098 INFO L158 Benchmark]: BuchiAutomizer took 280764.13ms. Allocated memory was 182.5MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 141.3MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2024-02-10 01:03:15,099 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.19ms. Allocated memory is still 182.5MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.34ms. Allocated memory is still 182.5MB. Free memory was 154.4MB in the beginning and 152.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.55ms. Allocated memory is still 182.5MB. Free memory was 152.8MB in the beginning and 151.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 365.39ms. Allocated memory is still 182.5MB. Free memory was 151.7MB in the beginning and 141.4MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 280764.13ms. Allocated memory was 182.5MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 141.3MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 5 locations. One deterministic module has affine ranking function N + -1 * j and consists of 5 locations. The remainder module has 957593 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 280.6s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 2.2s. Construction of modules took 0.2s. Büchi inclusion checks took 4.0s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 453 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 265 IncrementalHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 246 mSDtfsCounter, 265 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital54 mio100 ax100 hnf100 lsp95 ukn61 mio100 lsp84 div100 bol100 ite100 ukn100 eq143 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 92ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing PetriNetUnfolderBuchi. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown