/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-update3.bpl


--------------------------------------------------------------------------------


This is Ultimate 0.2.3-?-9ecb849-m
[2024-02-10 00:58:58,684 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-02-10 00:58:58,756 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:58,763 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-02-10 00:58:58,766 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-02-10 00:58:58,766 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:58,796 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-10 00:58:58,797 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-10 00:58:58,798 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-10 00:58:58,801 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-10 00:58:58,802 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-10 00:58:58,802 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-02-10 00:58:58,802 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2024-02-10 00:58:58,803 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2024-02-10 00:58:58,803 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2024-02-10 00:58:58,803 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2024-02-10 00:58:58,804 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2024-02-10 00:58:58,804 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2024-02-10 00:58:58,804 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-10 00:58:58,804 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2024-02-10 00:58:58,805 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-02-10 00:58:58,805 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-10 00:58:58,806 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-02-10 00:58:58,806 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-10 00:58:58,806 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2024-02-10 00:58:58,806 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2024-02-10 00:58:58,806 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2024-02-10 00:58:58,806 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-02-10 00:58:58,807 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-02-10 00:58:58,807 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-10 00:58:58,808 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2024-02-10 00:58:58,808 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-02-10 00:58:58,808 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-10 00:58:58,808 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-10 00:58:58,808 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-10 00:58:58,809 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-10 00:58:58,809 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-02-10 00:58:58,809 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2024-02-10 00:58:58,809 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:59,233 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-10 00:58:59,273 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-10 00:58:59,276 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-10 00:58:59,278 INFO  L270        PluginConnector]: Initializing Boogie PL CUP Parser...
[2024-02-10 00:58:59,280 INFO  L274        PluginConnector]: Boogie PL CUP Parser initialized
[2024-02-10 00:58:59,281 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update3.bpl
[2024-02-10 00:58:59,283 INFO  L110           BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update3.bpl'
[2024-02-10 00:58:59,328 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-10 00:58:59,330 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2024-02-10 00:58:59,335 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-10 00:58:59,335 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-10 00:58:59,335 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-10 00:58:59,352 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:59" (1/1) ...
[2024-02-10 00:58:59,367 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:59" (1/1) ...
[2024-02-10 00:58:59,374 INFO  L138                Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0
[2024-02-10 00:58:59,375 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-10 00:58:59,377 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-10 00:58:59,377 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-10 00:58:59,377 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-02-10 00:58:59,385 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:59" (1/1) ...
[2024-02-10 00:58:59,386 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:59" (1/1) ...
[2024-02-10 00:58:59,388 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:59" (1/1) ...
[2024-02-10 00:58:59,388 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:59" (1/1) ...
[2024-02-10 00:58:59,392 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:59" (1/1) ...
[2024-02-10 00:58:59,397 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:59" (1/1) ...
[2024-02-10 00:58:59,399 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:59" (1/1) ...
[2024-02-10 00:58:59,400 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:59" (1/1) ...
[2024-02-10 00:58:59,406 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-10 00:58:59,407 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-10 00:58:59,407 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-02-10 00:58:59,408 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-02-10 00:58:59,411 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:59" (1/1) ...
[2024-02-10 00:58:59,418 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-10 00:58:59,441 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-10 00:58:59,461 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:59,479 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:59,514 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration
[2024-02-10 00:58:59,515 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2024-02-10 00:58:59,515 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2024-02-10 00:58:59,515 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration
[2024-02-10 00:58:59,515 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2024-02-10 00:58:59,515 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2024-02-10 00:58:59,515 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration
[2024-02-10 00:58:59,516 INFO  L130     BoogieDeclarations]: Found specification of procedure thread3
[2024-02-10 00:58:59,516 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread3
[2024-02-10 00:58:59,516 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration
[2024-02-10 00:58:59,516 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-10 00:58:59,516 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-10 00:58:59,517 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:59,574 INFO  L236             CfgBuilder]: Building ICFG
[2024-02-10 00:58:59,578 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-10 00:58:59,710 INFO  L277             CfgBuilder]: Performing block encoding
[2024-02-10 00:58:59,717 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-10 00:58:59,717 INFO  L302             CfgBuilder]: Removed 0 assume(true) statements.
[2024-02-10 00:58:59,719 INFO  L201        PluginConnector]: Adding new model map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:58:59 BoogieIcfgContainer
[2024-02-10 00:58:59,719 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-10 00:58:59,720 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2024-02-10 00:58:59,720 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2024-02-10 00:58:59,724 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2024-02-10 00:58:59,725 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-02-10 00:58:59,725 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:58:59" (1/2) ...
[2024-02-10 00:58:59,727 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50821573 and model type map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:58:59, skipping insertion in model container
[2024-02-10 00:58:59,727 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-02-10 00:58:59,727 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:58:59" (2/2) ...
[2024-02-10 00:58:59,729 INFO  L332   chiAutomizerObserver]: Analyzing ICFG map-aggr-update3.bpl
[2024-02-10 00:58:59,795 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-02-10 00:58:59,816 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 101 flow
[2024-02-10 00:58:59,835 INFO  L124   PetriNetUnfolderBase]: 5/34 cut-off events.
[2024-02-10 00:58:59,835 INFO  L125   PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-02-10 00:58:59,839 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:59,839 INFO  L82        GeneralOperation]: Start removeDead. Operand has 42 places, 40 transitions, 101 flow
[2024-02-10 00:58:59,843 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 86 flow
[2024-02-10 00:58:59,848 INFO  L303   stractBuchiCegarLoop]: Interprodecural is true
[2024-02-10 00:58:59,848 INFO  L304   stractBuchiCegarLoop]: Hoare is false
[2024-02-10 00:58:59,848 INFO  L305   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2024-02-10 00:58:59,848 INFO  L306   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2024-02-10 00:58:59,848 INFO  L307   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2024-02-10 00:58:59,848 INFO  L308   stractBuchiCegarLoop]: Difference is false
[2024-02-10 00:58:59,849 INFO  L309   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2024-02-10 00:58:59,849 INFO  L313   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ========
[2024-02-10 00:58:59,849 INFO  L84            BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 places, 34 transitions, 86 flow
[2024-02-10 00:58:59,856 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-10 00:58:59,856 INFO  L124   PetriNetUnfolderBase]: 0/10 cut-off events.
[2024-02-10 00:58:59,856 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-02-10 00:58:59,856 INFO  L88            BuchiIsEmpty]: Finished buchiIsEmpty language is not empty
[2024-02-10 00:58:59,859 INFO  L335   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2024-02-10 00:58:59,859 INFO  L84            BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 places, 34 transitions, 86 flow
[2024-02-10 00:58:59,862 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-10 00:58:59,863 INFO  L124   PetriNetUnfolderBase]: 0/10 cut-off events.
[2024-02-10 00:58:59,863 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-02-10 00:58:59,863 INFO  L88            BuchiIsEmpty]: Finished buchiIsEmpty language is not empty
[2024-02-10 00:58:59,867 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:59,867 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: (= (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork0_i_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_1)  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:59,871 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 00:58:59,871 INFO  L85        PathProgramCache]: Analyzing trace with hash 113176, now seen corresponding path program 1 times
[2024-02-10 00:58:59,882 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-10 00:58:59,882 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802304884]
[2024-02-10 00:58:59,882 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-10 00:58:59,883 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-10 00:58:59,945 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 00:58:59,945 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-10 00:58:59,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 00:58:59,960 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-10 00:58:59,963 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 00:58:59,963 INFO  L85        PathProgramCache]: Analyzing trace with hash 119226, now seen corresponding path program 1 times
[2024-02-10 00:58:59,963 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-10 00:58:59,963 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384863885]
[2024-02-10 00:58:59,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-10 00:58:59,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-10 00:58:59,975 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 00:58:59,975 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-10 00:58:59,979 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 00:58:59,981 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-10 00:58:59,982 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 00:58:59,983 INFO  L85        PathProgramCache]: Analyzing trace with hash -923251645, now seen corresponding path program 1 times
[2024-02-10 00:58:59,983 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-10 00:58:59,983 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36219673]
[2024-02-10 00:58:59,983 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-10 00:58:59,983 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-10 00:58:59,991 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 00:58:59,991 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-10 00:58:59,997 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 00:58:59,999 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-10 00:59:00,179 INFO  L210          LassoAnalysis]: Preferences:
[2024-02-10 00:59:00,180 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2024-02-10 00:59:00,180 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-02-10 00:59:00,180 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2024-02-10 00:59:00,180 INFO  L129   ssoRankerPreferences]: Use exernal solver: false
[2024-02-10 00:59:00,180 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-10 00:59:00,180 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2024-02-10 00:59:00,180 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2024-02-10 00:59:00,180 INFO  L133   ssoRankerPreferences]: Filename of dumped script: map-aggr-update3.bpl_BEv2_Iteration1_Lasso
[2024-02-10 00:59:00,181 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2024-02-10 00:59:00,181 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2024-02-10 00:59:00,209 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-10 00:59:00,255 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-10 00:59:00,325 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2024-02-10 00:59:00,329 INFO  L490          LassoAnalysis]: Using template 'affine'.
[2024-02-10 00:59:00,331 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-10 00:59:00,331 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-10 00:59:00,336 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:59:00,340 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:59:00,341 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-02-10 00:59:00,352 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-02-10 00:59:00,352 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-02-10 00:59:00,353 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-02-10 00:59:00,353 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-02-10 00:59:00,353 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-02-10 00:59:00,354 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-02-10 00:59:00,354 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-02-10 00:59:00,402 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-02-10 00:59:00,407 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:59:00,408 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-10 00:59:00,408 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-10 00:59:00,410 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:59:00,413 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:59:00,414 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-02-10 00:59:00,434 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-02-10 00:59:00,435 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-02-10 00:59:00,435 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-02-10 00:59:00,435 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-02-10 00:59:00,440 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-02-10 00:59:00,440 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-02-10 00:59:00,459 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-02-10 00:59:00,474 INFO  L443   ModelExtractionUtils]: Simplification made 7 calls to the SMT solver.
[2024-02-10 00:59:00,475 INFO  L444   ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero.
[2024-02-10 00:59:00,476 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-10 00:59:00,476 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-10 00:59:00,483 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:59:00,489 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-02-10 00:59:00,498 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:59:00,508 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-02-10 00:59:00,509 INFO  L513          LassoAnalysis]: Proved termination.
[2024-02-10 00:59:00,510 INFO  L515          LassoAnalysis]: Termination argument consisting of:
Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N
Supporting invariants []
[2024-02-10 00:59:00,516 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:59:00,520 INFO  L156   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-02-10 00:59:00,577 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 00:59:00,591 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-10 00:59:00,593 INFO  L262         TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core
[2024-02-10 00:59:00,594 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-10 00:59:00,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-10 00:59:00,628 WARN  L260         TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-02-10 00:59:00,628 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-10 00:59:00,652 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:59:00,680 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:59:00,683 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:59:00,791 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:59:00,793 INFO  L89          BuchiIntersect]: Starting Intersection
[2024-02-10 00:59:00,793 INFO  L112         BuchiIntersect]: use intersection optimizations
[2024-02-10 00:59:00,794 INFO  L63    sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net
[2024-02-10 00:59:00,817 INFO  L72    sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net
[2024-02-10 00:59:00,817 INFO  L99          BuchiIntersect]: Exiting Intersection
[2024-02-10 00:59:00,819 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:59:00,823 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:59:00,826 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions.
[2024-02-10 00:59:00,827 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 3 letters. Loop has 3 letters.
[2024-02-10 00:59:00,828 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-02-10 00:59:00,828 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 6 letters. Loop has 3 letters.
[2024-02-10 00:59:00,828 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-02-10 00:59:00,828 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 3 letters. Loop has 6 letters.
[2024-02-10 00:59:00,828 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-02-10 00:59:00,828 INFO  L428   stractBuchiCegarLoop]: Abstraction has has 48 places, 426 transitions, 1923 flow
[2024-02-10 00:59:00,828 INFO  L335   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2024-02-10 00:59:00,828 INFO  L84            BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 places, 426 transitions, 1923 flow
[2024-02-10 00:59:00,902 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-10 00:59:00,902 INFO  L124   PetriNetUnfolderBase]: 387/506 cut-off events.
[2024-02-10 00:59:00,902 INFO  L125   PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES.
[2024-02-10 00:59:00,902 INFO  L88            BuchiIsEmpty]: Finished buchiIsEmpty language is not empty
[2024-02-10 00:59:00,903 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_12}  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_9 0)  InVars {}  OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_9}  AuxVars[]  AssignedVars[thread3Thread1of1ForFork2_k] 118#[$Ultimate##0, L83-1, $Ultimate##0, L36]true 
[2024-02-10 00:59:00,903 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_9 0)  InVars {}  OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_9}  AuxVars[]  AssignedVars[thread3Thread1of1ForFork2_k] 118#[$Ultimate##0, L83-1, $Ultimate##0, L36]true 
[2024-02-10 00:59:00,904 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 00:59:00,904 INFO  L85        PathProgramCache]: Analyzing trace with hash -1623181850, now seen corresponding path program 1 times
[2024-02-10 00:59:00,904 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-10 00:59:00,904 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145636427]
[2024-02-10 00:59:00,904 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-10 00:59:00,904 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-10 00:59:00,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 00:59:00,911 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-10 00:59:00,914 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 00:59:00,916 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-10 00:59:00,916 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 00:59:00,916 INFO  L85        PathProgramCache]: Analyzing trace with hash 137100, now seen corresponding path program 1 times
[2024-02-10 00:59:00,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-10 00:59:00,917 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144664824]
[2024-02-10 00:59:00,917 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-10 00:59:00,917 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-10 00:59:00,921 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 00:59:00,921 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-10 00:59:00,923 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 00:59:00,924 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-10 00:59:00,924 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 00:59:00,924 INFO  L85        PathProgramCache]: Analyzing trace with hash 826399623, now seen corresponding path program 2 times
[2024-02-10 00:59:00,925 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-10 00:59:00,925 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049781853]
[2024-02-10 00:59:00,925 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-10 00:59:00,925 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-10 00:59:00,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 00:59:00,934 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-10 00:59:00,939 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 00:59:00,941 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-10 00:59:01,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 00:59:01,093 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-10 00:59:01,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 00:59:01,122 INFO  L201        PluginConnector]: Adding new model map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:59:01 BoogieIcfgContainer
[2024-02-10 00:59:01,122 INFO  L131        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2024-02-10 00:59:01,123 INFO  L158              Benchmark]: Toolchain (without parser) took 1792.94ms. Allocated memory was 173.0MB in the beginning and 345.0MB in the end (delta: 172.0MB). Free memory was 147.2MB in the beginning and 258.8MB in the end (delta: -111.6MB). Peak memory consumption was 61.0MB. Max. memory is 8.0GB.
[2024-02-10 00:59:01,123 INFO  L158              Benchmark]: Boogie PL CUP Parser took 1.22ms. Allocated memory is still 173.0MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB.
[2024-02-10 00:59:01,124 INFO  L158              Benchmark]: Boogie Procedure Inliner took 41.02ms. Allocated memory is still 173.0MB. Free memory was 147.2MB in the beginning and 145.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2024-02-10 00:59:01,124 INFO  L158              Benchmark]: Boogie Preprocessor took 29.50ms. Allocated memory is still 173.0MB. Free memory was 145.5MB in the beginning and 144.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2024-02-10 00:59:01,124 INFO  L158              Benchmark]: RCFGBuilder took 311.84ms. Allocated memory is still 173.0MB. Free memory was 144.5MB in the beginning and 134.4MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB.
[2024-02-10 00:59:01,125 INFO  L158              Benchmark]: BuchiAutomizer took 1401.92ms. Allocated memory was 173.0MB in the beginning and 345.0MB in the end (delta: 172.0MB). Free memory was 134.4MB in the beginning and 258.8MB in the end (delta: -124.4MB). Peak memory consumption was 48.4MB. Max. memory is 8.0GB.
[2024-02-10 00:59:01,126 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 1.22ms. Allocated memory is still 173.0MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 41.02ms. Allocated memory is still 173.0MB. Free memory was 147.2MB in the beginning and 145.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 29.50ms. Allocated memory is still 173.0MB. Free memory was 145.5MB in the beginning and 144.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
 * RCFGBuilder took 311.84ms. Allocated memory is still 173.0MB. Free memory was 144.5MB in the beginning and 134.4MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB.
 * BuchiAutomizer took 1401.92ms. Allocated memory was 173.0MB in the beginning and 345.0MB in the end (delta: 172.0MB). Free memory was 134.4MB in the beginning and 258.8MB in the end (delta: -124.4MB). Peak memory consumption was 48.4MB. 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + N and consists of 5 locations.  The remainder module has 1923 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 1.3s and 2 iterations.  TraceHistogramMax:0. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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 [1, 0, 0, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 0/0	HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82 IncrementalHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 84 mSDtfsCounter, 82 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown	LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks:   Lassos: inital58 mio100 ax100 hnf100 lsp146 ukn27 mio100 lsp100 div100 bol100 ite100 ukn100 eq143 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 100ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 0	LassoNonterminationAnalysisUnknown: 0	LassoNonterminationAnalysisTime: 0.0s	InitialAbstractionConstructionTime: 0.0s
  - TerminationAnalysisResult: Nontermination possible
    Buchi Automizer proved that your program is nonterminating for some inputs
  - LassoShapedNonTerminationArgument [Line: 83]: Nontermination argument in form of an infinite program execution.
    Nontermination argument in form of an infinite program execution.
Stem:
[L32]             0  assume 0 <= m && m < N;
       VAL           [N=1, m=0]
[L34]  FORK       0  fork 1 thread1();
       VAL           [N=1, m=0]
[L35]  FORK       0  fork 2, 2 thread2();
       VAL           [N=1, m=0]
[L36]  FORK       0  fork 3, 3, 3 thread3();
       VAL           [N=1, m=0]
[L82]             3  k := 0;
       VAL           [N=1, k=0, m=0]
[L83]  COND TRUE  3  k < N
       VAL           [N=1, k=0, m=0]
[L84]             3  B[k] := k;
       VAL           [N=1, k=0, m=0]
[L85]             3  k := 0;
       VAL           [N=1, k=0, m=0]
Loop:
[L83]  COND TRUE  k < N
[L84]             B[k] := k;
[L85]             k := 0;
End of lasso representation.
  - StatisticsResult: NonterminationArgumentStatistics
    Fixpoint
  - NonterminatingLassoResult [Line: 83]: Nonterminating execution
    Found a nonterminating execution for the following lasso shaped sequence of statements.
Stem:
[L32]             0  assume 0 <= m && m < N;
       VAL           [N=1, m=0]
[L34]  FORK       0  fork 1 thread1();
       VAL           [N=1, m=0]
[L35]  FORK       0  fork 2, 2 thread2();
       VAL           [N=1, m=0]
[L36]  FORK       0  fork 3, 3, 3 thread3();
       VAL           [N=1, m=0]
[L82]             3  k := 0;
       VAL           [N=1, k=0, m=0]
[L83]  COND TRUE  3  k < N
       VAL           [N=1, k=0, m=0]
[L84]             3  B[k] := k;
       VAL           [N=1, k=0, m=0]
[L85]             3  k := 0;
       VAL           [N=1, k=0, m=0]
Loop:
[L83]  COND TRUE  k < N
[L84]             B[k] := k;
[L85]             k := 0;
End of lasso representation.
RESULT: Ultimate proved your program to be incorrect!
[2024-02-10 00:59:01,151 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0
[2024-02-10 00:59:01,349 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0
Received shutdown request...