fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r324-tall-165472293700403
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for RERS2020-PT-pb103

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13565.655 1542110.00 4965269.00 2933.20 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r324-tall-165472293700403.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is RERS2020-PT-pb103, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r324-tall-165472293700403
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 6.8K Jun 7 17:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 7 17:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 17:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 12K Jun 7 17:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 7 17:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 7 17:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Jun 7 17:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 18M Jun 6 12:11 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1654754251867

Running Version 0
[2022-06-09 05:57:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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, 1800]
[2022-06-09 05:57:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 05:57:34] [INFO ] Load time of PNML (sax parser for PT used): 768 ms
[2022-06-09 05:57:34] [INFO ] Transformed 520 places.
[2022-06-09 05:57:34] [INFO ] Transformed 31658 transitions.
[2022-06-09 05:57:34] [INFO ] Found NUPN structural information;
[2022-06-09 05:57:34] [INFO ] Parsed PT model containing 520 places and 31658 transitions in 942 ms.
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 520) seen :203
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 317) seen :5
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 312) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 311) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 311) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 311) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 311) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 311) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 310) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 310) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 310) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 310) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 310) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 308) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 308) seen :0
Running SMT prover for 308 properties.
[2022-06-09 05:57:35] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 520 cols
[2022-06-09 05:57:35] [INFO ] Computed 15 place invariants in 123 ms
[2022-06-09 05:57:39] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:308
[2022-06-09 05:57:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-06-09 05:57:42] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2022-06-09 05:57:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 05:58:04] [INFO ] [Nat]Absence check using state equation in 20000 ms returned unsat :0 sat :308
[2022-06-09 05:58:05] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2022-06-09 05:58:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
Fused 308 Parikh solutions to 48 different solutions.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 308 out of 520 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1069 rules applied. Total rules applied 1069 place count 513 transition count 27367
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 1076 place count 513 transition count 27360
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 1170 place count 506 transition count 27273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1171 place count 505 transition count 27272
Applied a total of 1171 rules in 833 ms. Remains 505 /520 variables (removed 15) and now considering 27272/28429 (removed 1157) transitions.
Finished structural reductions, in 1 iterations. Remains : 505/520 places, 27272/28429 transitions.
[2022-06-09 05:58:07] [INFO ] Flatten gal took : 1179 ms
[2022-06-09 05:58:08] [INFO ] Flatten gal took : 916 ms
[2022-06-09 05:58:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17421633282666809220.gal : 171 ms
[2022-06-09 05:58:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2115155813972680786.prop : 2 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/ReachabilityCardinality17421633282666809220.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2115155813972680786.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/ReachabilityCardinality17421633282666809220.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2115155813972680786.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2115155813972680786.prop.
Detected timeout of ITS tools.
[2022-06-09 05:58:24] [INFO ] Flatten gal took : 867 ms
[2022-06-09 05:58:24] [INFO ] Applying decomposition
[2022-06-09 05:58:25] [INFO ] Flatten gal took : 892 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/graph3184940034583251401.txt, -o, /tmp/graph3184940034583251401.bin, -w, /tmp/graph3184940034583251401.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/graph3184940034583251401.bin, -l, -1, -v, -w, /tmp/graph3184940034583251401.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 05:58:27] [INFO ] Decomposing Gal with order
[2022-06-09 05:58:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 05:58:30] [INFO ] Removed a total of 62438 redundant transitions.
[2022-06-09 05:58:30] [INFO ] Flatten gal took : 2109 ms
[2022-06-09 05:58:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 2274 labels/synchronizations in 701 ms.
[2022-06-09 05:58:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12209147840786501440.gal : 50 ms
[2022-06-09 05:58:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2066988754396111923.prop : 2 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/ReachabilityCardinality12209147840786501440.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2066988754396111923.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/ReachabilityCardinality12209147840786501440.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2066988754396111923.prop --nowitness
Loading property file /tmp/ReachabilityCardinality2066988754396111923.prop.
SDD proceeding with computation,308 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,308 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,308 properties remain. new max is 16
SDD size :1 after 43
SDD proceeding with computation,308 properties remain. new max is 32
SDD size :43 after 166
SDD proceeding with computation,308 properties remain. new max is 64
SDD size :166 after 310
Invariant property smplace_482 does not hold.
Invariant property smplace_435 does not hold.
Invariant property smplace_222 does not hold.
Invariant property smplace_142 does not hold.
Invariant property smplace_122 does not hold.
Invariant property smplace_62 does not hold.
SDD proceeding with computation,302 properties remain. new max is 64
SDD size :310 after 1768
Invariant property smplace_499 does not hold.
Invariant property smplace_456 does not hold.
Invariant property smplace_391 does not hold.
Invariant property smplace_384 does not hold.
Invariant property smplace_345 does not hold.
Invariant property smplace_343 does not hold.
Invariant property smplace_334 does not hold.
SDD proceeding with computation,295 properties remain. new max is 64
SDD size :1768 after 26110
Invariant property smplace_497 does not hold.
Invariant property smplace_453 does not hold.
Invariant property smplace_449 does not hold.
Invariant property smplace_446 does not hold.
Invariant property smplace_441 does not hold.
Invariant property smplace_440 does not hold.
Invariant property smplace_411 does not hold.
Invariant property smplace_373 does not hold.
Invariant property smplace_369 does not hold.
Invariant property smplace_353 does not hold.
Invariant property smplace_338 does not hold.
Invariant property smplace_337 does not hold.
Invariant property smplace_336 does not hold.
Invariant property smplace_306 does not hold.
Invariant property smplace_301 does not hold.
Invariant property smplace_294 does not hold.
Invariant property smplace_271 does not hold.
Invariant property smplace_241 does not hold.
Invariant property smplace_238 does not hold.
Invariant property smplace_213 does not hold.
Invariant property smplace_201 does not hold.
Invariant property smplace_191 does not hold.
Invariant property smplace_114 does not hold.
Invariant property smplace_89 does not hold.
Invariant property smplace_73 does not hold.
Invariant property smplace_67 does not hold.
Invariant property smplace_12 does not hold.
Invariant property smplace_5 does not hold.
Invariant property smplace_2 does not hold.
SDD proceeding with computation,266 properties remain. new max is 64
SDD size :26110 after 570817
SDD proceeding with computation,266 properties remain. new max is 128
SDD size :570817 after 817654
SDD proceeding with computation,266 properties remain. new max is 256
SDD size :817654 after 946342
SDD proceeding with computation,266 properties remain. new max is 512
SDD size :946342 after 946462
SDD proceeding with computation,266 properties remain. new max is 1024
SDD size :946462 after 946462
SDD proceeding with computation,266 properties remain. new max is 2048
SDD size :946462 after 946462
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3931789615738807210
[2022-06-09 05:58:47] [INFO ] Built C files in 422ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3931789615738807210
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/ltsmin3931789615738807210]
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/ltsmin3931789615738807210] 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/ltsmin3931789615738807210] 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)
Interrupted random walk after 941805 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=31 ) properties seen :{25=1, 43=1, 59=1, 74=1, 90=1, 104=1, 119=1, 121=1, 142=1, 158=1, 160=1, 161=1, 213=1, 214=1, 218=1, 234=1}
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 250) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 239) seen :8
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 231) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 228) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 227) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 227) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 227) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 226) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 225) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 224) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 224) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 224) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 223) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 222) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 222) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 222) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 221) 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 221) seen :0
Running SMT prover for 221 properties.
[2022-06-09 05:59:20] [INFO ] Flow matrix only has 18596 transitions (discarded 8676 similar events)
// Phase 1: matrix 18596 rows 505 cols
[2022-06-09 05:59:21] [INFO ] Computed 8 place invariants in 101 ms
[2022-06-09 05:59:23] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:221
[2022-06-09 05:59:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-06-09 05:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:00:47] [INFO ] [Nat]Absence check using state equation in 80731 ms returned unsat :0 sat :221
[2022-06-09 06:00:47] [INFO ] State equation strengthened by 1372 read => feed constraints.
[2022-06-09 06:00:49] [INFO ] [Nat]Added 1372 Read/Feed constraints in 1810 ms returned sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-09 06:03:08] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :210
Fused 221 Parikh solutions to 217 different solutions.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 221 out of 505 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 505/505 places, 27272/27272 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 505 transition count 27270
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 503 transition count 27270
Applied a total of 4 rules in 506 ms. Remains 503 /505 variables (removed 2) and now considering 27270/27272 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/505 places, 27270/27272 transitions.
[2022-06-09 06:03:11] [INFO ] Flatten gal took : 926 ms
[2022-06-09 06:03:12] [INFO ] Flatten gal took : 933 ms
[2022-06-09 06:03:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3406271165795461107.gal : 96 ms
[2022-06-09 06:03:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10736412456601872295.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/ReachabilityCardinality3406271165795461107.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10736412456601872295.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/ReachabilityCardinality3406271165795461107.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10736412456601872295.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10736412456601872295.prop.
Detected timeout of ITS tools.
[2022-06-09 06:03:28] [INFO ] Flatten gal took : 791 ms
[2022-06-09 06:03:28] [INFO ] Applying decomposition
[2022-06-09 06:03:29] [INFO ] Flatten gal took : 811 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/graph15343216807236215313.txt, -o, /tmp/graph15343216807236215313.bin, -w, /tmp/graph15343216807236215313.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/graph15343216807236215313.bin, -l, -1, -v, -w, /tmp/graph15343216807236215313.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 06:03:30] [INFO ] Decomposing Gal with order
[2022-06-09 06:03:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 06:03:32] [INFO ] Removed a total of 62557 redundant transitions.
[2022-06-09 06:03:33] [INFO ] Flatten gal took : 1672 ms
[2022-06-09 06:03:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2049 labels/synchronizations in 684 ms.
[2022-06-09 06:03:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2069132921175677907.gal : 47 ms
[2022-06-09 06:03:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13541862702267902480.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/ReachabilityCardinality2069132921175677907.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13541862702267902480.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/ReachabilityCardinality2069132921175677907.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13541862702267902480.prop --nowitness
Loading property file /tmp/ReachabilityCardinality13541862702267902480.prop.
SDD proceeding with computation,221 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 512
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 1024
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 2048
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 4096
SDD size :76 after 97
SDD proceeding with computation,221 properties remain. new max is 8192
SDD size :97 after 5233
SDD proceeding with computation,221 properties remain. new max is 16384
SDD size :5233 after 9349
SDD proceeding with computation,221 properties remain. new max is 32768
SDD size :9349 after 31840
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12343011087088496796
[2022-06-09 06:03:49] [INFO ] Built C files in 221ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12343011087088496796
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/ltsmin12343011087088496796]
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/ltsmin12343011087088496796] 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/ltsmin12343011087088496796] 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)
Interrupted random walk after 901696 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen :{}
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 221) seen :0
Interrupted probabilistic random walk after 416302 steps, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 416302 steps, saw 242293 distinct states, run finished after 30002 ms. (steps per millisecond=13 ) properties seen :{}
Running SMT prover for 221 properties.
[2022-06-09 06:04:52] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2022-06-09 06:04:52] [INFO ] Computed 8 place invariants in 84 ms
[2022-06-09 06:04:54] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:221
[2022-06-09 06:04:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-06-09 06:04:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:06:16] [INFO ] [Nat]Absence check using state equation in 78069 ms returned unsat :0 sat :221
[2022-06-09 06:06:16] [INFO ] State equation strengthened by 1372 read => feed constraints.
[2022-06-09 06:06:18] [INFO ] [Nat]Added 1372 Read/Feed constraints in 1860 ms returned sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-09 06:08:40] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :209
Fused 221 Parikh solutions to 217 different solutions.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 221 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 131 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 27270/27270 transitions.
Starting structural reductions, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 117 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
[2022-06-09 06:08:41] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2022-06-09 06:08:41] [INFO ] Computed 8 place invariants in 54 ms
[2022-06-09 06:08:42] [INFO ] Implicit Places using invariants in 686 ms returned []
Implicit Place search using SMT only with invariants took 687 ms to find 0 implicit places.
[2022-06-09 06:08:42] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2022-06-09 06:08:42] [INFO ] Computed 8 place invariants in 54 ms
[2022-06-09 06:08:50] [INFO ] Dead Transitions using invariants and state equation in 8242 ms returned []
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 27270/27270 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 3561 ms. (steps per millisecond=28 ) properties (out of 221) seen :0
Running SMT prover for 221 properties.
[2022-06-09 06:08:53] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2022-06-09 06:08:53] [INFO ] Computed 8 place invariants in 93 ms
[2022-06-09 06:08:56] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:221
[2022-06-09 06:08:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-06-09 06:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:10:20] [INFO ] [Nat]Absence check using state equation in 80909 ms returned unsat :0 sat :221
[2022-06-09 06:10:21] [INFO ] State equation strengthened by 1372 read => feed constraints.
[2022-06-09 06:10:23] [INFO ] [Nat]Added 1372 Read/Feed constraints in 1826 ms returned sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-09 06:10:36] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :219
[2022-06-09 06:10:37] [INFO ] Flatten gal took : 799 ms
[2022-06-09 06:10:38] [INFO ] Flatten gal took : 818 ms
[2022-06-09 06:10:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2188218995516616818.gal : 67 ms
[2022-06-09 06:10:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4597110306140392431.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/ReachabilityCardinality2188218995516616818.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4597110306140392431.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/ReachabilityCardinality2188218995516616818.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4597110306140392431.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4597110306140392431.prop.
Detected timeout of ITS tools.
[2022-06-09 06:10:54] [INFO ] Flatten gal took : 835 ms
[2022-06-09 06:10:54] [INFO ] Applying decomposition
[2022-06-09 06:10:55] [INFO ] Flatten gal took : 909 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/graph2949822225270175294.txt, -o, /tmp/graph2949822225270175294.bin, -w, /tmp/graph2949822225270175294.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/graph2949822225270175294.bin, -l, -1, -v, -w, /tmp/graph2949822225270175294.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 06:10:56] [INFO ] Decomposing Gal with order
[2022-06-09 06:10:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 06:10:58] [INFO ] Removed a total of 62528 redundant transitions.
[2022-06-09 06:10:58] [INFO ] Flatten gal took : 1617 ms
[2022-06-09 06:10:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2261 labels/synchronizations in 613 ms.
[2022-06-09 06:10:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13608392947297058865.gal : 38 ms
[2022-06-09 06:10:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6528649306621351014.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/ReachabilityCardinality13608392947297058865.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6528649306621351014.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/ReachabilityCardinality13608392947297058865.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6528649306621351014.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6528649306621351014.prop.
SDD proceeding with computation,221 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 16
SDD size :1 after 4
SDD proceeding with computation,221 properties remain. new max is 32
SDD size :4 after 4
SDD proceeding with computation,221 properties remain. new max is 64
SDD size :4 after 4
SDD proceeding with computation,221 properties remain. new max is 128
SDD size :4 after 4
SDD proceeding with computation,221 properties remain. new max is 256
SDD size :160 after 184
SDD proceeding with computation,221 properties remain. new max is 512
SDD size :184 after 220
SDD proceeding with computation,221 properties remain. new max is 1024
SDD size :220 after 220
SDD proceeding with computation,221 properties remain. new max is 2048
SDD size :2230 after 2422
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7253427198392555866
[2022-06-09 06:11:14] [INFO ] Built C files in 165ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7253427198392555866
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/ltsmin7253427198392555866]
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/ltsmin7253427198392555866] 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/ltsmin7253427198392555866] 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)
Graph (trivial) has 5708 edges and 503 vertex of which 241 / 503 are part of one of the 37 SCC in 17 ms
Free SCC test removed 204 places
Drop transitions removed 7029 transitions
Ensure Unique test removed 14207 transitions
Reduce isomorphic transitions removed 21236 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 298 transition count 6000
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 298 transition count 6000
Drop transitions removed 3001 transitions
Redundant transition composition rules discarded 3001 transitions
Iterating global reduction 0 with 3001 rules applied. Total rules applied 3004 place count 298 transition count 2999
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 3945 edges and 291 vertex of which 289 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 40 rules applied. Total rules applied 3044 place count 289 transition count 2967
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 3054 place count 289 transition count 2957
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 3056 place count 289 transition count 2955
Applied a total of 3056 rules in 591 ms. Remains 289 /503 variables (removed 214) and now considering 2955/27270 (removed 24315) transitions.
Running SMT prover for 221 properties.
// Phase 1: matrix 2955 rows 289 cols
[2022-06-09 06:11:16] [INFO ] Computed 4 place invariants in 11 ms
[2022-06-09 06:11:17] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:221
[2022-06-09 06:11:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-09 06:11:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 06:11:30] [INFO ] [Nat]Absence check using state equation in 10462 ms returned unsat :0 sat :221
Attempting to minimize the solution found.
Minimization took 12534 ms.
[2022-06-09 06:11:42] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :221
[2022-06-09 06:11:43] [INFO ] Flatten gal took : 772 ms
[2022-06-09 06:11:44] [INFO ] Flatten gal took : 804 ms
[2022-06-09 06:11:44] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12991386619973600832.gal : 66 ms
[2022-06-09 06:11:44] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12484966420963428099.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/ReachabilityFireability12991386619973600832.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability12484966420963428099.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/ReachabilityFireability12991386619973600832.gal -t CGAL -reachable-file /tmp/ReachabilityFireability12484966420963428099.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityFireability12484966420963428099.prop.
Detected timeout of ITS tools.
[2022-06-09 06:11:48] [INFO ] Flatten gal took : 780 ms
[2022-06-09 06:11:48] [INFO ] Applying decomposition
[2022-06-09 06:11:48] [INFO ] Flatten gal took : 809 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/graph11250600225222542703.txt, -o, /tmp/graph11250600225222542703.bin, -w, /tmp/graph11250600225222542703.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/graph11250600225222542703.bin, -l, -1, -v, -w, /tmp/graph11250600225222542703.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 06:11:51] [INFO ] Decomposing Gal with order
[2022-06-09 06:11:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 06:11:53] [INFO ] Removed a total of 62557 redundant transitions.
[2022-06-09 06:11:53] [INFO ] Flatten gal took : 1956 ms
[2022-06-09 06:11:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2153 labels/synchronizations in 621 ms.
[2022-06-09 06:11:54] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14638063280645809690.gal : 28 ms
[2022-06-09 06:11:54] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9703574954904217316.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/ReachabilityFireability14638063280645809690.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability9703574954904217316.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/ReachabilityFireability14638063280645809690.gal -t CGAL -reachable-file /tmp/ReachabilityFireability9703574954904217316.prop --nowitness
Loading property file /tmp/ReachabilityFireability9703574954904217316.prop.
SDD proceeding with computation,221 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 128
SDD size :1 after 4
SDD proceeding with computation,221 properties remain. new max is 256
SDD size :4 after 166
SDD proceeding with computation,221 properties remain. new max is 512
SDD size :166 after 166
SDD proceeding with computation,221 properties remain. new max is 1024
SDD size :166 after 166
SDD proceeding with computation,221 properties remain. new max is 2048
SDD size :166 after 166
SDD proceeding with computation,221 properties remain. new max is 4096
SDD size :166 after 418
SDD proceeding with computation,221 properties remain. new max is 8192
SDD size :418 after 652
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16378975090770599332
[2022-06-09 06:11:57] [INFO ] Built C files in 140ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16378975090770599332
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/ltsmin16378975090770599332]
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/ltsmin16378975090770599332] 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/ltsmin16378975090770599332] 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)
[2022-06-09 06:11:59] [INFO ] Flatten gal took : 1009 ms
[2022-06-09 06:12:01] [INFO ] Flatten gal took : 1246 ms
[2022-06-09 06:12:01] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17642019074562270489.gal : 59 ms
[2022-06-09 06:12:01] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17593647026150484539.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/ReachabilityFireability17642019074562270489.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability17593647026150484539.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/ReachabilityFireability17642019074562270489.gal -t CGAL -reachable-file /tmp/ReachabilityFireability17593647026150484539.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityFireability17593647026150484539.prop.
SDD proceeding with computation,221 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,221 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,221 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,221 properties remain. new max is 32
SDD size :19 after 25
SDD proceeding with computation,221 properties remain. new max is 64
SDD size :25 after 85
SDD proceeding with computation,221 properties remain. new max is 128
SDD size :85 after 94
Detected timeout of ITS tools.
[2022-06-09 06:12:32] [INFO ] Flatten gal took : 1212 ms
[2022-06-09 06:12:32] [INFO ] Applying decomposition
[2022-06-09 06:12:33] [INFO ] Flatten gal took : 1026 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/graph10774757609963217754.txt, -o, /tmp/graph10774757609963217754.bin, -w, /tmp/graph10774757609963217754.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/graph10774757609963217754.bin, -l, -1, -v, -w, /tmp/graph10774757609963217754.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 06:12:36] [INFO ] Decomposing Gal with order
[2022-06-09 06:12:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 06:12:38] [INFO ] Removed a total of 62251 redundant transitions.
[2022-06-09 06:12:38] [INFO ] Flatten gal took : 1764 ms
[2022-06-09 06:12:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 2319 labels/synchronizations in 991 ms.
[2022-06-09 06:12:40] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16685626813514296993.gal : 42 ms
[2022-06-09 06:12:40] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16978959068985064119.prop : 3 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/ReachabilityFireability16685626813514296993.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability16978959068985064119.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/ReachabilityFireability16685626813514296993.gal -t CGAL -reachable-file /tmp/ReachabilityFireability16978959068985064119.prop --nowitness
Loading property file /tmp/ReachabilityFireability16978959068985064119.prop.
SDD proceeding with computation,221 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,221 properties remain. new max is 8
SDD size :4 after 4
SDD proceeding with computation,221 properties remain. new max is 16
SDD size :4 after 4
SDD proceeding with computation,221 properties remain. new max is 32
SDD size :4 after 4
SDD proceeding with computation,221 properties remain. new max is 64
SDD size :4 after 4
SDD proceeding with computation,221 properties remain. new max is 128
SDD size :4 after 4
SDD proceeding with computation,221 properties remain. new max is 256
SDD size :4 after 4
SDD proceeding with computation,221 properties remain. new max is 512
SDD size :4 after 4
SDD proceeding with computation,221 properties remain. new max is 1024
SDD size :4 after 4
SDD proceeding with computation,221 properties remain. new max is 2048
SDD size :4 after 4
SDD proceeding with computation,221 properties remain. new max is 4096
SDD size :4 after 274
SDD proceeding with computation,221 properties remain. new max is 8192
SDD size :274 after 6109
SDD proceeding with computation,221 properties remain. new max is 16384
SDD size :6109 after 6271
SDD proceeding with computation,221 properties remain. new max is 32768
SDD size :6271 after 63871
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14876186042033515727
[2022-06-09 06:13:10] [INFO ] Built C files in 272ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14876186042033515727
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/ltsmin14876186042033515727]
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/ltsmin14876186042033515727] killed by timeout after 3 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/ltsmin14876186042033515727] killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
[2022-06-09 06:13:14] [INFO ] Flatten gal took : 1224 ms
[2022-06-09 06:13:16] [INFO ] Flatten gal took : 1324 ms
[2022-06-09 06:13:16] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4817448158272742703.gal : 129 ms
[2022-06-09 06:13:16] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15753277045547162223.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/ReachabilityFireability4817448158272742703.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability15753277045547162223.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/ReachabilityFireability4817448158272742703.gal -t CGAL -reachable-file /tmp/ReachabilityFireability15753277045547162223.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityFireability15753277045547162223.prop.
SDD proceeding with computation,221 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,221 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,221 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,221 properties remain. new max is 32
SDD size :19 after 25
SDD proceeding with computation,221 properties remain. new max is 64
SDD size :25 after 85
SDD proceeding with computation,221 properties remain. new max is 128
SDD size :85 after 94
SDD proceeding with computation,221 properties remain. new max is 256
SDD size :94 after 166
SDD proceeding with computation,221 properties remain. new max is 512
SDD size :310 after 2074
SDD proceeding with computation,221 properties remain. new max is 1024
SDD size :2074 after 4207
SDD proceeding with computation,221 properties remain. new max is 2048
SDD size :4207 after 13090
SDD proceeding with computation,221 properties remain. new max is 4096
SDD size :13090 after 39406
SDD proceeding with computation,221 properties remain. new max is 8192
SDD size :39406 after 3.1363e+06
SDD proceeding with computation,221 properties remain. new max is 16384
SDD size :3.1363e+06 after 5.56958e+06
SDD proceeding with computation,221 properties remain. new max is 32768
SDD size :5.56958e+06 after 4.13399e+07
Detected timeout of ITS tools.
[2022-06-09 06:18:18] [INFO ] Flatten gal took : 1462 ms
[2022-06-09 06:18:18] [INFO ] Applying decomposition
[2022-06-09 06:18:19] [INFO ] Flatten gal took : 1270 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/graph6290315021035816933.txt, -o, /tmp/graph6290315021035816933.bin, -w, /tmp/graph6290315021035816933.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/graph6290315021035816933.bin, -l, -1, -v, -w, /tmp/graph6290315021035816933.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 06:18:22] [INFO ] Decomposing Gal with order
[2022-06-09 06:18:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 06:18:25] [INFO ] Removed a total of 62557 redundant transitions.
[2022-06-09 06:18:25] [INFO ] Flatten gal took : 2246 ms
[2022-06-09 06:18:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 2312 labels/synchronizations in 891 ms.
[2022-06-09 06:18:27] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12636947473740038672.gal : 36 ms
[2022-06-09 06:18:27] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16101914538279839367.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/ReachabilityFireability12636947473740038672.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability16101914538279839367.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/ReachabilityFireability12636947473740038672.gal -t CGAL -reachable-file /tmp/ReachabilityFireability16101914538279839367.prop --nowitness
Loading property file /tmp/ReachabilityFireability16101914538279839367.prop.
SDD proceeding with computation,221 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,221 properties remain. new max is 256
SDD size :1 after 1801
SDD proceeding with computation,221 properties remain. new max is 512
SDD size :1801 after 2015
SDD proceeding with computation,221 properties remain. new max is 1024
SDD size :2015 after 19643
SDD proceeding with computation,221 properties remain. new max is 2048
SDD size :19643 after 19643
SDD proceeding with computation,221 properties remain. new max is 4096
SDD size :19643 after 19643
SDD proceeding with computation,221 properties remain. new max is 8192
SDD size :19643 after 19643
SDD proceeding with computation,221 properties remain. new max is 16384
SDD size :19643 after 102061
SDD proceeding with computation,221 properties remain. new max is 32768
SDD size :5.89996e+07 after 5.89996e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.46398e+07,188.052,2278284,1383,968,3.1927e+06,1.14537e+06,14882,8.62356e+06,1823,4.5899e+06,0
Total reachable state count : 64639839

Verifying 221 reachability properties.
Invariant property smplace_6 is true.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1654755793977

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -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 1800 -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="RERS2020-PT-pb103"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 gold2021"
echo " Input is RERS2020-PT-pb103, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r324-tall-165472293700403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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