About the Execution of ITS-Tools for LamportFastMutEx-PT-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15732.030 | 228374.00 | 573638.00 | 366.80 | TFFFFTFTFTTFFFFT | normal |
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.r096-oct2-158940145400670.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 itstools
Input is LamportFastMutEx-PT-5, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145400670
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 5.3K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 12K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K 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 152K 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-5-ReachabilityCardinality-00
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityCardinality-01
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityCardinality-02
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityCardinality-03
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityCardinality-04
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityCardinality-05
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityCardinality-06
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityCardinality-07
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityCardinality-08
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityCardinality-09
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityCardinality-10
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityCardinality-11
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityCardinality-12
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityCardinality-13
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityCardinality-14
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1589593247602
[2020-05-16 01:40:50] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-16 01:40:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 01:40:50] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2020-05-16 01:40:50] [INFO ] Transformed 174 places.
[2020-05-16 01:40:50] [INFO ] Transformed 318 transitions.
[2020-05-16 01:40:50] [INFO ] Parsed PT model containing 174 places and 318 transitions in 124 ms.
Deduced a syphon composed of 37 places in 11 ms
Reduce places removed 37 places and 58 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 93 ms.
Working with output stream class java.io.PrintStream
FORMULA LamportFastMutEx-PT-5-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 91 ms. (steps per millisecond=109 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0]
FORMULA LamportFastMutEx-PT-5-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0]
[2020-05-16 01:40:51] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2020-05-16 01:40:51] [INFO ] Computed 37 place invariants in 8 ms
[2020-05-16 01:40:51] [INFO ] [Real]Absence check using 37 positive place invariants in 24 ms returned sat
[2020-05-16 01:40:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:40:51] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2020-05-16 01:40:51] [INFO ] State equation strengthened by 65 read => feed constraints.
[2020-05-16 01:40:51] [INFO ] [Real]Added 65 Read/Feed constraints in 19 ms returned sat
[2020-05-16 01:40:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:40:51] [INFO ] [Nat]Absence check using 37 positive place invariants in 43 ms returned sat
[2020-05-16 01:40:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:40:52] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2020-05-16 01:40:52] [INFO ] [Nat]Added 65 Read/Feed constraints in 33 ms returned sat
[2020-05-16 01:40:52] [INFO ] Deduced a trap composed of 29 places in 260 ms
[2020-05-16 01:40:52] [INFO ] Deduced a trap composed of 28 places in 95 ms
[2020-05-16 01:40:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 474 ms
[2020-05-16 01:40:52] [INFO ] Computed and/alt/rep : 255/1495/195 causal constraints in 25 ms.
[2020-05-16 01:40:53] [INFO ] Added : 188 causal constraints over 38 iterations in 723 ms. Result :sat
[2020-05-16 01:40:53] [INFO ] Deduced a trap composed of 9 places in 143 ms
[2020-05-16 01:40:53] [INFO ] Deduced a trap composed of 10 places in 81 ms
[2020-05-16 01:40:53] [INFO ] Deduced a trap composed of 9 places in 44 ms
[2020-05-16 01:40:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 386 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
[2020-05-16 01:40:53] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned unsat
[2020-05-16 01:40:53] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned unsat
[2020-05-16 01:40:53] [INFO ] [Real]Absence check using 37 positive place invariants in 8 ms returned unsat
FORMULA LamportFastMutEx-PT-5-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-PT-5-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-PT-5-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 51500 steps, including 976 resets, run finished after 131 ms. (steps per millisecond=393 ) properties seen :[0] could not realise parikh vector
Support contains 15 out of 137 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 137/137 places, 260/260 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 255
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 15 place count 132 transition count 250
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 20 place count 127 transition count 250
Applied a total of 20 rules in 39 ms. Remains 127 /137 variables (removed 10) and now considering 250/260 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/137 places, 250/260 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1412 ms. (steps per millisecond=708 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 643 ms. (steps per millisecond=1555 ) properties seen :[0]
Interrupted probabilistic random walk after 18281885 steps, run timeout after 30001 ms. (steps per millisecond=609 ) properties seen :[0]
Probabilistic random walk after 18281885 steps, saw 3246196 distinct states, run finished after 30001 ms. (steps per millisecond=609 ) properties seen :[0]
[2020-05-16 01:41:26] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2020-05-16 01:41:26] [INFO ] Computed 37 place invariants in 9 ms
[2020-05-16 01:41:26] [INFO ] [Real]Absence check using 37 positive place invariants in 15 ms returned sat
[2020-05-16 01:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:41:26] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2020-05-16 01:41:26] [INFO ] State equation strengthened by 65 read => feed constraints.
[2020-05-16 01:41:26] [INFO ] [Real]Added 65 Read/Feed constraints in 23 ms returned sat
[2020-05-16 01:41:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:41:26] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2020-05-16 01:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:41:26] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2020-05-16 01:41:26] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2020-05-16 01:41:26] [INFO ] Deduced a trap composed of 7 places in 22 ms
[2020-05-16 01:41:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2020-05-16 01:41:26] [INFO ] Computed and/alt/rep : 245/1685/185 causal constraints in 16 ms.
[2020-05-16 01:41:26] [INFO ] Added : 140 causal constraints over 28 iterations in 482 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
Incomplete Parikh walk after 30900 steps, including 940 resets, run finished after 53 ms. (steps per millisecond=583 ) properties seen :[0] could not realise parikh vector
Support contains 15 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 250/250 transitions.
Starting structural reductions, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2020-05-16 01:41:27] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2020-05-16 01:41:27] [INFO ] Computed 37 place invariants in 4 ms
[2020-05-16 01:41:27] [INFO ] Implicit Places using invariants in 131 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 134 ms to find 5 implicit places.
[2020-05-16 01:41:27] [INFO ] Redundant transitions in 26 ms returned []
[2020-05-16 01:41:27] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:41:27] [INFO ] Computed 32 place invariants in 15 ms
[2020-05-16 01:41:28] [INFO ] Dead Transitions using invariants and state equation in 1431 ms returned []
Starting structural reductions, iteration 1 : 122/127 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2020-05-16 01:41:28] [INFO ] Redundant transitions in 1 ms returned []
[2020-05-16 01:41:28] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:41:28] [INFO ] Computed 32 place invariants in 1 ms
[2020-05-16 01:41:32] [INFO ] Dead Transitions using invariants and state equation in 3328 ms returned []
Finished structural reductions, in 2 iterations. Remains : 122/127 places, 250/250 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1111 ms. (steps per millisecond=900 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 631 ms. (steps per millisecond=1584 ) properties seen :[0]
Interrupted probabilistic random walk after 18568728 steps, run timeout after 30001 ms. (steps per millisecond=618 ) properties seen :[0]
Probabilistic random walk after 18568728 steps, saw 3292431 distinct states, run finished after 30001 ms. (steps per millisecond=618 ) properties seen :[0]
[2020-05-16 01:42:03] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:42:03] [INFO ] Computed 32 place invariants in 3 ms
[2020-05-16 01:42:03] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2020-05-16 01:42:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:42:03] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2020-05-16 01:42:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2020-05-16 01:42:04] [INFO ] [Real]Added 40 Read/Feed constraints in 42 ms returned sat
[2020-05-16 01:42:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:42:04] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2020-05-16 01:42:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:42:04] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2020-05-16 01:42:04] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2020-05-16 01:42:04] [INFO ] Deduced a trap composed of 7 places in 86 ms
[2020-05-16 01:42:04] [INFO ] Deduced a trap composed of 7 places in 60 ms
[2020-05-16 01:42:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2020-05-16 01:42:04] [INFO ] Computed and/alt/rep : 245/1575/185 causal constraints in 14 ms.
[2020-05-16 01:42:04] [INFO ] Added : 135 causal constraints over 27 iterations in 467 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 31500 steps, including 959 resets, run finished after 50 ms. (steps per millisecond=630 ) properties seen :[0] could not realise parikh vector
Support contains 15 out of 122 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Starting structural reductions, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2020-05-16 01:42:04] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:42:04] [INFO ] Computed 32 place invariants in 0 ms
[2020-05-16 01:42:04] [INFO ] Implicit Places using invariants in 118 ms returned []
[2020-05-16 01:42:04] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:42:04] [INFO ] Computed 32 place invariants in 5 ms
[2020-05-16 01:42:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2020-05-16 01:42:05] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2020-05-16 01:42:05] [INFO ] Redundant transitions in 2 ms returned []
[2020-05-16 01:42:05] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:42:05] [INFO ] Computed 32 place invariants in 1 ms
[2020-05-16 01:42:05] [INFO ] Dead Transitions using invariants and state equation in 256 ms returned []
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 166 ms. (steps per millisecond=602 ) properties seen :[0]
[2020-05-16 01:42:05] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:42:05] [INFO ] Computed 32 place invariants in 13 ms
[2020-05-16 01:42:05] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2020-05-16 01:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:42:05] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2020-05-16 01:42:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2020-05-16 01:42:05] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2020-05-16 01:42:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:42:06] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned sat
[2020-05-16 01:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:42:06] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2020-05-16 01:42:06] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2020-05-16 01:42:06] [INFO ] Deduced a trap composed of 7 places in 55 ms
[2020-05-16 01:42:06] [INFO ] Deduced a trap composed of 7 places in 62 ms
[2020-05-16 01:42:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2020-05-16 01:42:06] [INFO ] Computed and/alt/rep : 245/1575/185 causal constraints in 26 ms.
[2020-05-16 01:42:06] [INFO ] Added : 135 causal constraints over 27 iterations in 423 ms. Result :sat
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 122 transition count 190
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 60 place count 122 transition count 165
Deduced a syphon composed of 25 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 1 with 70 rules applied. Total rules applied 130 place count 77 transition count 165
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 140 place count 72 transition count 160
Symmetric choice reduction at 1 with 5 rule applications. Total rules 145 place count 72 transition count 160
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 10 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 155 place count 67 transition count 150
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 160 place count 67 transition count 150
Applied a total of 160 rules in 46 ms. Remains 67 /122 variables (removed 55) and now considering 150/250 (removed 100) transitions.
// Phase 1: matrix 150 rows 67 cols
[2020-05-16 01:42:06] [INFO ] Computed 12 place invariants in 6 ms
[2020-05-16 01:42:06] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-05-16 01:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:42:06] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-05-16 01:42:06] [INFO ] Computed and/alt/rep : 140/730/140 causal constraints in 23 ms.
[2020-05-16 01:42:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:42:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2020-05-16 01:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:42:06] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2020-05-16 01:42:06] [INFO ] Computed and/alt/rep : 140/730/140 causal constraints in 9 ms.
[2020-05-16 01:42:07] [INFO ] Added : 97 causal constraints over 20 iterations in 200 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-05-16 01:42:07] [INFO ] Flatten gal took : 118 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-16 01:42:07] [INFO ] Applying decomposition
[2020-05-16 01:42:07] [INFO ] Flatten gal took : 69 ms
[2020-05-16 01:42:07] [INFO ] Flatten gal took : 51 ms
[2020-05-16 01:42:07] [INFO ] Input system was already deterministic with 250 transitions.
[2020-05-16 01:42:07] [INFO ] Input system was already deterministic with 250 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:42:07] [INFO ] Computed 32 place invariants in 2 ms
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_wait_4_1 + P_done_4_1 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_b_5_false + P_b_5_true = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_wait_1_5 + P_done_1_5 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_wait_2_3 + P_done_2_3 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_wait_3_3 + P_done_3_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : y_0 + y_1 + y_2 + y_3 + y_4 + y_5 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_wait_3_1 + P_done_3_1 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_wait_5_1 + P_done_5_1 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_wait_5_2 + P_done_5_2 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_b_2_false + P_b_2_true = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_wait_1_3 + P_done_1_3 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_wait_3_5 + P_done_3_5 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_wait_1_2 + P_done_1_2 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_wait_2_2 + P_done_2_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_wait_4_3 + P_done_4_3 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_wait_5_3 + P_done_5_3 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_wait_2_5 + P_done_2_5 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_wait_1_4 + P_done_1_4 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_wait_4_5 + P_done_4_5 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_wait_4_4 + P_done_4_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_wait_5_5 + P_done_5_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_wait_5_4 + P_done_5_4 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_b_4_false + P_b_4_true = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_wait_3_4 + P_done_3_4 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_wait_2_4 + P_done_2_4 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_wait_3_2 + P_done_3_2 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_b_1_false + P_b_1_true = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_wait_4_2 + P_done_4_2 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_wait_1_1 + P_done_1_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_wait_2_1 + P_done_2_1 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_b_3_false + P_b_3_true = 1
inv : x_0 + x_1 + x_2 + x_3 + x_4 + x_5 = 1
Total of 32 invariants.
[2020-05-16 01:42:07] [INFO ] Computed 32 place invariants in 6 ms
[2020-05-16 01:42:07] [INFO ] Ran tautology test, simplified 0 / 1 in 304 ms.
[2020-05-16 01:42:08] [INFO ] BMC solution for property LamportFastMutEx-PT-5-ReachabilityCardinality-02(UNSAT) depth K=0 took 44 ms
[2020-05-16 01:42:08] [INFO ] BMC solution for property LamportFastMutEx-PT-5-ReachabilityCardinality-02(UNSAT) depth K=1 took 27 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2020-05-16 01:42:08] [INFO ] Computed 32 place invariants in 1 ms
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_wait_4_1 + P_done_4_1 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_b_5_false + P_b_5_true = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_wait_1_5 + P_done_1_5 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_wait_2_3 + P_done_2_3 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_wait_3_3 + P_done_3_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : y_0 + y_1 + y_2 + y_3 + y_4 + y_5 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_wait_3_1 + P_done_3_1 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_wait_5_1 + P_done_5_1 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_wait_5_2 + P_done_5_2 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_b_2_false + P_b_2_true = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_wait_1_3 + P_done_1_3 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_wait_3_5 + P_done_3_5 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_wait_1_2 + P_done_1_2 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_wait_2_2 + P_done_2_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_wait_4_3 + P_done_4_3 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_wait_5_3 + P_done_5_3 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_wait_2_5 + P_done_2_5 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_wait_1_4 + P_done_1_4 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_wait_4_5 + P_done_4_5 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_wait_4_4 + P_done_4_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_wait_5_5 + P_done_5_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_wait_5_4 + P_done_5_4 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_b_4_false + P_b_4_true = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_wait_3_4 + P_done_3_4 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_wait_2_4 + P_done_2_4 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_wait_3_2 + P_done_3_2 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_b_1_false + P_b_1_true = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_wait_4_2 + P_done_4_2 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_wait_1_1 + P_done_1_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_wait_2_1 + P_done_2_1 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_b_3_false + P_b_3_true = 1
inv : x_0 + x_1 + x_2 + x_3 + x_4 + x_5 = 1
Total of 32 invariants.
[2020-05-16 01:42:08] [INFO ] Computed 32 place invariants in 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph14423681477412518392.txt, -o, /tmp/graph14423681477412518392.bin, -w, /tmp/graph14423681477412518392.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph14423681477412518392.bin, -l, -1, -v, -w, /tmp/graph14423681477412518392.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 01:42:08] [INFO ] BMC solution for property LamportFastMutEx-PT-5-ReachabilityCardinality-02(UNSAT) depth K=2 took 78 ms
[2020-05-16 01:42:08] [INFO ] Decomposing Gal with order
[2020-05-16 01:42:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 01:42:08] [INFO ] Removed a total of 391 redundant transitions.
[2020-05-16 01:42:08] [INFO ] Flatten gal took : 130 ms
[2020-05-16 01:42:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 119 labels/synchronizations in 24 ms.
[2020-05-16 01:42:08] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 5 ms
[2020-05-16 01:42:08] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityCardinality.prop.
Read [reachable] property : LamportFastMutEx-PT-5-ReachabilityCardinality-02 with value :((((((gu17.P_CS_21_1+gu17.P_CS_21_2)+gu17.P_CS_21_3)+gu17.P_CS_21_4)+gu17.P_CS_21_5)>=3)&&(((((gu9.P_setbi_11_1+gu9.P_setbi_11_2)+gu9.P_setbi_11_3)+gu9.P_setbi_11_4)+gu9.P_setbi_11_5)<=((((gu9.P_ify0_4_1+gu9.P_ify0_4_2)+gu9.P_ify0_4_3)+gu9.P_ify0_4_4)+gu9.P_ify0_4_5)))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
[2020-05-16 01:42:08] [INFO ] BMC solution for property LamportFastMutEx-PT-5-ReachabilityCardinality-02(UNSAT) depth K=3 took 614 ms
SDD proceeding with computation, new max is 2048
[2020-05-16 01:42:09] [INFO ] Proved 122 variables to be positive in 1155 ms
[2020-05-16 01:42:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-PT-5-ReachabilityCardinality-02
[2020-05-16 01:42:09] [INFO ] KInduction solution for property LamportFastMutEx-PT-5-ReachabilityCardinality-02(SAT) depth K=0 took 4 ms
[2020-05-16 01:42:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-PT-5-ReachabilityCardinality-02
[2020-05-16 01:42:09] [INFO ] KInduction solution for property LamportFastMutEx-PT-5-ReachabilityCardinality-02(SAT) depth K=1 took 29 ms
[2020-05-16 01:42:09] [INFO ] Proved 122 variables to be positive in 1538 ms
[2020-05-16 01:42:09] [INFO ] Computing symmetric may disable matrix : 250 transitions.
[2020-05-16 01:42:09] [INFO ] Computation of disable matrix completed :0/250 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 01:42:09] [INFO ] Computation of Complete disable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 01:42:09] [INFO ] Computing symmetric may enable matrix : 250 transitions.
[2020-05-16 01:42:09] [INFO ] Computation of Complete enable matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 01:42:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-PT-5-ReachabilityCardinality-02
[2020-05-16 01:42:09] [INFO ] KInduction solution for property LamportFastMutEx-PT-5-ReachabilityCardinality-02(SAT) depth K=2 took 253 ms
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
[2020-05-16 01:42:11] [INFO ] Computing symmetric co enabling matrix : 250 transitions.
[2020-05-16 01:42:12] [INFO ] BMC solution for property LamportFastMutEx-PT-5-ReachabilityCardinality-02(UNSAT) depth K=4 took 3544 ms
[2020-05-16 01:42:12] [INFO ] Computation of co-enabling matrix(4/250) took 1124 ms. Total solver calls (SAT/UNSAT): 263(12/251)
SDD proceeding with computation, new max is 16384
[2020-05-16 01:42:15] [INFO ] Computation of co-enabling matrix(40/250) took 4183 ms. Total solver calls (SAT/UNSAT): 3081(216/2865)
[2020-05-16 01:42:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-PT-5-ReachabilityCardinality-02
[2020-05-16 01:42:17] [INFO ] KInduction solution for property LamportFastMutEx-PT-5-ReachabilityCardinality-02(SAT) depth K=3 took 8074 ms
[2020-05-16 01:42:18] [INFO ] Computation of co-enabling matrix(53/250) took 7185 ms. Total solver calls (SAT/UNSAT): 4823(411/4412)
SDD proceeding with computation, new max is 32768
[2020-05-16 01:42:21] [INFO ] BMC solution for property LamportFastMutEx-PT-5-ReachabilityCardinality-02(UNSAT) depth K=5 took 8664 ms
[2020-05-16 01:42:21] [INFO ] Computation of co-enabling matrix(79/250) took 10346 ms. Total solver calls (SAT/UNSAT): 7120(660/6460)
[2020-05-16 01:42:24] [INFO ] Computation of co-enabling matrix(107/250) took 13374 ms. Total solver calls (SAT/UNSAT): 9794(973/8821)
[2020-05-16 01:42:27] [INFO ] Computation of co-enabling matrix(145/250) took 16376 ms. Total solver calls (SAT/UNSAT): 11435(1123/10312)
[2020-05-16 01:42:30] [INFO ] Computation of co-enabling matrix(180/250) took 19495 ms. Total solver calls (SAT/UNSAT): 12573(1263/11310)
[2020-05-16 01:42:33] [INFO ] Computation of co-enabling matrix(213/250) took 22496 ms. Total solver calls (SAT/UNSAT): 13501(1360/12141)
[2020-05-16 01:42:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-PT-5-ReachabilityCardinality-02
[2020-05-16 01:42:33] [INFO ] KInduction solution for property LamportFastMutEx-PT-5-ReachabilityCardinality-02(SAT) depth K=4 took 16151 ms
[2020-05-16 01:42:36] [INFO ] Computation of Finished co-enabling matrix. took 25011 ms. Total solver calls (SAT/UNSAT): 13975(1420/12555)
[2020-05-16 01:42:36] [INFO ] Computing Do-Not-Accords matrix : 250 transitions.
[2020-05-16 01:42:36] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 01:42:36] [INFO ] Built C files in 29040ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 2601 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 63 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, LamportFastMutExPT5ReachabilityCardinality02==true], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, LamportFastMutExPT5ReachabilityCardinality02==true], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, LamportFastMutExPT5ReachabilityCardinality02==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
SDD proceeding with computation, new max is 65536
[2020-05-16 01:43:00] [INFO ] BMC solution for property LamportFastMutEx-PT-5-ReachabilityCardinality-02(UNSAT) depth K=6 took 39461 ms
[2020-05-16 01:43:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-PT-5-ReachabilityCardinality-02
[2020-05-16 01:43:12] [INFO ] KInduction solution for property LamportFastMutEx-PT-5-ReachabilityCardinality-02(SAT) depth K=5 took 38828 ms
SDD proceeding with computation, new max is 131072
[2020-05-16 01:43:44] [INFO ] BMC solution for property LamportFastMutEx-PT-5-ReachabilityCardinality-02(UNSAT) depth K=7 took 43775 ms
[2020-05-16 01:44:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-PT-5-ReachabilityCardinality-02
[2020-05-16 01:44:31] [INFO ] KInduction solution for property LamportFastMutEx-PT-5-ReachabilityCardinality-02(SAT) depth K=6 took 79012 ms
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,4.35093e+08,145.127,1895692,2,153943,34,8.00805e+06,7,0,756,8.34616e+06,0
Total reachable state count : 435092592
Verifying 1 reachability properties.
Reachability property LamportFastMutEx-PT-5-ReachabilityCardinality-02 does not hold.
FORMULA LamportFastMutEx-PT-5-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : LamportFastMutEx-PT-5-ReachabilityCardinality-02
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-PT-5-ReachabilityCardinality-02,0,145.259,1895692,1,0,34,8.00805e+06,7,0,774,8.34616e+06,0
[2020-05-16 01:44:35] [WARNING] Interrupting SMT solver.
ITS tools runner thread asked to quit. Dying gracefully.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-16 01:44:35] [WARNING] Unexpected error occurred while running SMT. Was verifying LamportFastMutEx-PT-5-ReachabilityCardinality-02 K-induction depth 7
Exception in thread "Thread-5" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:343)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
... 3 more
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-16 01:44:35] [WARNING] Unexpected error occurred while running SMT. Was verifying LamportFastMutEx-PT-5-ReachabilityCardinality-02 SMT depth 8
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
[2020-05-16 01:44:35] [INFO ] During BMC, SMT solver timed out at depth 8
[2020-05-16 01:44:35] [INFO ] BMC solving timed out (3600000 secs) at depth 8
[2020-05-16 01:44:35] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
BK_STOP 1589593475976
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
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-5"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is LamportFastMutEx-PT-5, 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 r096-oct2-158940145400670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-5.tgz
mv LamportFastMutEx-PT-5 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 '
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 ;