fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r165-tall-167838850500518
Last Updated
May 14, 2023

About the Execution of ITS-Tools for FlexibleBarrier-PT-12b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
455.399 21786.00 50862.00 1766.10 TTFFTTFFFTFTFTTT normal

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.r165-tall-167838850500518.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 itstools
Input is FlexibleBarrier-PT-12b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850500518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 12:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 12:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 12:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 536K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679504972696

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=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12b
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-22 17:09:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 17:09:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:09:34] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2023-03-22 17:09:34] [INFO ] Transformed 1988 places.
[2023-03-22 17:09:34] [INFO ] Transformed 2289 transitions.
[2023-03-22 17:09:34] [INFO ] Found NUPN structural information;
[2023-03-22 17:09:34] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 114 resets, run finished after 677 ms. (steps per millisecond=14 ) properties (out of 13) seen :3
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-22 17:09:35] [INFO ] Flatten gal took : 300 ms
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
[2023-03-22 17:09:35] [INFO ] Flatten gal took : 130 ms
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
[2023-03-22 17:09:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16346694832448014945.gal : 108 ms
[2023-03-22 17:09:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality149823727722984177.prop : 1 ms
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16346694832448014945.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality149823727722984177.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :1
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2289 rows 1988 cols
[2023-03-22 17:09:35] [INFO ] Computed 14 place invariants in 71 ms
Loading property file /tmp/ReachabilityCardinality149823727722984177.prop.
[2023-03-22 17:09:36] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-22 17:09:36] [INFO ] After 780ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 17:09:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 40
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :40 after 44
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :44 after 1036
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :1036 after 65612
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :65612 after 1.00765e+08
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :1.00765e+08 after 1.40879e+14
[2023-03-22 17:09:39] [INFO ] After 1882ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-22 17:09:39] [INFO ] Deduced a trap composed of 114 places in 301 ms of which 5 ms to minimize.
[2023-03-22 17:09:39] [INFO ] Deduced a trap composed of 230 places in 119 ms of which 1 ms to minimize.
[2023-03-22 17:09:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 625 ms
[2023-03-22 17:09:40] [INFO ] Deduced a trap composed of 688 places in 606 ms of which 2 ms to minimize.
[2023-03-22 17:09:41] [INFO ] Deduced a trap composed of 649 places in 474 ms of which 2 ms to minimize.
[2023-03-22 17:09:41] [INFO ] Deduced a trap composed of 678 places in 464 ms of which 1 ms to minimize.
[2023-03-22 17:09:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1846 ms
[2023-03-22 17:09:42] [INFO ] Deduced a trap composed of 120 places in 623 ms of which 1 ms to minimize.
[2023-03-22 17:09:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 760 ms
[2023-03-22 17:09:43] [INFO ] Deduced a trap composed of 715 places in 657 ms of which 1 ms to minimize.
[2023-03-22 17:09:44] [INFO ] Deduced a trap composed of 688 places in 723 ms of which 2 ms to minimize.
[2023-03-22 17:09:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1611 ms
[2023-03-22 17:09:45] [INFO ] Deduced a trap composed of 651 places in 651 ms of which 1 ms to minimize.
[2023-03-22 17:09:45] [INFO ] Deduced a trap composed of 641 places in 596 ms of which 1 ms to minimize.
[2023-03-22 17:09:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1459 ms
[2023-03-22 17:09:46] [INFO ] Deduced a trap composed of 674 places in 605 ms of which 1 ms to minimize.
[2023-03-22 17:09:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 736 ms
[2023-03-22 17:09:47] [INFO ] After 9672ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 652 ms.
[2023-03-22 17:09:47] [INFO ] After 11252ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 105 ms.
Support contains 102 out of 1988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1785 edges and 1988 vertex of which 50 / 1988 are part of one of the 8 SCC in 8 ms
Free SCC test removed 42 places
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 452 transitions
Trivial Post-agglo rules discarded 452 transitions
Performed 452 trivial Post agglomeration. Transition count delta: 452
Iterating post reduction 0 with 452 rules applied. Total rules applied 453 place count 1946 transition count 1786
Reduce places removed 452 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 476 rules applied. Total rules applied 929 place count 1494 transition count 1762
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 953 place count 1470 transition count 1762
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 953 place count 1470 transition count 1652
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 1173 place count 1360 transition count 1652
Discarding 686 places :
Symmetric choice reduction at 3 with 686 rule applications. Total rules 1859 place count 674 transition count 966
Iterating global reduction 3 with 686 rules applied. Total rules applied 2545 place count 674 transition count 966
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 2545 place count 674 transition count 961
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 2555 place count 669 transition count 961
Discarding 89 places :
Symmetric choice reduction at 3 with 89 rule applications. Total rules 2644 place count 580 transition count 872
Iterating global reduction 3 with 89 rules applied. Total rules applied 2733 place count 580 transition count 872
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 3 with 75 rules applied. Total rules applied 2808 place count 580 transition count 797
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 2958 place count 505 transition count 722
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 2974 place count 505 transition count 706
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2981 place count 498 transition count 699
Iterating global reduction 5 with 7 rules applied. Total rules applied 2988 place count 498 transition count 699
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2992 place count 496 transition count 711
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 2996 place count 496 transition count 707
Free-agglomeration rule applied 288 times.
Iterating global reduction 5 with 288 rules applied. Total rules applied 3284 place count 496 transition count 419
Reduce places removed 288 places and 0 transitions.
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 5 with 329 rules applied. Total rules applied 3613 place count 208 transition count 378
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 6 with 30 rules applied. Total rules applied 3643 place count 208 transition count 348
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3644 place count 208 transition count 348
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3645 place count 208 transition count 347
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3646 place count 207 transition count 346
Applied a total of 3646 rules in 471 ms. Remains 207 /1988 variables (removed 1781) and now considering 346/2289 (removed 1943) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 471 ms. Remains : 207/1988 places, 346/2289 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 6) seen :2
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 17:09:48] [INFO ] Flow matrix only has 329 transitions (discarded 17 similar events)
// Phase 1: matrix 329 rows 207 cols
[2023-03-22 17:09:48] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-22 17:09:48] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 17:09:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 17:09:48] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 17:09:48] [INFO ] State equation strengthened by 173 read => feed constraints.
[2023-03-22 17:09:48] [INFO ] After 79ms SMT Verify possible using 173 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 17:09:49] [INFO ] Deduced a trap composed of 25 places in 19 ms of which 0 ms to minimize.
[2023-03-22 17:09:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-22 17:09:49] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2023-03-22 17:09:49] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2023-03-22 17:09:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2023-03-22 17:09:49] [INFO ] After 377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-22 17:09:49] [INFO ] After 644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 28 ms.
Support contains 68 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 346/346 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 207 transition count 337
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 198 transition count 337
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 31 place count 185 transition count 324
Iterating global reduction 2 with 13 rules applied. Total rules applied 44 place count 185 transition count 324
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 68 place count 173 transition count 312
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 73 place count 173 transition count 307
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 171 transition count 305
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 171 transition count 305
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 83 place count 171 transition count 299
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 170 transition count 312
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 89 place count 170 transition count 308
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 93 place count 170 transition count 304
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 102 place count 170 transition count 295
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 116 place count 161 transition count 290
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 119 place count 161 transition count 287
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 120 place count 161 transition count 287
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 124 place count 161 transition count 283
Applied a total of 124 rules in 91 ms. Remains 161 /207 variables (removed 46) and now considering 283/346 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 161/207 places, 283/346 transitions.
Incomplete random walk after 10000 steps, including 152 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 4) seen :2
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 17:09:49] [INFO ] Flow matrix only has 265 transitions (discarded 18 similar events)
// Phase 1: matrix 265 rows 161 cols
[2023-03-22 17:09:49] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-22 17:09:49] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 17:09:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 17:09:49] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 17:09:49] [INFO ] State equation strengthened by 156 read => feed constraints.
[2023-03-22 17:09:49] [INFO ] After 18ms SMT Verify possible using 156 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 17:09:49] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-22 17:09:49] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 12 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 283/283 transitions.
Graph (trivial) has 85 edges and 161 vertex of which 10 / 161 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 155 transition count 256
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 138 transition count 256
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 35 place count 138 transition count 255
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 37 place count 137 transition count 255
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 137 transition count 254
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 65 place count 110 transition count 227
Iterating global reduction 3 with 27 rules applied. Total rules applied 92 place count 110 transition count 227
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 122 place count 95 transition count 212
Drop transitions removed 27 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 153 place count 95 transition count 181
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 155 place count 93 transition count 179
Iterating global reduction 4 with 2 rules applied. Total rules applied 157 place count 93 transition count 179
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 171 place count 93 transition count 165
Free-agglomeration rule applied 12 times with reduction of 1 identical transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 183 place count 93 transition count 152
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 210 place count 81 transition count 137
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 212 place count 81 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 214 place count 79 transition count 133
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1979.t1510.t1511.t1489.t1490.t12 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 59 edges and 77 vertex of which 20 / 77 are part of one of the 10 SCC in 1 ms
Free SCC test removed 10 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 217 place count 67 transition count 131
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 237 place count 67 transition count 111
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 13 Pre rules applied. Total rules applied 237 place count 67 transition count 98
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 263 place count 54 transition count 98
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 275 place count 54 transition count 86
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 297 place count 43 transition count 75
Free-agglomeration rule applied 12 times.
Iterating global reduction 8 with 12 rules applied. Total rules applied 309 place count 43 transition count 63
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 38 rules applied. Total rules applied 347 place count 25 transition count 43
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 357 place count 25 transition count 33
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 358 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 359 place count 24 transition count 32
Applied a total of 359 rules in 43 ms. Remains 24 /161 variables (removed 137) and now considering 32/283 (removed 251) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 24/161 places, 32/283 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished Best-First random walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 15853 ms.

BK_STOP 1679504994482

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="FlexibleBarrier-PT-12b"
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"
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 itstools"
echo " Input is FlexibleBarrier-PT-12b, 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 r165-tall-167838850500518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12b.tgz
mv FlexibleBarrier-PT-12b 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 ;