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.r102-smll-162075331200198.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPPP-PT-C0001N0000010000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331200198
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 133K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 22 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621203727803

Running Version 0
[2021-05-16 22:22:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 22:22:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 22:22:11] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-16 22:22:11] [INFO ] Transformed 33 places.
[2021-05-16 22:22:11] [INFO ] Transformed 22 transitions.
[2021-05-16 22:22:11] [INFO ] Parsed PT model containing 33 places and 22 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :5
FORMULA GPPP-PT-C0001N0000010000-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0001N0000010000-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 22:22:11] [INFO ] Computed 13 place invariants in 20 ms
[2021-05-16 22:22:11] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2021-05-16 22:22:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned unsat
[2021-05-16 22:22:11] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-16 22:22:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-16 22:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 22:22:11] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-16 22:22:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 22:22:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 22:22:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-16 22:22:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 22:22:12] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2021-05-16 22:22:12] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-16 22:22:12] [INFO ] Added : 21 causal constraints over 5 iterations in 77 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned unsat
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-16 22:22:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 22:22:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned unsat
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-16 22:22:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 22:22:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 22:22:12] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-16 22:22:12] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-16 22:22:12] [INFO ] Added : 19 causal constraints over 4 iterations in 55 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-16 22:22:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 22:22:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 48 ms returned unsat
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-16 22:22:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 22:22:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 20 ms returned unsat
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-16 22:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 22:22:13] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-16 22:22:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 22:22:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 22:22:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 89 ms returned sat
[2021-05-16 22:22:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 22:22:13] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-16 22:22:13] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-16 22:22:13] [INFO ] Added : 19 causal constraints over 4 iterations in 44 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
FORMULA GPPP-PT-C0001N0000010000-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000010000-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000010000-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000010000-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000010000-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000010000-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000010000-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000010000-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 16837700 steps, including 102 resets, run finished after 23552 ms. (steps per millisecond=714 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA GPPP-PT-C0001N0000010000-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 22331900 steps, including 102 resets, run finished after 27535 ms. (steps per millisecond=811 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 22332500 steps, including 102 resets, run finished after 27741 ms. (steps per millisecond=805 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 15
Applied a total of 12 rules in 35 ms. Remains 26 /33 variables (removed 7) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 26 cols
[2021-05-16 22:23:32] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 22:23:32] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/33 places, 15/22 transitions.
[2021-05-16 22:23:32] [INFO ] Flatten gal took : 37 ms
[2021-05-16 22:23:32] [INFO ] Flatten gal took : 8 ms
[2021-05-16 22:23:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16061662643170365870.gal : 7 ms
[2021-05-16 22:23:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4798708714023903164.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/ReachabilityCardinality16061662643170365870.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4798708714023903164.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/ReachabilityCardinality16061662643170365870.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4798708714023903164.prop --nowitness --gen-order FOLLOW
ITS-tools command line returned an error code 1
Loading property file /tmp/ReachabilityCardinality4798708714023903164.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
[2021-05-16 22:23:32] [INFO ] Flatten gal took : 7 ms
[2021-05-16 22:23:32] [INFO ] Applying decomposition
[2021-05-16 22:23:32] [INFO ] Flatten gal took : 6 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/graph15969727533880800341.txt, -o, /tmp/graph15969727533880800341.bin, -w, /tmp/graph15969727533880800341.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/graph15969727533880800341.bin, -l, -1, -v, -w, /tmp/graph15969727533880800341.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 22:23:32] [INFO ] Decomposing Gal with order
[2021-05-16 22:23:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 22:23:32] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-16 22:23:32] [INFO ] Flatten gal took : 53 ms
[2021-05-16 22:23:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-16 22:23:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17682864023121643240.gal : 3 ms
[2021-05-16 22:23:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7697363456939368489.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/ReachabilityCardinality17682864023121643240.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7697363456939368489.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/ReachabilityCardinality17682864023121643240.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7697363456939368489.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7697363456939368489.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
Built C files in :
/tmp/ltsmin2469156864775237299
[2021-05-16 22:23:32] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2469156864775237299
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/ltsmin2469156864775237299]
Compilation finished in 501 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2469156864775237299]
Link finished in 49 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, -i, GPPPPTC0001N0000010000ReachabilityCardinality11==true], workingDir=/tmp/ltsmin2469156864775237299]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 744 ms. (steps per millisecond=1344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 633 ms. (steps per millisecond=1579 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 809 ms. (steps per millisecond=1236 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 33060439 steps, run timeout after 30001 ms. (steps per millisecond=1101 ) properties seen :{}
Probabilistic random walk after 33060439 steps, saw 7010694 distinct states, run finished after 30010 ms. (steps per millisecond=1101 ) properties seen :{}
Running SMT prover for 2 properties.
// Phase 1: matrix 15 rows 26 cols
[2021-05-16 22:24:19] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 22:24:19] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-16 22:24:19] [INFO ] [Real]Absence check using 5 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-16 22:24:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 22:24:19] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-16 22:24:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 22:24:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2021-05-16 22:24:19] [INFO ] [Nat]Absence check using 5 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-16 22:24:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 22:24:20] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2021-05-16 22:24:20] [INFO ] Computed and/alt/rep : 14/27/14 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-16 22:24:20] [INFO ] Added : 14 causal constraints over 3 iterations in 23 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-16 22:24:20] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-16 22:24:20] [INFO ] [Real]Absence check using 5 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-16 22:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 22:24:20] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-16 22:24:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 22:24:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-16 22:24:20] [INFO ] [Nat]Absence check using 5 positive and 7 generalized place invariants in 76 ms returned sat
[2021-05-16 22:24:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 22:24:20] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-16 22:24:20] [INFO ] Computed and/alt/rep : 14/27/14 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-16 22:24:20] [INFO ] Added : 14 causal constraints over 3 iterations in 26 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
Incomplete Parikh walk after 15356100 steps, including 99 resets, run finished after 17315 ms. (steps per millisecond=886 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA GPPP-PT-C0001N0000010000-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 11700 steps, including 127 resets, run finished after 15 ms. (steps per millisecond=780 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 15/15 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 14
Applied a total of 3 rules in 7 ms. Remains 24 /26 variables (removed 2) and now considering 14/15 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/26 places, 14/15 transitions.
[2021-05-16 22:24:37] [INFO ] Flatten gal took : 4 ms
[2021-05-16 22:24:37] [INFO ] Flatten gal took : 10 ms
[2021-05-16 22:24:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3890638965683465921.gal : 6 ms
[2021-05-16 22:24:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17560157432940370352.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/ReachabilityCardinality3890638965683465921.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17560157432940370352.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
ITS-tools command line returned an error code 1

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/ReachabilityCardinality3890638965683465921.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17560157432940370352.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17560157432940370352.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
[2021-05-16 22:24:37] [INFO ] Flatten gal took : 15 ms
[2021-05-16 22:24:37] [INFO ] Applying decomposition
[2021-05-16 22:24:37] [INFO ] Flatten gal took : 2 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/graph14725697586624307488.txt, -o, /tmp/graph14725697586624307488.bin, -w, /tmp/graph14725697586624307488.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/graph14725697586624307488.bin, -l, -1, -v, -w, /tmp/graph14725697586624307488.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 22:24:37] [INFO ] Decomposing Gal with order
[2021-05-16 22:24:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 22:24:37] [INFO ] Flatten gal took : 5 ms
[2021-05-16 22:24:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 22:24:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1470255983153269703.gal : 2 ms
[2021-05-16 22:24:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1433002946030029354.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/ReachabilityCardinality1470255983153269703.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1433002946030029354.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/ReachabilityCardinality1470255983153269703.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1433002946030029354.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1433002946030029354.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
Built C files in :
/tmp/ltsmin17345377835763168759
[2021-05-16 22:24:37] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17345377835763168759
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/ltsmin17345377835763168759]
Compilation finished in 254 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17345377835763168759]
Link finished in 50 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, -i, GPPPPTC0001N0000010000ReachabilityCardinality15==true], workingDir=/tmp/ltsmin17345377835763168759]
LTSmin run took 324 ms.
Invariant validated
FORMULA GPPP-PT-C0001N0000010000-ReachabilityCardinality-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
All properties solved without resorting to model-checking.

BK_STOP 1621203879325

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0001N0000010000"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0001N0000010000, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r102-smll-162075331200198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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