MCC'2021- Execution of r140-tall-162089128200646

About the Execution of ITS-Tools for Peterson-PT-7

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1289.651	301999.00	196334.00	69995.10	TFTFTTFTTFFFTFTF	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128200646.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-7, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200646
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 1.4M May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.1M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.8M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 113K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 335K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 116K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 380K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 159K Mar 27 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 427K Mar 27 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 127K Mar 25 08:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 418K Mar 25 08:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 23K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 47K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 2.3M May 5 16:51 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 Peterson-PT-7-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621031216246

Running Version 0
[2021-05-14 22:27:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 22:27:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 22:27:19] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2021-05-14 22:27:19] [INFO ] Transformed 1992 places.
[2021-05-14 22:27:19] [INFO ] Transformed 3096 transitions.
[2021-05-14 22:27:19] [INFO ] Found NUPN structural information;
[2021-05-14 22:27:19] [INFO ] Parsed PT model containing 1992 places and 3096 transitions in 307 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 105 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-7-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 13) seen :7
FORMULA Peterson-PT-7-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2021-05-14 22:27:20] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2021-05-14 22:27:20] [INFO ] Computed 31 place invariants in 38 ms
[2021-05-14 22:27:21] [INFO ] [Real]Absence check using 23 positive place invariants in 44 ms returned unsat
[2021-05-14 22:27:21] [INFO ] [Real]Absence check using 23 positive place invariants in 41 ms returned sat
[2021-05-14 22:27:21] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:27:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:27:22] [INFO ] [Real]Absence check using state equation in 910 ms returned sat
[2021-05-14 22:27:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:27:23] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2021-05-14 22:27:23] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-14 22:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:27:24] [INFO ] [Real]Absence check using state equation in 1161 ms returned sat
[2021-05-14 22:27:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:27:29] [INFO ] [Real]Absence check using 23 positive place invariants in 42 ms returned sat
[2021-05-14 22:27:29] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:27:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:27:30] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2021-05-14 22:27:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:27:44] [INFO ] [Real]Absence check using 23 positive place invariants in 36 ms returned sat
[2021-05-14 22:27:44] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:27:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:27:45] [INFO ] [Real]Absence check using state equation in 973 ms returned sat
[2021-05-14 22:27:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:27:46] [INFO ] [Real]Absence check using 23 positive place invariants in 37 ms returned sat
[2021-05-14 22:27:46] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:27:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:27:47] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2021-05-14 22:27:47] [INFO ] Solution in real domain found non-integer solution.
FORMULA Peterson-PT-7-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-7-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-7-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-7-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 1 different solutions.
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 888 transitions
Trivial Post-agglo rules discarded 888 transitions
Performed 888 trivial Post agglomeration. Transition count delta: 888
Iterating post reduction 0 with 888 rules applied. Total rules applied 888 place count 1992 transition count 2208
Reduce places removed 888 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 891 rules applied. Total rules applied 1779 place count 1104 transition count 2205
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1782 place count 1101 transition count 2205
Performed 445 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 445 Pre rules applied. Total rules applied 1782 place count 1101 transition count 1760
Deduced a syphon composed of 445 places in 2 ms
Reduce places removed 445 places and 0 transitions.
Iterating global reduction 3 with 890 rules applied. Total rules applied 2672 place count 656 transition count 1760
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 2784 place count 600 transition count 1704
Applied a total of 2784 rules in 367 ms. Remains 600 /1992 variables (removed 1392) and now considering 1704/3096 (removed 1392) transitions.
Finished structural reductions, in 1 iterations. Remains : 600/1992 places, 1704/3096 transitions.
[2021-05-14 22:27:48] [INFO ] Flatten gal took : 160 ms
[2021-05-14 22:27:48] [INFO ] Flatten gal took : 102 ms
[2021-05-14 22:27:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8301067400722660975.gal : 27 ms
[2021-05-14 22:27:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2084342952499274499.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8301067400722660975.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2084342952499274499.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.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality8301067400722660975.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2084342952499274499.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2084342952499274499.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 15
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :15 after 29
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :29 after 33
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :33 after 48
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :48 after 121
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :121 after 155
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :155 after 381
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :381 after 1583
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1583 after 2725
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2725 after 9467
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :9467 after 40350
Detected timeout of ITS tools.
[2021-05-14 22:28:03] [INFO ] Flatten gal took : 76 ms
[2021-05-14 22:28:03] [INFO ] Applying decomposition
[2021-05-14 22:28:03] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12000688590022949850.txt, -o, /tmp/graph12000688590022949850.bin, -w, /tmp/graph12000688590022949850.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12000688590022949850.bin, -l, -1, -v, -w, /tmp/graph12000688590022949850.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 22:28:06] [INFO ] Decomposing Gal with order
[2021-05-14 22:28:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 22:28:06] [INFO ] Removed a total of 2499 redundant transitions.
[2021-05-14 22:28:06] [INFO ] Flatten gal took : 300 ms
[2021-05-14 22:28:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 875 labels/synchronizations in 87 ms.
[2021-05-14 22:28:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4927049129614836346.gal : 26 ms
[2021-05-14 22:28:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3457712738788967511.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4927049129614836346.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3457712738788967511.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4927049129614836346.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3457712738788967511.prop --nowitness
Loading property file /tmp/ReachabilityCardinality3457712738788967511.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 34
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :34 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 201498
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3684724313063131162
[2021-05-14 22:28:26] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3684724313063131162
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3684724313063131162]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3684724313063131162] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3684724313063131162] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3335 ms. (steps per millisecond=299 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 906 ms. (steps per millisecond=1103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 785 ms. (steps per millisecond=1273 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 6518412 steps, run timeout after 30001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 6518412 steps, saw 743566 distinct states, run finished after 48137 ms. (steps per millisecond=135 ) properties seen :{}
Running SMT prover for 2 properties.
[2021-05-14 22:29:20] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 600 cols
[2021-05-14 22:29:20] [INFO ] Computed 31 place invariants in 5 ms
[2021-05-14 22:29:21] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2021-05-14 22:29:21] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-14 22:29:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:29:21] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2021-05-14 22:29:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:29:21] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2021-05-14 22:29:21] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:29:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:29:21] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2021-05-14 22:29:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:29:21] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:29:21] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-14 22:29:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:29:22] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2021-05-14 22:29:22] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 22:29:22] [INFO ] [Nat]Added 546 Read/Feed constraints in 57 ms returned sat
[2021-05-14 22:29:23] [INFO ] Deduced a trap composed of 39 places in 1140 ms of which 3 ms to minimize.
[2021-05-14 22:29:23] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 1 ms to minimize.
[2021-05-14 22:29:23] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 1 ms to minimize.
[2021-05-14 22:29:24] [INFO ] Deduced a trap composed of 47 places in 184 ms of which 2 ms to minimize.
[2021-05-14 22:29:24] [INFO ] Deduced a trap composed of 50 places in 180 ms of which 1 ms to minimize.
[2021-05-14 22:29:24] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 1 ms to minimize.
[2021-05-14 22:29:24] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 1 ms to minimize.
[2021-05-14 22:29:25] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 1 ms to minimize.
[2021-05-14 22:29:25] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 1 ms to minimize.
[2021-05-14 22:29:25] [INFO ] Deduced a trap composed of 86 places in 207 ms of which 0 ms to minimize.
[2021-05-14 22:29:25] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 1 ms to minimize.
[2021-05-14 22:29:26] [INFO ] Deduced a trap composed of 75 places in 234 ms of which 0 ms to minimize.
[2021-05-14 22:29:26] [INFO ] Deduced a trap composed of 60 places in 180 ms of which 4 ms to minimize.
[2021-05-14 22:29:26] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 0 ms to minimize.
[2021-05-14 22:29:26] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:29:26] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 1 ms to minimize.
[2021-05-14 22:29:27] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 1 ms to minimize.
[2021-05-14 22:29:27] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 1 ms to minimize.
[2021-05-14 22:29:27] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.
[2021-05-14 22:29:27] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:29:28] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2021-05-14 22:29:28] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 0 ms to minimize.
[2021-05-14 22:29:28] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 1 ms to minimize.
[2021-05-14 22:29:58] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 0 ms to minimize.
[2021-05-14 22:29:59] [INFO ] Deduced a trap composed of 14 places in 245 ms of which 1 ms to minimize.
[2021-05-14 22:29:59] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 1 ms to minimize.
[2021-05-14 22:29:59] [INFO ] Deduced a trap composed of 20 places in 231 ms of which 1 ms to minimize.
[2021-05-14 22:29:59] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 1 ms to minimize.
[2021-05-14 22:30:00] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 0 ms to minimize.
[2021-05-14 22:30:00] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 1 ms to minimize.
[2021-05-14 22:30:00] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 0 ms to minimize.
[2021-05-14 22:30:01] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 1 ms to minimize.
[2021-05-14 22:30:01] [INFO ] Deduced a trap composed of 52 places in 198 ms of which 0 ms to minimize.
[2021-05-14 22:30:01] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 1 ms to minimize.
[2021-05-14 22:30:01] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 39260 ms
[2021-05-14 22:30:01] [INFO ] Computed and/alt/rep : 1248/4784/1248 causal constraints (skipped 112 transitions) in 96 ms.
[2021-05-14 22:30:07] [INFO ] Deduced a trap composed of 2 places in 260 ms of which 1 ms to minimize.
[2021-05-14 22:30:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
FORMULA Peterson-PT-7-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Support contains 2 out of 600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 600/600 places, 1704/1704 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 600 transition count 1702
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 598 transition count 1702
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 598 transition count 1699
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 595 transition count 1699
Applied a total of 10 rules in 72 ms. Remains 595 /600 variables (removed 5) and now considering 1699/1704 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 595/600 places, 1699/1704 transitions.
[2021-05-14 22:30:07] [INFO ] Flatten gal took : 56 ms
[2021-05-14 22:30:07] [INFO ] Flatten gal took : 55 ms
[2021-05-14 22:30:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13613256875391632021.gal : 7446 ms
[2021-05-14 22:30:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8478386871309172495.prop : 432 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality13613256875391632021.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8478386871309172495.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.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality13613256875391632021.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8478386871309172495.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8478386871309172495.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 32
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32 after 99
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :99 after 121
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :121 after 283
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :283 after 380
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :380 after 1756
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1756 after 4367
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4367 after 9512
Detected timeout of ITS tools.
[2021-05-14 22:30:30] [INFO ] Flatten gal took : 54 ms
[2021-05-14 22:30:30] [INFO ] Applying decomposition
[2021-05-14 22:30:30] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5995064613466060947.txt, -o, /tmp/graph5995064613466060947.bin, -w, /tmp/graph5995064613466060947.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5995064613466060947.bin, -l, -1, -v, -w, /tmp/graph5995064613466060947.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 22:30:30] [INFO ] Decomposing Gal with order
[2021-05-14 22:30:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 22:30:30] [INFO ] Removed a total of 2499 redundant transitions.
[2021-05-14 22:30:30] [INFO ] Flatten gal took : 118 ms
[2021-05-14 22:30:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 943 labels/synchronizations in 48 ms.
[2021-05-14 22:30:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2911285364092467960.gal : 12 ms
[2021-05-14 22:30:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14694495519805950141.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2911285364092467960.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14694495519805950141.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality2911285364092467960.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14694495519805950141.prop --nowitness
Loading property file /tmp/ReachabilityCardinality14694495519805950141.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 544
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11645470602722875264
[2021-05-14 22:30:45] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11645470602722875264
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11645470602722875264]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11645470602722875264] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11645470602722875264] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3350 ms. (steps per millisecond=298 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 761 ms. (steps per millisecond=1314 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6613803 steps, run timeout after 30001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 6613803 steps, saw 752474 distinct states, run finished after 30001 ms. (steps per millisecond=220 ) properties seen :{}
Running SMT prover for 1 properties.
[2021-05-14 22:31:20] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 595 cols
[2021-05-14 22:31:20] [INFO ] Computed 31 place invariants in 5 ms
[2021-05-14 22:31:20] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:31:20] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 0 ms returned sat
[2021-05-14 22:31:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:31:21] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2021-05-14 22:31:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:31:21] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2021-05-14 22:31:21] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:31:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:31:21] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2021-05-14 22:31:21] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 22:31:21] [INFO ] [Nat]Added 546 Read/Feed constraints in 63 ms returned sat
[2021-05-14 22:31:21] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 0 ms to minimize.
[2021-05-14 22:31:22] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 0 ms to minimize.
[2021-05-14 22:31:22] [INFO ] Deduced a trap composed of 51 places in 208 ms of which 1 ms to minimize.
[2021-05-14 22:31:22] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 0 ms to minimize.
[2021-05-14 22:31:22] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 0 ms to minimize.
[2021-05-14 22:31:23] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 1 ms to minimize.
[2021-05-14 22:31:23] [INFO ] Deduced a trap composed of 56 places in 198 ms of which 1 ms to minimize.
[2021-05-14 22:31:23] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 2 ms to minimize.
[2021-05-14 22:31:23] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 1 ms to minimize.
[2021-05-14 22:31:24] [INFO ] Deduced a trap composed of 39 places in 234 ms of which 11 ms to minimize.
[2021-05-14 22:31:24] [INFO ] Deduced a trap composed of 69 places in 222 ms of which 1 ms to minimize.
[2021-05-14 22:31:24] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 0 ms to minimize.
[2021-05-14 22:31:24] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 0 ms to minimize.
[2021-05-14 22:31:25] [INFO ] Deduced a trap composed of 58 places in 213 ms of which 1 ms to minimize.
[2021-05-14 22:31:25] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 0 ms to minimize.
[2021-05-14 22:31:25] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 0 ms to minimize.
[2021-05-14 22:31:25] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 1 ms to minimize.
[2021-05-14 22:31:26] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 1 ms to minimize.
[2021-05-14 22:31:26] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 1 ms to minimize.
[2021-05-14 22:31:26] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 0 ms to minimize.
[2021-05-14 22:31:26] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2021-05-14 22:31:27] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 1 ms to minimize.
[2021-05-14 22:31:27] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 1 ms to minimize.
[2021-05-14 22:31:27] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 0 ms to minimize.
[2021-05-14 22:31:27] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 0 ms to minimize.
[2021-05-14 22:31:28] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 0 ms to minimize.
[2021-05-14 22:31:28] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 0 ms to minimize.
[2021-05-14 22:31:28] [INFO ] Deduced a trap composed of 74 places in 206 ms of which 0 ms to minimize.
[2021-05-14 22:31:28] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 5 ms to minimize.
[2021-05-14 22:31:29] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 1 ms to minimize.
[2021-05-14 22:31:29] [INFO ] Deduced a trap composed of 54 places in 197 ms of which 0 ms to minimize.
[2021-05-14 22:31:29] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 0 ms to minimize.
[2021-05-14 22:31:29] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 0 ms to minimize.
[2021-05-14 22:31:30] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 1 ms to minimize.
[2021-05-14 22:31:30] [INFO ] Deduced a trap composed of 57 places in 185 ms of which 1 ms to minimize.
[2021-05-14 22:31:30] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 0 ms to minimize.
[2021-05-14 22:31:30] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:31:30] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 1 ms to minimize.
[2021-05-14 22:31:31] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 1 ms to minimize.
[2021-05-14 22:31:31] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 1 ms to minimize.
[2021-05-14 22:31:31] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 1 ms to minimize.
[2021-05-14 22:31:31] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 0 ms to minimize.
[2021-05-14 22:31:32] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:31:32] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 0 ms to minimize.
[2021-05-14 22:31:32] [INFO ] Deduced a trap composed of 52 places in 191 ms of which 1 ms to minimize.
[2021-05-14 22:31:32] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 1 ms to minimize.
[2021-05-14 22:31:33] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 1 ms to minimize.
[2021-05-14 22:31:33] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 1 ms to minimize.
[2021-05-14 22:31:33] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 0 ms to minimize.
[2021-05-14 22:31:33] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 0 ms to minimize.
[2021-05-14 22:31:33] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 0 ms to minimize.
[2021-05-14 22:31:34] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 1 ms to minimize.
[2021-05-14 22:31:34] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 0 ms to minimize.
[2021-05-14 22:31:34] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 1 ms to minimize.
[2021-05-14 22:31:34] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 0 ms to minimize.
[2021-05-14 22:31:35] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 0 ms to minimize.
[2021-05-14 22:31:35] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 0 ms to minimize.
[2021-05-14 22:31:35] [INFO ] Deduced a trap composed of 52 places in 168 ms of which 0 ms to minimize.
[2021-05-14 22:31:35] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 0 ms to minimize.
[2021-05-14 22:31:35] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 1 ms to minimize.
[2021-05-14 22:31:36] [INFO ] Deduced a trap composed of 57 places in 163 ms of which 1 ms to minimize.
[2021-05-14 22:31:36] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 1 ms to minimize.
[2021-05-14 22:31:36] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 0 ms to minimize.
[2021-05-14 22:31:36] [INFO ] Deduced a trap composed of 57 places in 159 ms of which 0 ms to minimize.
[2021-05-14 22:31:36] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 1 ms to minimize.
[2021-05-14 22:31:37] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 0 ms to minimize.
[2021-05-14 22:31:37] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 0 ms to minimize.
[2021-05-14 22:31:37] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 1 ms to minimize.
[2021-05-14 22:31:37] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 0 ms to minimize.
[2021-05-14 22:31:37] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 1 ms to minimize.
[2021-05-14 22:31:37] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 0 ms to minimize.
[2021-05-14 22:31:37] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 0 ms to minimize.
[2021-05-14 22:31:38] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 0 ms to minimize.
[2021-05-14 22:31:38] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 1 ms to minimize.
[2021-05-14 22:31:38] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 0 ms to minimize.
[2021-05-14 22:31:38] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 0 ms to minimize.
[2021-05-14 22:31:38] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 1 ms to minimize.
[2021-05-14 22:31:38] [INFO ] Trap strengthening (SAT) tested/added 78/77 trap constraints in 17163 ms
[2021-05-14 22:31:38] [INFO ] Computed and/alt/rep : 1243/4779/1243 causal constraints (skipped 112 transitions) in 104 ms.
[2021-05-14 22:31:48] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 1 ms to minimize.
[2021-05-14 22:31:48] [INFO ] Deduced a trap composed of 57 places in 199 ms of which 1 ms to minimize.
[2021-05-14 22:31:48] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 0 ms to minimize.
[2021-05-14 22:31:49] [INFO ] Deduced a trap composed of 42 places in 194 ms of which 1 ms to minimize.
[2021-05-14 22:31:49] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 1 ms to minimize.
[2021-05-14 22:31:49] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 1 ms to minimize.
[2021-05-14 22:31:50] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 1 ms to minimize.
[2021-05-14 22:31:50] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 1 ms to minimize.
[2021-05-14 22:31:50] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 0 ms to minimize.
[2021-05-14 22:31:50] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 1 ms to minimize.
[2021-05-14 22:31:51] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 1 ms to minimize.
[2021-05-14 22:31:55] [INFO ] Deduced a trap composed of 24 places in 4715 ms of which 0 ms to minimize.
[2021-05-14 22:31:56] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 1 ms to minimize.
[2021-05-14 22:31:56] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 8064 ms
[2021-05-14 22:31:56] [INFO ] Added : 672 causal constraints over 136 iterations in 17587 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
Finished Parikh walk after 6622 steps, including 158 resets, run visited all 1 properties in 37 ms. (steps per millisecond=178 )
FORMULA Peterson-PT-7-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621031518245

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Peterson-PT-7"
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-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-7, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089128200646"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-7.tgz
mv Peterson-PT-7 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;