fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r147-tall-162089137900192
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for NoC3x3-PT-6A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
647.092 77646.00 98809.00 387.70 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/mcc2021-input.r147-tall-162089137900192.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NoC3x3-PT-6A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-tall-162089137900192
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 155K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 06:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 06:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 07:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 297K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1620947641249

Running Version 0
[2021-05-13 23:14:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -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]
[2021-05-13 23:14:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:14:02] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2021-05-13 23:14:02] [INFO ] Transformed 512 places.
[2021-05-13 23:14:02] [INFO ] Transformed 1117 transitions.
[2021-05-13 23:14:02] [INFO ] Found NUPN structural information;
[2021-05-13 23:14:02] [INFO ] Parsed PT model containing 512 places and 1117 transitions in 136 ms.
Starting structural reductions, iteration 0 : 512/512 places, 1117/1117 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 455 transition count 918
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 455 transition count 918
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 120 place count 452 transition count 943
Applied a total of 120 rules in 103 ms. Remains 452 /512 variables (removed 60) and now considering 943/1117 (removed 174) transitions.
[2021-05-13 23:14:03] [INFO ] Flow matrix only has 901 transitions (discarded 42 similar events)
// Phase 1: matrix 901 rows 452 cols
[2021-05-13 23:14:03] [INFO ] Computed 66 place invariants in 25 ms
[2021-05-13 23:14:03] [INFO ] Implicit Places using invariants in 392 ms returned [13, 50, 100, 140, 204, 292, 345, 384, 434]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 419 ms to find 9 implicit places.
[2021-05-13 23:14:03] [INFO ] Flow matrix only has 901 transitions (discarded 42 similar events)
// Phase 1: matrix 901 rows 443 cols
[2021-05-13 23:14:03] [INFO ] Computed 57 place invariants in 5 ms
[2021-05-13 23:14:03] [INFO ] Dead Transitions using invariants and state equation in 355 ms returned []
Starting structural reductions, iteration 1 : 443/512 places, 943/1117 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 419 transition count 919
Applied a total of 48 rules in 29 ms. Remains 419 /443 variables (removed 24) and now considering 919/943 (removed 24) transitions.
[2021-05-13 23:14:03] [INFO ] Flow matrix only has 877 transitions (discarded 42 similar events)
// Phase 1: matrix 877 rows 419 cols
[2021-05-13 23:14:03] [INFO ] Computed 57 place invariants in 6 ms
[2021-05-13 23:14:03] [INFO ] Implicit Places using invariants in 188 ms returned []
[2021-05-13 23:14:03] [INFO ] Flow matrix only has 877 transitions (discarded 42 similar events)
// Phase 1: matrix 877 rows 419 cols
[2021-05-13 23:14:03] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-13 23:14:04] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-13 23:14:04] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 419/512 places, 919/1117 transitions.
Discarding 249 transitions out of 919. Remains 670
[2021-05-13 23:14:04] [INFO ] Initial state test concluded for 1 properties.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 669) seen :616
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Running SMT prover for 53 properties.
[2021-05-13 23:14:05] [INFO ] Flow matrix only has 877 transitions (discarded 42 similar events)
// Phase 1: matrix 877 rows 419 cols
[2021-05-13 23:14:05] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-13 23:14:05] [INFO ] [Real]Absence check using 57 positive place invariants in 9 ms returned sat
[2021-05-13 23:14:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:14:07] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:53
[2021-05-13 23:14:07] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2021-05-13 23:14:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:14:09] [INFO ] [Nat]Absence check using state equation in 1255 ms returned unsat :0 sat :53
[2021-05-13 23:14:09] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-13 23:14:09] [INFO ] [Nat]Added 65 Read/Feed constraints in 5 ms returned sat
Attempting to minimize the solution found.
Minimization took 1636 ms.
[2021-05-13 23:14:12] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :53
Fused 53 Parikh solutions to 51 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.
Support contains 80 out of 419 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 419/419 places, 919/919 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 409 transition count 862
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 409 transition count 862
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 45 place count 409 transition count 837
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 70 place count 384 transition count 837
Applied a total of 70 rules in 79 ms. Remains 384 /419 variables (removed 35) and now considering 837/919 (removed 82) transitions.
Finished structural reductions, in 1 iterations. Remains : 384/419 places, 837/919 transitions.
[2021-05-13 23:14:13] [INFO ] Flatten gal took : 117 ms
[2021-05-13 23:14:13] [INFO ] Flatten gal took : 70 ms
[2021-05-13 23:14:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4314094035821113249.gal : 40 ms
[2021-05-13 23:14:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13056142622994306403.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/ReachabilityCardinality4314094035821113249.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13056142622994306403.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/ReachabilityCardinality4314094035821113249.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13056142622994306403.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13056142622994306403.prop.
SDD proceeding with computation,53 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,53 properties remain. new max is 8
SDD size :14 after 18
SDD proceeding with computation,53 properties remain. new max is 16
SDD size :18 after 33
SDD proceeding with computation,53 properties remain. new max is 32
SDD size :33 after 68
SDD proceeding with computation,53 properties remain. new max is 64
SDD size :68 after 511
SDD proceeding with computation,53 properties remain. new max is 128
SDD size :511 after 1591
SDD proceeding with computation,53 properties remain. new max is 256
SDD size :1591 after 18039
Reachability property qltransition_419 is true.
SDD proceeding with computation,52 properties remain. new max is 256
SDD size :18039 after 38625
SDD proceeding with computation,52 properties remain. new max is 512
SDD size :38625 after 123839
Reachability property qltransition_345 is true.
SDD proceeding with computation,51 properties remain. new max is 512
SDD size :123839 after 1.66743e+06
SDD proceeding with computation,51 properties remain. new max is 1024
SDD size :1.66743e+06 after 5.08972e+06
Reachability property qltransition_349 is true.
Reachability property qltransition_346 is true.
SDD proceeding with computation,49 properties remain. new max is 1024
SDD size :5.08972e+06 after 1.26538e+07
SDD proceeding with computation,49 properties remain. new max is 2048
SDD size :1.26538e+07 after 7.85864e+07
SDD proceeding with computation,49 properties remain. new max is 4096
SDD size :7.85864e+07 after 4.03031e+08
SDD proceeding with computation,49 properties remain. new max is 8192
SDD size :4.03031e+08 after 7.76251e+08
Reachability property qltransition_426 is true.
SDD proceeding with computation,48 properties remain. new max is 8192
SDD size :7.76251e+08 after 4.93333e+10
Reachability property qltransition_436 is true.
SDD proceeding with computation,47 properties remain. new max is 8192
SDD size :4.93333e+10 after 4.08207e+11
Reachability property qltransition_444 is true.
SDD proceeding with computation,46 properties remain. new max is 8192
SDD size :4.08207e+11 after 2.91256e+12
Detected timeout of ITS tools.
[2021-05-13 23:14:28] [INFO ] Flatten gal took : 54 ms
[2021-05-13 23:14:28] [INFO ] Applying decomposition
[2021-05-13 23:14:28] [INFO ] Flatten gal took : 50 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/graph7937396265320949509.txt, -o, /tmp/graph7937396265320949509.bin, -w, /tmp/graph7937396265320949509.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/graph7937396265320949509.bin, -l, -1, -v, -w, /tmp/graph7937396265320949509.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:14:28] [INFO ] Decomposing Gal with order
[2021-05-13 23:14:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:14:28] [INFO ] Removed a total of 930 redundant transitions.
[2021-05-13 23:14:28] [INFO ] Flatten gal took : 134 ms
[2021-05-13 23:14:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 583 labels/synchronizations in 28 ms.
[2021-05-13 23:14:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2049724428782515228.gal : 9 ms
[2021-05-13 23:14:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11443718266951143371.prop : 9 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/ReachabilityCardinality2049724428782515228.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11443718266951143371.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/ReachabilityCardinality2049724428782515228.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11443718266951143371.prop --nowitness
Loading property file /tmp/ReachabilityCardinality11443718266951143371.prop.
SDD proceeding with computation,46 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,46 properties remain. new max is 8
SDD size :121 after 181
SDD proceeding with computation,46 properties remain. new max is 16
SDD size :181 after 481
SDD proceeding with computation,46 properties remain. new max is 32
SDD size :481 after 1561
SDD proceeding with computation,46 properties remain. new max is 64
SDD size :1561 after 129601
SDD proceeding with computation,46 properties remain. new max is 128
SDD size :129601 after 1.23552e+06
SDD proceeding with computation,46 properties remain. new max is 256
SDD size :1.23552e+06 after 3.3696e+06
SDD proceeding with computation,46 properties remain. new max is 512
SDD size :3.3696e+06 after 1.2096e+07
SDD proceeding with computation,46 properties remain. new max is 1024
SDD size :1.2096e+07 after 4.16465e+09
SDD proceeding with computation,46 properties remain. new max is 2048
SDD size :4.16465e+09 after 3.02426e+10
SDD proceeding with computation,46 properties remain. new max is 4096
SDD size :3.02426e+10 after 7.78881e+10
Reachability property qltransition_483 is true.
Reachability property qltransition_385 is true.
Reachability property qltransition_194 is true.
Reachability property qltransition_174 is true.
SDD proceeding with computation,42 properties remain. new max is 4096
SDD size :7.78881e+10 after 6.17571e+14
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10014489362983362982
[2021-05-13 23:14:43] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10014489362983362982
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/ltsmin10014489362983362982]
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/ltsmin10014489362983362982] 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/ltsmin10014489362983362982] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 4062 ms. (steps per millisecond=246 ) properties (out of 42) seen :9
Incomplete Best-First random walk after 100000 steps, including 3 resets, run finished after 145 ms. (steps per millisecond=689 ) properties (out of 33) seen :3
Incomplete Best-First random walk after 100000 steps, including 5 resets, run finished after 140 ms. (steps per millisecond=714 ) properties (out of 30) seen :6
Incomplete Best-First random walk after 100000 steps, including 4 resets, run finished after 130 ms. (steps per millisecond=769 ) properties (out of 24) seen :5
Incomplete Best-First random walk after 100001 steps, including 3 resets, run finished after 167 ms. (steps per millisecond=598 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=628 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=581 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=719 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 100001 steps, including 3 resets, run finished after 133 ms. (steps per millisecond=751 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=746 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 100000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=806 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 100001 steps, including 5 resets, run finished after 124 ms. (steps per millisecond=806 ) properties (out of 13) seen :4
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=854 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 100001 steps, including 3 resets, run finished after 127 ms. (steps per millisecond=787 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 100000 steps, including 3 resets, run finished after 124 ms. (steps per millisecond=806 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 8) seen :1
Running SMT prover for 7 properties.
[2021-05-13 23:14:51] [INFO ] Flow matrix only has 813 transitions (discarded 24 similar events)
// Phase 1: matrix 813 rows 384 cols
[2021-05-13 23:14:51] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-13 23:14:51] [INFO ] [Real]Absence check using 57 positive place invariants in 16 ms returned sat
[2021-05-13 23:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:14:51] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-13 23:14:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:14:51] [INFO ] [Nat]Absence check using 57 positive place invariants in 10 ms returned sat
[2021-05-13 23:14:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:14:51] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2021-05-13 23:14:51] [INFO ] State equation strengthened by 55 read => feed constraints.
[2021-05-13 23:14:51] [INFO ] [Nat]Added 55 Read/Feed constraints in 109 ms returned sat
[2021-05-13 23:14:51] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2021-05-13 23:14:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2021-05-13 23:14:51] [INFO ] Computed and/alt/rep : 359/1858/359 causal constraints (skipped 446 transitions) in 62 ms.
[2021-05-13 23:14:54] [INFO ] Added : 276 causal constraints over 56 iterations in 2866 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-13 23:14:54] [INFO ] [Real]Absence check using 57 positive place invariants in 9 ms returned sat
[2021-05-13 23:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:14:54] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2021-05-13 23:14:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:14:54] [INFO ] [Nat]Absence check using 57 positive place invariants in 10 ms returned sat
[2021-05-13 23:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:14:55] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2021-05-13 23:14:55] [INFO ] [Nat]Added 55 Read/Feed constraints in 125 ms returned sat
[2021-05-13 23:14:55] [INFO ] Computed and/alt/rep : 359/1858/359 causal constraints (skipped 446 transitions) in 56 ms.
[2021-05-13 23:14:58] [INFO ] Added : 283 causal constraints over 57 iterations in 3008 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-13 23:14:58] [INFO ] [Real]Absence check using 57 positive place invariants in 9 ms returned sat
[2021-05-13 23:14:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:14:58] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-13 23:14:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:14:58] [INFO ] [Nat]Absence check using 57 positive place invariants in 10 ms returned sat
[2021-05-13 23:14:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:14:58] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2021-05-13 23:14:58] [INFO ] [Nat]Added 55 Read/Feed constraints in 112 ms returned sat
[2021-05-13 23:14:58] [INFO ] Computed and/alt/rep : 359/1858/359 causal constraints (skipped 446 transitions) in 46 ms.
[2021-05-13 23:15:02] [INFO ] Added : 310 causal constraints over 64 iterations in 3290 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-13 23:15:02] [INFO ] [Real]Absence check using 57 positive place invariants in 10 ms returned sat
[2021-05-13 23:15:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:15:02] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-13 23:15:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:15:02] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned sat
[2021-05-13 23:15:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:15:02] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2021-05-13 23:15:02] [INFO ] [Nat]Added 55 Read/Feed constraints in 95 ms returned sat
[2021-05-13 23:15:02] [INFO ] Computed and/alt/rep : 359/1858/359 causal constraints (skipped 446 transitions) in 45 ms.
[2021-05-13 23:15:05] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2021-05-13 23:15:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2021-05-13 23:15:05] [INFO ] Added : 264 causal constraints over 53 iterations in 2730 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-13 23:15:05] [INFO ] [Real]Absence check using 57 positive place invariants in 10 ms returned sat
[2021-05-13 23:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:15:05] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-13 23:15:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:15:05] [INFO ] [Nat]Absence check using 57 positive place invariants in 10 ms returned sat
[2021-05-13 23:15:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:15:06] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-13 23:15:06] [INFO ] [Nat]Added 55 Read/Feed constraints in 121 ms returned sat
[2021-05-13 23:15:06] [INFO ] Computed and/alt/rep : 359/1858/359 causal constraints (skipped 446 transitions) in 42 ms.
[2021-05-13 23:15:09] [INFO ] Added : 284 causal constraints over 57 iterations in 2948 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-13 23:15:09] [INFO ] [Real]Absence check using 57 positive place invariants in 9 ms returned sat
[2021-05-13 23:15:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:15:09] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-13 23:15:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:15:09] [INFO ] [Nat]Absence check using 57 positive place invariants in 10 ms returned sat
[2021-05-13 23:15:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:15:09] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2021-05-13 23:15:09] [INFO ] [Nat]Added 55 Read/Feed constraints in 84 ms returned sat
[2021-05-13 23:15:09] [INFO ] Computed and/alt/rep : 359/1858/359 causal constraints (skipped 446 transitions) in 42 ms.
[2021-05-13 23:15:12] [INFO ] Added : 280 causal constraints over 57 iterations in 2912 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-13 23:15:12] [INFO ] [Real]Absence check using 57 positive place invariants in 10 ms returned sat
[2021-05-13 23:15:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:15:12] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-13 23:15:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:15:12] [INFO ] [Nat]Absence check using 57 positive place invariants in 10 ms returned sat
[2021-05-13 23:15:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:15:13] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2021-05-13 23:15:13] [INFO ] [Nat]Added 55 Read/Feed constraints in 125 ms returned sat
[2021-05-13 23:15:13] [INFO ] Computed and/alt/rep : 359/1858/359 causal constraints (skipped 446 transitions) in 41 ms.
[2021-05-13 23:15:15] [INFO ] Added : 285 causal constraints over 58 iterations in 2716 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
Incomplete Parikh walk after 153300 steps, including 1000 resets, run finished after 694 ms. (steps per millisecond=220 ) properties (out of 7) seen :4 could not realise parikh vector
Incomplete Parikh walk after 167100 steps, including 999 resets, run finished after 721 ms. (steps per millisecond=231 ) properties (out of 3) seen :2 could not realise parikh vector
Finished Parikh walk after 88829 steps, including 833 resets, run visited all 1 properties in 447 ms. (steps per millisecond=198 )
Able to resolve query QuasiLiveness after proving 670 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE USE_NUPN

BK_STOP 1620947718895

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -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 QuasiLiveness -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="NoC3x3-PT-6A"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
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 itstools"
echo " Input is NoC3x3-PT-6A, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r147-tall-162089137900192"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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