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.r060-tall-165254772300611.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 itstools
Input is Dekker-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772300611
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.7K Apr 30 05:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 05:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 05:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 05:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 247K May 10 09:33 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 Dekker-PT-020-LTLCardinality-00
FORMULA_NAME Dekker-PT-020-LTLCardinality-01
FORMULA_NAME Dekker-PT-020-LTLCardinality-02
FORMULA_NAME Dekker-PT-020-LTLCardinality-03
FORMULA_NAME Dekker-PT-020-LTLCardinality-04
FORMULA_NAME Dekker-PT-020-LTLCardinality-05
FORMULA_NAME Dekker-PT-020-LTLCardinality-06
FORMULA_NAME Dekker-PT-020-LTLCardinality-07
FORMULA_NAME Dekker-PT-020-LTLCardinality-08
FORMULA_NAME Dekker-PT-020-LTLCardinality-09
FORMULA_NAME Dekker-PT-020-LTLCardinality-10
FORMULA_NAME Dekker-PT-020-LTLCardinality-11
FORMULA_NAME Dekker-PT-020-LTLCardinality-12
FORMULA_NAME Dekker-PT-020-LTLCardinality-13
FORMULA_NAME Dekker-PT-020-LTLCardinality-14
FORMULA_NAME Dekker-PT-020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652631344318

