Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r184-oct2-158987928900686.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is LamportFastMutEx-PT-7, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928900686
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 9.3K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 13:04 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 6 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 255K Apr 30 13:04 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityCardinality-00
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityCardinality-01
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityCardinality-02
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityCardinality-03
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityCardinality-04
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityCardinality-05
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityCardinality-06
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityCardinality-07
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityCardinality-08
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityCardinality-09
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityCardinality-10
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityCardinality-11
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityCardinality-12
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityCardinality-13
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityCardinality-14
FORMULA_NAME LamportFastMutEx-PT-7-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591219616610

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 21:26:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 21:26:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 21:26:59] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2020-06-03 21:26:59] [INFO ] Transformed 264 places.
[2020-06-03 21:26:59] [INFO ] Transformed 536 transitions.
[2020-06-03 21:26:59] [INFO ] Parsed PT model containing 264 places and 536 transitions in 111 ms.
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 74 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 76 ms. (steps per millisecond=131 ) properties seen :[1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0]
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0]
[2020-06-03 21:26:59] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2020-06-03 21:26:59] [INFO ] Computed 65 place invariants in 21 ms
[2020-06-03 21:26:59] [INFO ] [Real]Absence check using 65 positive place invariants in 23 ms returned unsat
[2020-06-03 21:26:59] [INFO ] [Real]Absence check using 65 positive place invariants in 55 ms returned sat
[2020-06-03 21:26:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:27:00] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2020-06-03 21:27:00] [INFO ] State equation strengthened by 105 read => feed constraints.
[2020-06-03 21:27:00] [INFO ] [Real]Added 105 Read/Feed constraints in 42 ms returned sat
[2020-06-03 21:27:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:27:00] [INFO ] [Nat]Absence check using 65 positive place invariants in 118 ms returned sat
[2020-06-03 21:27:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:27:01] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2020-06-03 21:27:01] [INFO ] [Nat]Added 105 Read/Feed constraints in 40 ms returned sat
[2020-06-03 21:27:01] [INFO ] Deduced a trap composed of 9 places in 109 ms
[2020-06-03 21:27:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2020-06-03 21:27:01] [INFO ] Computed and/alt/rep : 455/3647/329 causal constraints in 57 ms.
[2020-06-03 21:27:04] [INFO ] Added : 313 causal constraints over 64 iterations in 3194 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 42 ms.
[2020-06-03 21:27:04] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned unsat
[2020-06-03 21:27:04] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned unsat
[2020-06-03 21:27:04] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned unsat
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-PT-7-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 86200 steps, including 1000 resets, run finished after 322 ms. (steps per millisecond=267 ) properties seen :[0] could not realise parikh vector
Support contains 28 out of 219 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 113 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 212/219 places, 455/462 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2031 ms. (steps per millisecond=492 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 936 ms. (steps per millisecond=1068 ) properties seen :[0]
Interrupted probabilistic random walk after 16835245 steps, run timeout after 30001 ms. (steps per millisecond=561 ) properties seen :[0]
Probabilistic random walk after 16835245 steps, saw 2560639 distinct states, run finished after 30014 ms. (steps per millisecond=560 ) properties seen :[0]
[2020-06-03 21:27:38] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2020-06-03 21:27:38] [INFO ] Computed 65 place invariants in 4 ms
[2020-06-03 21:27:38] [INFO ] [Real]Absence check using 65 positive place invariants in 74 ms returned sat
[2020-06-03 21:27:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:27:39] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2020-06-03 21:27:39] [INFO ] State equation strengthened by 105 read => feed constraints.
[2020-06-03 21:27:39] [INFO ] [Real]Added 105 Read/Feed constraints in 44 ms returned sat
[2020-06-03 21:27:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:27:39] [INFO ] [Nat]Absence check using 65 positive place invariants in 33 ms returned sat
[2020-06-03 21:27:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:27:39] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2020-06-03 21:27:39] [INFO ] [Nat]Added 105 Read/Feed constraints in 15 ms returned sat
[2020-06-03 21:27:39] [INFO ] Deduced a trap composed of 8 places in 216 ms
[2020-06-03 21:27:41] [INFO ] Deduced a trap composed of 40 places in 2033 ms
[2020-06-03 21:27:41] [INFO ] Deduced a trap composed of 8 places in 178 ms
[2020-06-03 21:27:42] [INFO ] Deduced a trap composed of 14 places in 164 ms
[2020-06-03 21:27:43] [INFO ] Deduced a trap composed of 21 places in 961 ms
[2020-06-03 21:27:45] [INFO ] Deduced a trap composed of 18 places in 1955 ms
[2020-06-03 21:27:46] [INFO ] Deduced a trap composed of 30 places in 1500 ms
[2020-06-03 21:27:46] [INFO ] Deduced a trap composed of 35 places in 85 ms
[2020-06-03 21:27:46] [INFO ] Deduced a trap composed of 7 places in 38 ms
[2020-06-03 21:27:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 7292 ms
[2020-06-03 21:27:46] [INFO ] Computed and/alt/rep : 448/3738/322 causal constraints in 38 ms.
[2020-06-03 21:27:49] [INFO ] Added : 210 causal constraints over 42 iterations in 2877 ms. Result :sat
[2020-06-03 21:27:51] [INFO ] Deduced a trap composed of 32 places in 2157 ms
[2020-06-03 21:27:54] [INFO ] Deduced a trap composed of 31 places in 2541 ms
[2020-06-03 21:27:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4853 ms
Attempting to minimize the solution found.
Minimization took 53 ms.
Incomplete Parikh walk after 57900 steps, including 1000 resets, run finished after 148 ms. (steps per millisecond=391 ) properties seen :[0] could not realise parikh vector
Support contains 28 out of 212 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 212/212 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 212 /212 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 212/212 places, 455/455 transitions.
Starting structural reductions, iteration 0 : 212/212 places, 455/455 transitions.
Applied a total of 0 rules in 13 ms. Remains 212 /212 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2020-06-03 21:27:54] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2020-06-03 21:27:54] [INFO ] Computed 65 place invariants in 11 ms
[2020-06-03 21:27:55] [INFO ] Implicit Places using invariants in 394 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 429 ms to find 7 implicit places.
[2020-06-03 21:27:55] [INFO ] Redundant transitions in 15 ms returned []
[2020-06-03 21:27:55] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2020-06-03 21:27:55] [INFO ] Computed 58 place invariants in 12 ms
[2020-06-03 21:27:55] [INFO ] Dead Transitions using invariants and state equation in 729 ms returned []
Starting structural reductions, iteration 1 : 205/212 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2020-06-03 21:27:55] [INFO ] Redundant transitions in 6 ms returned []
[2020-06-03 21:27:55] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2020-06-03 21:27:55] [INFO ] Computed 58 place invariants in 1 ms
[2020-06-03 21:27:56] [INFO ] Dead Transitions using invariants and state equation in 893 ms returned []
Finished structural reductions, in 2 iterations. Remains : 205/212 places, 455/455 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1715 ms. (steps per millisecond=583 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 908 ms. (steps per millisecond=1101 ) properties seen :[0]
Interrupted probabilistic random walk after 18716550 steps, run timeout after 30001 ms. (steps per millisecond=623 ) properties seen :[0]
Probabilistic random walk after 18716550 steps, saw 2852045 distinct states, run finished after 30011 ms. (steps per millisecond=623 ) properties seen :[0]
[2020-06-03 21:28:29] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2020-06-03 21:28:29] [INFO ] Computed 58 place invariants in 6 ms
[2020-06-03 21:28:29] [INFO ] [Real]Absence check using 58 positive place invariants in 159 ms returned sat
[2020-06-03 21:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:28:30] [INFO ] [Real]Absence check using state equation in 743 ms returned sat
[2020-06-03 21:28:30] [INFO ] State equation strengthened by 56 read => feed constraints.
[2020-06-03 21:28:30] [INFO ] [Real]Added 56 Read/Feed constraints in 13 ms returned sat
[2020-06-03 21:28:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:28:30] [INFO ] [Nat]Absence check using 58 positive place invariants in 15 ms returned sat
[2020-06-03 21:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:28:30] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2020-06-03 21:28:30] [INFO ] [Nat]Added 56 Read/Feed constraints in 19 ms returned sat
[2020-06-03 21:28:31] [INFO ] Deduced a trap composed of 8 places in 601 ms
[2020-06-03 21:28:31] [INFO ] Deduced a trap composed of 30 places in 66 ms
[2020-06-03 21:28:32] [INFO ] Deduced a trap composed of 32 places in 1214 ms
[2020-06-03 21:28:33] [INFO ] Deduced a trap composed of 28 places in 838 ms
[2020-06-03 21:28:34] [INFO ] Deduced a trap composed of 43 places in 464 ms
[2020-06-03 21:28:36] [INFO ] Deduced a trap composed of 20 places in 1945 ms
[2020-06-03 21:28:37] [INFO ] Deduced a trap composed of 15 places in 1139 ms
[2020-06-03 21:28:37] [INFO ] Deduced a trap composed of 24 places in 68 ms
[2020-06-03 21:28:37] [INFO ] Deduced a trap composed of 20 places in 164 ms
[2020-06-03 21:28:38] [INFO ] Deduced a trap composed of 20 places in 1026 ms
[2020-06-03 21:28:39] [INFO ] Deduced a trap composed of 29 places in 676 ms
[2020-06-03 21:28:39] [INFO ] Deduced a trap composed of 8 places in 299 ms
[2020-06-03 21:28:39] [INFO ] Deduced a trap composed of 32 places in 59 ms
[2020-06-03 21:28:39] [INFO ] Deduced a trap composed of 8 places in 37 ms
[2020-06-03 21:28:39] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 8884 ms
[2020-06-03 21:28:39] [INFO ] Computed and/alt/rep : 448/3626/322 causal constraints in 35 ms.
[2020-06-03 21:28:41] [INFO ] Added : 226 causal constraints over 46 iterations in 2024 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 44 ms.
Incomplete Parikh walk after 67600 steps, including 1000 resets, run finished after 169 ms. (steps per millisecond=400 ) properties seen :[0] could not realise parikh vector
Support contains 28 out of 205 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 7 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 455/455 transitions.
Starting structural reductions, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 10 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2020-06-03 21:28:42] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2020-06-03 21:28:42] [INFO ] Computed 58 place invariants in 1 ms
[2020-06-03 21:28:42] [INFO ] Implicit Places using invariants in 406 ms returned []
[2020-06-03 21:28:42] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2020-06-03 21:28:42] [INFO ] Computed 58 place invariants in 6 ms
[2020-06-03 21:28:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2020-06-03 21:28:44] [INFO ] Implicit Places using invariants and state equation in 2100 ms returned []
Implicit Place search using SMT with State Equation took 2509 ms to find 0 implicit places.
[2020-06-03 21:28:44] [INFO ] Redundant transitions in 5 ms returned []
[2020-06-03 21:28:44] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2020-06-03 21:28:44] [INFO ] Computed 58 place invariants in 1 ms
[2020-06-03 21:28:45] [INFO ] Dead Transitions using invariants and state equation in 419 ms returned []
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 455/455 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 167 ms. (steps per millisecond=598 ) properties seen :[0]
[2020-06-03 21:28:45] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2020-06-03 21:28:45] [INFO ] Computed 58 place invariants in 1 ms
[2020-06-03 21:28:45] [INFO ] [Real]Absence check using 58 positive place invariants in 177 ms returned sat
[2020-06-03 21:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:28:45] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2020-06-03 21:28:45] [INFO ] State equation strengthened by 56 read => feed constraints.
[2020-06-03 21:28:45] [INFO ] [Real]Added 56 Read/Feed constraints in 24 ms returned sat
[2020-06-03 21:28:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:28:45] [INFO ] [Nat]Absence check using 58 positive place invariants in 88 ms returned sat
[2020-06-03 21:28:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:28:46] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2020-06-03 21:28:46] [INFO ] [Nat]Added 56 Read/Feed constraints in 18 ms returned sat
[2020-06-03 21:28:48] [INFO ] Deduced a trap composed of 8 places in 1752 ms
[2020-06-03 21:28:48] [INFO ] Deduced a trap composed of 30 places in 144 ms
[2020-06-03 21:28:48] [INFO ] Deduced a trap composed of 32 places in 71 ms
[2020-06-03 21:28:48] [INFO ] Deduced a trap composed of 28 places in 370 ms
[2020-06-03 21:28:49] [INFO ] Deduced a trap composed of 43 places in 667 ms
[2020-06-03 21:28:50] [INFO ] Deduced a trap composed of 20 places in 506 ms
[2020-06-03 21:28:50] [INFO ] Deduced a trap composed of 15 places in 177 ms
[2020-06-03 21:28:50] [INFO ] Deduced a trap composed of 24 places in 160 ms
[2020-06-03 21:28:50] [INFO ] Deduced a trap composed of 20 places in 395 ms
[2020-06-03 21:28:50] [INFO ] Deduced a trap composed of 20 places in 88 ms
[2020-06-03 21:28:51] [INFO ] Deduced a trap composed of 29 places in 111 ms
[2020-06-03 21:28:51] [INFO ] Deduced a trap composed of 8 places in 69 ms
[2020-06-03 21:28:52] [INFO ] Deduced a trap composed of 32 places in 1176 ms
[2020-06-03 21:28:52] [INFO ] Deduced a trap composed of 8 places in 18 ms
[2020-06-03 21:28:52] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5977 ms
[2020-06-03 21:28:52] [INFO ] Computed and/alt/rep : 448/3626/322 causal constraints in 32 ms.
[2020-06-03 21:28:54] [INFO ] Added : 226 causal constraints over 46 iterations in 1747 ms. Result :sat
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 205 transition count 329
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 126 place count 205 transition count 280
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 266 place count 114 transition count 280
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 280 place count 107 transition count 273
Free-agglomeration rule applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 294 place count 107 transition count 259
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 308 place count 93 transition count 259
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 93 transition count 259
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 322 place count 93 transition count 252
Applied a total of 322 rules in 34 ms. Remains 93 /205 variables (removed 112) and now considering 252/455 (removed 203) transitions.
// Phase 1: matrix 252 rows 93 cols
[2020-06-03 21:28:54] [INFO ] Computed 16 place invariants in 0 ms
[2020-06-03 21:28:54] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2020-06-03 21:28:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:28:54] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-06-03 21:28:54] [INFO ] Computed and/alt/rep : 238/1897/238 causal constraints in 21 ms.
[2020-06-03 21:28:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:28:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2020-06-03 21:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:28:54] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2020-06-03 21:28:54] [INFO ] Computed and/alt/rep : 238/1897/238 causal constraints in 37 ms.
[2020-06-03 21:28:56] [INFO ] Added : 189 causal constraints over 38 iterations in 1573 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-06-03 21:28:56] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 1 ms.
[2020-06-03 21:28:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 20 ms.
[2020-06-03 21:28:57] [INFO ] Flatten gal took : 219 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ LamportFastMutEx-PT-7 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ LamportFastMutEx-PT-7

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 21:28:57 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 19328,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 35,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 28,
"visible_transitions": 0
},
"processed": "A (G (((p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= p177 + p178 + p179 + p180 + p181 + p182 + p183) OR (p191 + p192 + p193 + p194 + p195 + p196 + p197 <= 1) OR (p50 + p49 + p48 + p47 + p46 + p45 + p44 <= 2) OR (p43 + p42 + p37 + p38 + p39 + p40 + p41 <= 0))))",
"processed_size": 272,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 1932,
"conflict_clusters": 16,
"places": 205,
"places_significant": 147,
"singleton_clusters": 0,
"transitions": 455
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 660/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 205
lola: finding significant places
lola: 205 places, 455 transitions, 147 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: A (G (((p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= p177 + p178 + p179 + p180 + p181 + p182 + p183) OR (p191 + p192 + p193 + p194 + p195 + p196 + p197 <= 1) OR (p50 + p49 + p48 + p47 + p46 + p45 + p44 <= 2) OR (p43 + p42 + p37 + p38 + p39 + p40 + p41 <= 0))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= p177 + p178 + p179 + p180 + p181 + p182 + p183) OR (p191 + p192 + p193 + p194 + p195 + p196 + p197 <= 1) OR (p50 + p49 + p48 + p47 + p46 + p45 + p44 <= 2) OR (p43 + p42 + p37 + p38 + p39 + p40 + p41 <= 0))))
lola: processed formula length: 272
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: local time limit reached - aborting
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p177 + p178 + p179 + p180 + p181 + p182 + p183 <= p191 + p192 + p193 + p194 + p195 + p196 + p197) AND (2 <= p191 + p192 + p193 + p194 + p195 + p196 + p197) AND (3 <= p50 + p49 + p48 + p47 + p46 + p45 + p44) AND (1 <= p43 + p42 + p37 + p38 + p39 + p40 + p41))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 19328 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
sara: try reading problem file ReachabilityCardinality-0.sara.
rslt: finished

--------------------
content from stderr:

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="LamportFastMutEx-PT-7"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is LamportFastMutEx-PT-7, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-oct2-158987928900686"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-7.tgz
mv LamportFastMutEx-PT-7 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;