About the Execution of LoLa+red for HouseConstruction-PT-00500
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r199-smll-167840346200573.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is HouseConstruction-PT-00500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840346200573
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME HouseConstruction-PT-00500-UpperBounds-00
FORMULA_NAME HouseConstruction-PT-00500-UpperBounds-01
FORMULA_NAME HouseConstruction-PT-00500-UpperBounds-02
FORMULA_NAME HouseConstruction-PT-00500-UpperBounds-03
FORMULA_NAME HouseConstruction-PT-00500-UpperBounds-04
FORMULA_NAME HouseConstruction-PT-00500-UpperBounds-05
FORMULA_NAME HouseConstruction-PT-00500-UpperBounds-06
FORMULA_NAME HouseConstruction-PT-00500-UpperBounds-07
FORMULA_NAME HouseConstruction-PT-00500-UpperBounds-08
FORMULA_NAME HouseConstruction-PT-00500-UpperBounds-09
FORMULA_NAME HouseConstruction-PT-00500-UpperBounds-10
FORMULA_NAME HouseConstruction-PT-00500-UpperBounds-11
FORMULA_NAME HouseConstruction-PT-00500-UpperBounds-12
FORMULA_NAME HouseConstruction-PT-00500-UpperBounds-13
FORMULA_NAME HouseConstruction-PT-00500-UpperBounds-14
FORMULA_NAME HouseConstruction-PT-00500-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678565448865
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-00500
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 20:10:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 20:10:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 20:10:51] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-11 20:10:51] [INFO ] Transformed 26 places.
[2023-03-11 20:10:51] [INFO ] Transformed 18 transitions.
[2023-03-11 20:10:51] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 18 rows 26 cols
[2023-03-11 20:10:51] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10022 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1002 ) properties (out of 16) seen :4500
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :598
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) seen :620
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :608
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :621
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :626
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :602
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :693
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :588
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :515
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :628
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :646
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :631
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :628
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :719
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :676
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 16) seen :840
[2023-03-11 20:10:51] [INFO ] Invariant cache hit.
[2023-03-11 20:10:52] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 20:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-11 20:10:52] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 29 ms.
[2023-03-11 20:10:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:10:52] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-11 20:10:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:52] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-11 20:10:52] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-11 20:10:52] [INFO ] Added : 7 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 10 ms.
[2023-03-11 20:10:52] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-11 20:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:52] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-11 20:10:52] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-11 20:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:52] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-11 20:10:52] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 20:10:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:10:52] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-11 20:10:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:52] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-11 20:10:52] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-11 20:10:52] [INFO ] Added : 12 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 9 ms.
[2023-03-11 20:10:52] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-11 20:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:52] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-11 20:10:52] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-11 20:10:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:10:52] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 20:10:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:52] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-11 20:10:52] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 20:10:52] [INFO ] Added : 6 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 9 ms.
[2023-03-11 20:10:52] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 20:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:52] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-11 20:10:52] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-11 20:10:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:10:53] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 20:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:53] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-11 20:10:53] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 20:10:53] [INFO ] Added : 12 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 10 ms.
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 20:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 20:10:53] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 20:10:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:10:53] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 20:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:53] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-11 20:10:53] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 20:10:53] [INFO ] Added : 10 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 8 ms.
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 20:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-11 20:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-11 20:10:53] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 20:10:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:10:53] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 20:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:53] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-11 20:10:53] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 20:10:53] [INFO ] Added : 13 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 9 ms.
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-11 20:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 20:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-11 20:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 20:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-11 20:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-11 20:10:53] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 20:10:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:10:53] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-11 20:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:53] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-11 20:10:53] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 20:10:53] [INFO ] Added : 11 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 5 ms.
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-11 20:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-11 20:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-11 20:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:53] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, 500, -1, -1, -1, -1, 500, -1, 500, 500, 500, 500, -1, 500, 500, 500] Max seen :[34, 500, 20, 21, 16, 22, 500, 20, 500, 500, 500, 500, 19, 500, 500, 500]
FORMULA HouseConstruction-PT-00500-UpperBounds-15 500 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00500-UpperBounds-14 500 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00500-UpperBounds-13 500 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00500-UpperBounds-11 500 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00500-UpperBounds-10 500 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00500-UpperBounds-09 500 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00500-UpperBounds-08 500 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00500-UpperBounds-06 500 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00500-UpperBounds-01 500 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 22 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 22 transition count 13
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 18 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 18 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 17 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 14 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 13 transition count 10
Applied a total of 20 rules in 52 ms. Remains 13 /26 variables (removed 13) and now considering 10/18 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 13/26 places, 10/18 transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-11 20:10:56] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000197 steps, including 199 resets, run finished after 172 ms. (steps per millisecond=5815 ) properties (out of 7) seen :3500
Incomplete Best-First random walk after 1000001 steps, including 61 resets, run finished after 677 ms. (steps per millisecond=1477 ) properties (out of 7) seen :585
Incomplete Best-First random walk after 1000000 steps, including 27 resets, run finished after 369 ms. (steps per millisecond=2710 ) properties (out of 7) seen :1737
Incomplete Best-First random walk after 1000001 steps, including 30 resets, run finished after 311 ms. (steps per millisecond=3215 ) properties (out of 7) seen :1290
Incomplete Best-First random walk after 1000001 steps, including 27 resets, run finished after 338 ms. (steps per millisecond=2958 ) properties (out of 7) seen :1767
Incomplete Best-First random walk after 1000001 steps, including 38 resets, run finished after 278 ms. (steps per millisecond=3597 ) properties (out of 7) seen :1243
Incomplete Best-First random walk after 1000001 steps, including 23 resets, run finished after 340 ms. (steps per millisecond=2941 ) properties (out of 7) seen :844
Incomplete Best-First random walk after 1000001 steps, including 32 resets, run finished after 315 ms. (steps per millisecond=3174 ) properties (out of 7) seen :1764
[2023-03-11 20:10:59] [INFO ] Invariant cache hit.
[2023-03-11 20:10:59] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-11 20:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:59] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-11 20:10:59] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-11 20:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:59] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2023-03-11 20:10:59] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-11 20:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:59] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-11 20:10:59] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-11 20:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:59] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-11 20:10:59] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-11 20:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:59] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2023-03-11 20:10:59] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-11 20:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:59] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2023-03-11 20:10:59] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-11 20:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:10:59] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : [500, 500, 500, 500, 500, 500, 500] Max seen :[500, 500, 500, 500, 500, 500, 500]
FORMULA HouseConstruction-PT-00500-UpperBounds-12 500 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00500-UpperBounds-07 500 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00500-UpperBounds-05 500 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00500-UpperBounds-04 500 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00500-UpperBounds-03 500 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00500-UpperBounds-02 500 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00500-UpperBounds-00 500 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8428 ms.
ITS solved all properties within timeout
BK_STOP 1678565461009
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HouseConstruction-PT-00500"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is HouseConstruction-PT-00500, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r199-smll-167840346200573"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-00500.tgz
mv HouseConstruction-PT-00500 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;