Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 6.0K Apr 30 02:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 30 02:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 02:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 02:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 03:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 30 03:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 03:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 30 03:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 16M May 10 09:34 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 JoinFreeModules-PT-5000-ReachabilityCardinality-00
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-01
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-02
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-03
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-04
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-05
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-06
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-07
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-08
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-09
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-10
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-11
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-12
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-13
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-14
FORMULA_NAME JoinFreeModules-PT-5000-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655068804939

Running Version 0
[2022-06-12 21:20:06] [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]
[2022-06-12 21:20:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:20:07] [INFO ] Load time of PNML (sax parser for PT used): 703 ms
[2022-06-12 21:20:07] [INFO ] Transformed 25001 places.
[2022-06-12 21:20:07] [INFO ] Transformed 40001 transitions.
[2022-06-12 21:20:07] [INFO ] Parsed PT model containing 25001 places and 40001 transitions in 924 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 70 ms.
Working with output stream class java.io.PrintStream
[2022-06-12 21:20:07] [INFO ] Initial state test concluded for 11 properties.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10003 steps, including 1 resets, run finished after 2109 ms. (steps per millisecond=4 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2771 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2507 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2505 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2516 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2087 ms. (steps per millisecond=4 ) properties (out of 5) seen :0
Probabilistic random walk after 84023 steps, saw 83970 distinct states, run finished after 48554 ms. (steps per millisecond=1 ) properties seen :{}
Running SMT prover for 5 properties.
// Phase 1: matrix 40001 rows 25000 cols
[2022-06-12 21:21:11] [INFO ] Computed 5000 place invariants in 285 ms
[2022-06-12 21:21:21] [INFO ] [Real]Absence check using 5000 positive place invariants in 3212 ms returned sat
[2022-06-12 21:21:22] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:5
[2022-06-12 21:21:30] [INFO ] [Nat]Absence check using 5000 positive place invariants in 3531 ms returned sat
[2022-06-12 21:21:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
Fused 5 Parikh solutions to 1 different solutions.
Support contains 152 out of 25000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Graph (complete) has 60000 edges and 25000 vertex of which 760 are kept as prefixes of interest. Removing 24240 places using SCC suffix rule.56 ms
Discarding 24240 places :
Also discarding 38784 output transitions
Drop transitions removed 38784 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 760 transition count 1216
Applied a total of 2 rules in 315 ms. Remains 760 /25000 variables (removed 24240) and now considering 1216/40001 (removed 38785) transitions.
// Phase 1: matrix 1216 rows 760 cols
[2022-06-12 21:21:47] [INFO ] Computed 152 place invariants in 2 ms
[2022-06-12 21:21:48] [INFO ] Dead Transitions using invariants and state equation in 497 ms returned []
Finished structural reductions, in 1 iterations. Remains : 760/25000 places, 1216/40001 transitions.
[2022-06-12 21:21:48] [INFO ] Flatten gal took : 109 ms
[2022-06-12 21:21:48] [INFO ] Flatten gal took : 69 ms
[2022-06-12 21:21:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8349116267150083208.gal : 39 ms
[2022-06-12 21:21:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13596197866317557841.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/ReachabilityCardinality8349116267150083208.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13596197866317557841.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/ReachabilityCardinality8349116267150083208.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13596197866317557841.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13596197866317557841.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :3104 after 11747
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :11747 after 45500
Detected timeout of ITS tools.
[2022-06-12 21:22:03] [INFO ] Flatten gal took : 58 ms
[2022-06-12 21:22:03] [INFO ] Applying decomposition
[2022-06-12 21:22:03] [INFO ] Flatten gal took : 43 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/graph1634747540387909698.txt, -o, /tmp/graph1634747540387909698.bin, -w, /tmp/graph1634747540387909698.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/graph1634747540387909698.bin, -l, -1, -v, -w, /tmp/graph1634747540387909698.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:22:03] [INFO ] Decomposing Gal with order
[2022-06-12 21:22:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:22:04] [INFO ] Flatten gal took : 98 ms
[2022-06-12 21:22:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2022-06-12 21:22:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18314676363340881386.gal : 11 ms
[2022-06-12 21:22:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16865740424276154914.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/ReachabilityCardinality18314676363340881386.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16865740424276154914.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/ReachabilityCardinality18314676363340881386.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16865740424276154914.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16865740424276154914.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :3104 after 11747
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :11747 after 45500
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1412223073502154494
[2022-06-12 21:22:19] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1412223073502154494
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/ltsmin1412223073502154494]
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/ltsmin1412223073502154494] 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/ltsmin1412223073502154494] 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 1001652 steps, including 2 resets, run finished after 6056 ms. (steps per millisecond=165 ) properties (out of 5) seen :1
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 593841 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=118 ) properties seen :{}
Interrupted Best-First random walk after 506239 steps, including 1 resets, run timeout after 5004 ms. (steps per millisecond=101 ) properties seen :{}
Interrupted Best-First random walk after 566892 steps, including 1 resets, run timeout after 5003 ms. (steps per millisecond=113 ) properties seen :{}
Interrupted Best-First random walk after 709919 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=141 ) properties seen :{}
Running SMT prover for 4 properties.
// Phase 1: matrix 1216 rows 760 cols
[2022-06-12 21:22:46] [INFO ] Computed 152 place invariants in 3 ms
[2022-06-12 21:22:46] [INFO ] [Real]Absence check using 152 positive place invariants in 26 ms returned sat
[2022-06-12 21:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:46] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2022-06-12 21:22:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:47] [INFO ] [Nat]Absence check using 152 positive place invariants in 24 ms returned sat
[2022-06-12 21:22:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:47] [INFO ] [Nat]Absence check using state equation in 865 ms returned sat
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 3 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 785 ms
[2022-06-12 21:22:48] [INFO ] Computed and/alt/rep : 912/2280/912 causal constraints (skipped 0 transitions) in 59 ms.
[2022-06-12 21:22:56] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-06-12 21:22:56] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-06-12 21:22:57] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-06-12 21:22:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 294 ms
[2022-06-12 21:22:57] [INFO ] Added : 485 causal constraints over 99 iterations in 8446 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 21:22:57] [INFO ] [Real]Absence check using 152 positive place invariants in 26 ms returned sat
[2022-06-12 21:22:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:57] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2022-06-12 21:22:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:57] [INFO ] [Nat]Absence check using 152 positive place invariants in 28 ms returned sat
[2022-06-12 21:22:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:59] [INFO ] [Nat]Absence check using state equation in 1259 ms returned sat
[2022-06-12 21:22:59] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-06-12 21:22:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-06-12 21:22:59] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2022-06-12 21:22:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-06-12 21:22:59] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-06-12 21:22:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-06-12 21:22:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 436 ms
[2022-06-12 21:22:59] [INFO ] Computed and/alt/rep : 912/2280/912 causal constraints (skipped 0 transitions) in 55 ms.
[2022-06-12 21:23:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-06-12 21:23:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-06-12 21:23:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-06-12 21:23:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-06-12 21:23:07] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-06-12 21:23:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 520 ms
[2022-06-12 21:23:07] [INFO ] Added : 483 causal constraints over 98 iterations in 8474 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 21:23:08] [INFO ] [Real]Absence check using 152 positive place invariants in 27 ms returned sat
[2022-06-12 21:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:08] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2022-06-12 21:23:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:23:08] [INFO ] [Nat]Absence check using 152 positive place invariants in 31 ms returned sat
[2022-06-12 21:23:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:09] [INFO ] [Nat]Absence check using state equation in 1066 ms returned sat
[2022-06-12 21:23:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-06-12 21:23:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-06-12 21:23:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-06-12 21:23:09] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-06-12 21:23:09] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-06-12 21:23:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 325 ms
[2022-06-12 21:23:10] [INFO ] Computed and/alt/rep : 912/2280/912 causal constraints (skipped 0 transitions) in 54 ms.
[2022-06-12 21:23:17] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-06-12 21:23:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-06-12 21:23:17] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-06-12 21:23:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-06-12 21:23:17] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-06-12 21:23:17] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-06-12 21:23:18] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-06-12 21:23:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 684 ms
[2022-06-12 21:23:18] [INFO ] Added : 469 causal constraints over 95 iterations in 8239 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 21:23:18] [INFO ] [Real]Absence check using 152 positive place invariants in 26 ms returned sat
[2022-06-12 21:23:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:18] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2022-06-12 21:23:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:23:18] [INFO ] [Nat]Absence check using 152 positive place invariants in 24 ms returned sat
[2022-06-12 21:23:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:19] [INFO ] [Nat]Absence check using state equation in 1025 ms returned sat
[2022-06-12 21:23:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-06-12 21:23:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-06-12 21:23:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-06-12 21:23:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-06-12 21:23:20] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-06-12 21:23:20] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2022-06-12 21:23:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 439 ms
[2022-06-12 21:23:20] [INFO ] Computed and/alt/rep : 912/2280/912 causal constraints (skipped 0 transitions) in 51 ms.
[2022-06-12 21:23:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-06-12 21:23:31] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:23:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-06-12 21:23:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-06-12 21:23:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-06-12 21:23:31] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2022-06-12 21:23:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-06-12 21:23:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-06-12 21:23:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-06-12 21:23:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1012 ms
[2022-06-12 21:23:32] [INFO ] Added : 543 causal constraints over 109 iterations in 11866 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
Interrupted Parikh walk after 2084752 steps, including 6 resets, run timeout after 30001 ms. (steps per millisecond=69 ) properties (out of 4) seen :1
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Interrupted Parikh walk after 2063262 steps, including 5 resets, run timeout after 30001 ms. (steps per millisecond=68 ) properties (out of 3) seen :1
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Interrupted Parikh walk after 2193972 steps, including 5 resets, run timeout after 30001 ms. (steps per millisecond=73 ) properties (out of 2) seen :1
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 320417 steps, including 0 resets, run visited all 1 properties in 5812 ms. (steps per millisecond=55 )
FORMULA JoinFreeModules-PT-5000-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655069109542

--------------------
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="JoinFreeModules-PT-5000"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is JoinFreeModules-PT-5000, 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 r143-tall-165271830200086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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