Running Version 202205111006
[2022-05-15 16:15:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-05-15 16:15:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:15:45] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2022-05-15 16:15:45] [INFO ] Transformed 100 places.
[2022-05-15 16:15:45] [INFO ] Transformed 440 transitions.
[2022-05-15 16:15:45] [INFO ] Found NUPN structural information;
[2022-05-15 16:15:45] [INFO ] Parsed PT model containing 100 places and 440 transitions in 250 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Dekker-PT-020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 32 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:15:45] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2022-05-15 16:15:45] [INFO ] Computed 60 place invariants in 12 ms
[2022-05-15 16:15:46] [INFO ] Implicit Places using invariants in 287 ms returned [40, 43, 46, 52, 58, 61, 64, 70, 73, 76, 79, 82, 88, 91, 97]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 314 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/100 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 85/100 places, 440/440 transitions.
Support contains 24 out of 85 places after structural reductions.
[2022-05-15 16:15:46] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-15 16:15:46] [INFO ] Flatten gal took : 69 ms
FORMULA Dekker-PT-020-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 16:15:46] [INFO ] Flatten gal took : 36 ms
[2022-05-15 16:15:46] [INFO ] Input system was already deterministic with 440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2022-05-15 16:15:46] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2022-05-15 16:15:46] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-15 16:15:46] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 16:15:46] [INFO ] [Real]Absence check using 40 positive and 5 generalized place invariants in 0 ms returned sat
[2022-05-15 16:15:46] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2022-05-15 16:15:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 16:15:46] [INFO ] After 15ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :2 real:1
[2022-05-15 16:15:46] [INFO ] After 33ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 16:15:46] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 16:15:47] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 16:15:47] [INFO ] [Nat]Absence check using 40 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-15 16:15:47] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 16:15:47] [INFO ] After 28ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 16:15:47] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-05-15 16:15:47] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 62 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2022-05-15 16:15:47] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2022-05-15 16:15:47] [INFO ] Computed 45 place invariants in 4 ms
[2022-05-15 16:15:47] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 16:15:47] [INFO ] [Real]Absence check using 40 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 16:15:47] [INFO ] After 29ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 16:15:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 16:15:47] [INFO ] After 7ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-15 16:15:47] [INFO ] After 14ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:15:47] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:15:47] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned sat
[2022-05-15 16:15:47] [INFO ] [Nat]Absence check using 40 positive and 5 generalized place invariants in 15 ms returned sat
[2022-05-15 16:15:47] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:15:47] [INFO ] After 7ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 16:15:47] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-15 16:15:47] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 29 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1423002 steps, run timeout after 3001 ms. (steps per millisecond=474 ) properties seen :{}
Probabilistic random walk after 1423002 steps, saw 700727 distinct states, run finished after 3002 ms. (steps per millisecond=474 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 16:15:50] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2022-05-15 16:15:50] [INFO ] Computed 45 place invariants in 3 ms
[2022-05-15 16:15:51] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2022-05-15 16:15:51] [INFO ] [Real]Absence check using 40 positive and 5 generalized place invariants in 5 ms returned sat
[2022-05-15 16:15:51] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 16:15:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 16:15:51] [INFO ] After 7ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-15 16:15:51] [INFO ] After 14ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:15:51] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:15:51] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 16:15:51] [INFO ] [Nat]Absence check using 40 positive and 5 generalized place invariants in 0 ms returned sat
[2022-05-15 16:15:51] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:15:51] [INFO ] After 6ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 16:15:51] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-15 16:15:51] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 16 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 440/440 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 14 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:15:51] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2022-05-15 16:15:51] [INFO ] Computed 45 place invariants in 3 ms
[2022-05-15 16:15:51] [INFO ] Implicit Places using invariants in 158 ms returned [46, 51, 60, 73, 80]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 160 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 80/85 places, 440/440 transitions.
Applied a total of 0 rules in 12 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 80/85 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1494675 steps, run timeout after 3001 ms. (steps per millisecond=498 ) properties seen :{}
Probabilistic random walk after 1494675 steps, saw 726139 distinct states, run finished after 3001 ms. (steps per millisecond=498 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 16:15:54] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2022-05-15 16:15:54] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-15 16:15:54] [INFO ] [Real]Absence check using 40 positive place invariants in 9 ms returned sat
[2022-05-15 16:15:54] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 16:15:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 16:15:54] [INFO ] After 8ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-15 16:15:54] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:15:54] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:15:54] [INFO ] [Nat]Absence check using 40 positive place invariants in 4 ms returned sat
[2022-05-15 16:15:54] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:15:54] [INFO ] After 7ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 16:15:54] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-15 16:15:54] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 440/440 transitions.
Applied a total of 0 rules in 18 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 440/440 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 440/440 transitions.
Applied a total of 0 rules in 11 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:15:54] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2022-05-15 16:15:54] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-15 16:15:54] [INFO ] Implicit Places using invariants in 104 ms returned []
[2022-05-15 16:15:54] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2022-05-15 16:15:54] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-15 16:15:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 16:15:54] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2022-05-15 16:15:54] [INFO ] Redundant transitions in 28 ms returned []
[2022-05-15 16:15:54] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2022-05-15 16:15:54] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-15 16:15:55] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 440/440 transitions.
Graph (complete) has 120 edges and 80 vertex of which 4 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.7 ms
Discarding 76 places :
Also discarding 418 output transitions
Drop transitions removed 418 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 4 transition count 4
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 1 with 3 rules applied. Total rules applied 22 place count 2 transition count 3
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 2 transition count 2
Applied a total of 23 rules in 10 ms. Remains 2 /80 variables (removed 78) and now considering 2/440 (removed 438) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-15 16:15:55] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:15:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-15 16:15:55] [INFO ] After 1ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 16:15:55] [INFO ] After 3ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-15 16:15:55] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-15 16:15:55] [INFO ] Flatten gal took : 1 ms
[2022-05-15 16:15:55] [INFO ] Flatten gal took : 1 ms
[2022-05-15 16:15:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7378824591749536880.gal : 1 ms
[2022-05-15 16:15:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5135547231185211673.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5158259807497136380;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7378824591749536880.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5135547231185211673.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality5135547231185211673.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.011803,3268,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Reachability property AtomicPropp7 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp7,1,0.012132,3692,2,3,6,12,7,0,16,6,0
FORMULA Dekker-PT-020-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((p0 U F(!p0)))))'
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:15:55] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2022-05-15 16:15:55] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-15 16:15:55] [INFO ] Implicit Places using invariants in 119 ms returned [46, 51, 60, 73, 80]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 120 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/85 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 80/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 187 ms :[p0, p0]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4799 reset in 518 ms.
Stack based approach found an accepted trace after 24 steps with 3 reset with depth 4 and stack size 4 in 1 ms.
FORMULA Dekker-PT-020-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-020-LTLCardinality-01 finished in 1038 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F(F(p0)))||p1))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:15:56] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2022-05-15 16:15:56] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-15 16:15:56] [INFO ] Implicit Places using invariants in 117 ms returned [46, 51, 60, 73, 80]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 118 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/85 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 80/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s73 1), p0:(OR (EQ s72 0) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 19190 reset in 396 ms.
Stack based approach found an accepted trace after 88 steps with 20 reset with depth 6 and stack size 6 in 1 ms.
FORMULA Dekker-PT-020-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-020-LTLCardinality-03 finished in 670 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X(G((X(F(G(p0)))||F(p1))))))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 30 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:15:57] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2022-05-15 16:15:57] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-15 16:15:57] [INFO ] Implicit Places using invariants in 222 ms returned [46, 51, 73, 80]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 226 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/85 places, 440/440 transitions.
Applied a total of 0 rules in 24 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 81/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s74 0), p1:(AND (EQ s58 0) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 489 ms.
Product exploration explored 100000 steps with 0 reset in 437 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 328 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-15 16:15:58] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2022-05-15 16:15:58] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 16:15:58] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:15:58] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 16:15:58] [INFO ] [Nat]Absence check using 40 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 16:15:58] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:15:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 16:15:58] [INFO ] After 7ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 16:15:59] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2022-05-15 16:15:59] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2022-05-15 16:15:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2022-05-15 16:15:59] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 16:15:59] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2022-05-15 16:15:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2022-05-15 16:15:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 16:15:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-15 16:15:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-05-15 16:15:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-05-15 16:15:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2022-05-15 16:15:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 381 ms
[2022-05-15 16:15:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 381 ms
[2022-05-15 16:15:59] [INFO ] After 394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-15 16:15:59] [INFO ] After 478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 440/440 transitions.
Applied a total of 0 rules in 9 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Finished Best-First random walk after 6764 steps, including 2 resets, run visited all 1 properties in 7 ms. (steps per millisecond=966 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 440/440 transitions.
Applied a total of 0 rules in 10 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:15:59] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2022-05-15 16:15:59] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 16:15:59] [INFO ] Implicit Places using invariants in 107 ms returned []
[2022-05-15 16:15:59] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2022-05-15 16:15:59] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-15 16:15:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 16:16:00] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2022-05-15 16:16:00] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-15 16:16:00] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2022-05-15 16:16:00] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 16:16:00] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 440/440 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :1
Finished Best-First random walk after 3382 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=845 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 240 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 417 ms.
Product exploration explored 100000 steps with 0 reset in 461 ms.
Built C files in :
/tmp/ltsmin18288165908530497653
[2022-05-15 16:16:01] [INFO ] Computing symmetric may disable matrix : 440 transitions.
[2022-05-15 16:16:01] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 16:16:01] [INFO ] Computing symmetric may enable matrix : 440 transitions.
[2022-05-15 16:16:01] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 16:16:02] [INFO ] Computing Do-Not-Accords matrix : 440 transitions.
[2022-05-15 16:16:02] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 16:16:02] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18288165908530497653
Running compilation step : cd /tmp/ltsmin18288165908530497653;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1055 ms.
Running link step : cd /tmp/ltsmin18288165908530497653;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin18288165908530497653;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased278905333619435252.hoa' '--buchi-type=spotba'
LTSmin run took 1403 ms.
FORMULA Dekker-PT-020-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Dekker-PT-020-LTLCardinality-05 finished in 7484 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(!X(F(p1)))))'
Support contains 6 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:16:04] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2022-05-15 16:16:04] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-15 16:16:04] [INFO ] Implicit Places using invariants in 102 ms returned [46, 60, 73, 80]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 104 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/85 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 81/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 130 ms :[p1, p1, true]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (OR (EQ s77 0) (EQ s14 1)) (OR (EQ s43 0) (EQ s50 1))), p0:(OR (EQ s36 0) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-020-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-LTLCardinality-06 finished in 254 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:16:04] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2022-05-15 16:16:04] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-15 16:16:04] [INFO ] Implicit Places using invariants in 112 ms returned [46, 51, 60, 73, 80]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 114 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/85 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 80/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(NEQ s69 1), p1:(AND (NEQ s14 0) (NEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 432 ms.
Product exploration explored 100000 steps with 0 reset in 421 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Property proved to be false thanks to negative knowledge :(X (X (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 268 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA Dekker-PT-020-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Dekker-PT-020-LTLCardinality-08 finished in 1412 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(F(X(G(p0)))))&&p1)))'
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:16:06] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2022-05-15 16:16:06] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-15 16:16:06] [INFO ] Implicit Places using invariants in 110 ms returned [51, 60, 73, 80]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 111 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/85 places, 440/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 81/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s37 0) (EQ s21 1)), p0:(AND (EQ s61 0) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 417 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 30 in 0 ms.
FORMULA Dekker-PT-020-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-020-LTLCardinality-09 finished in 728 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U !X(p0)))))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 12 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:16:06] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2022-05-15 16:16:06] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-15 16:16:07] [INFO ] Implicit Places using invariants in 116 ms returned [46, 51, 60, 73]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 117 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/85 places, 440/440 transitions.
Applied a total of 0 rules in 9 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 81/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 91 ms :[p0, p0, p0]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s76 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3182 reset in 405 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA Dekker-PT-020-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-020-LTLCardinality-12 finished in 659 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U X(F(p0)))&&X(p1)))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:16:07] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2022-05-15 16:16:07] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-15 16:16:07] [INFO ] Implicit Places using invariants in 109 ms returned [46, 51, 60, 73, 80]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 110 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/85 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 80/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s52 1), p1:(OR (EQ s34 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1759 steps with 72 reset in 15 ms.
FORMULA Dekker-PT-020-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-LTLCardinality-14 finished in 280 ms.
All properties solved by simple procedures.
Total runtime 22464 ms.

BK_STOP 1652631367962

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -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=@none -Xss128m -Xms40m -Xmx8192m

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="Dekker-PT-020"
export BK_EXAMINATION="LTLCardinality"
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 Dekker-PT-020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r060-tall-165254772300611"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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