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.r168-tall-165277016600419.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 PhilosophersDyn-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016600419
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 37K Apr 30 07:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 182K Apr 30 07:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 318K Apr 30 07:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 30 07:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 28K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 126K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 469K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 PhilosophersDyn-PT-10-LTLCardinality-00
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-01
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-02
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-03
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-04
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-05
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-06
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-07
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-08
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-09
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-10
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-11
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-12
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-13
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-14
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652844189696

Running Version 202205111006
[2022-05-18 03:23:10] [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-18 03:23:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 03:23:11] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2022-05-18 03:23:11] [INFO ] Transformed 170 places.
[2022-05-18 03:23:11] [INFO ] Transformed 2310 transitions.
[2022-05-18 03:23:11] [INFO ] Parsed PT model containing 170 places and 2310 transitions in 336 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 161 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 52 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2022-05-18 03:23:11] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2022-05-18 03:23:11] [INFO ] Computed 39 place invariants in 88 ms
[2022-05-18 03:23:12] [INFO ] Dead Transitions using invariants and state equation in 1116 ms found 380 transitions.
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:23:12] [INFO ] Computed 39 place invariants in 78 ms
[2022-05-18 03:23:12] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:23:12] [INFO ] Computed 39 place invariants in 45 ms
[2022-05-18 03:23:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:23:13] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 15 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/2265 transitions.
Support contains 161 out of 170 places after structural reductions.
[2022-05-18 03:23:14] [INFO ] Flatten gal took : 234 ms
[2022-05-18 03:23:14] [INFO ] Flatten gal took : 180 ms
[2022-05-18 03:23:14] [INFO ] Input system was already deterministic with 1885 transitions.
Incomplete random walk after 10000 steps, including 1194 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 18) seen :13
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:23:15] [INFO ] Computed 39 place invariants in 33 ms
[2022-05-18 03:23:15] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-18 03:23:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-05-18 03:23:15] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 12 ms returned sat
[2022-05-18 03:23:16] [INFO ] After 591ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-05-18 03:23:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:23:40] [INFO ] After 24300ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-05-18 03:23:40] [INFO ] After 24302ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-18 03:23:40] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 228 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:23:40] [INFO ] Computed 39 place invariants in 42 ms
[2022-05-18 03:23:41] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1199 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 145378 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145378 steps, saw 37819 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:23:44] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-18 03:23:45] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-18 03:23:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-18 03:23:45] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2022-05-18 03:23:45] [INFO ] After 594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-18 03:23:45] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:23:59] [INFO ] After 13512ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-18 03:24:10] [INFO ] After 24337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-18 03:24:10] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 129 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 115 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:24:10] [INFO ] Computed 39 place invariants in 40 ms
[2022-05-18 03:24:10] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:24:10] [INFO ] Computed 39 place invariants in 38 ms
[2022-05-18 03:24:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:24:17] [INFO ] Implicit Places using invariants and state equation in 6436 ms returned []
Implicit Place search using SMT with State Equation took 6697 ms to find 0 implicit places.
[2022-05-18 03:24:17] [INFO ] Redundant transitions in 133 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:24:17] [INFO ] Computed 39 place invariants in 33 ms
[2022-05-18 03:24:17] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 51 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:24:17] [INFO ] Computed 39 place invariants in 36 ms
[2022-05-18 03:24:18] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-18 03:24:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-18 03:24:18] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2022-05-18 03:24:18] [INFO ] After 647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-18 03:24:19] [INFO ] After 1010ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 247 ms.
[2022-05-18 03:24:19] [INFO ] After 1336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-18 03:24:19] [INFO ] Flatten gal took : 114 ms
[2022-05-18 03:24:19] [INFO ] Flatten gal took : 113 ms
[2022-05-18 03:24:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6939571399886562231.gal : 30 ms
[2022-05-18 03:24:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality843111914326401093.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms15728323286417645945;'/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/ReachabilityCardinality6939571399886562231.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality843111914326401093.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...318
Loading property file /tmp/ReachabilityCardinality843111914326401093.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 65
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :65 after 91
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :91 after 326
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :326 after 570
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :570 after 871
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :871 after 3681
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :3681 after 18285
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :18285 after 31990
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :31990 after 711281
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :711281 after 944413
Reachability property AtomicPropp4 is true.
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :944413 after 3.2933e+07
Detected timeout of ITS tools.
[2022-05-18 03:24:34] [INFO ] Flatten gal took : 111 ms
[2022-05-18 03:24:34] [INFO ] Applying decomposition
[2022-05-18 03:24:35] [INFO ] Flatten gal took : 101 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15161990925624206077.txt' '-o' '/tmp/graph15161990925624206077.bin' '-w' '/tmp/graph15161990925624206077.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15161990925624206077.bin' '-l' '-1' '-v' '-w' '/tmp/graph15161990925624206077.weights' '-q' '0' '-e' '0.001'
[2022-05-18 03:24:35] [INFO ] Decomposing Gal with order
[2022-05-18 03:24:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 03:24:36] [INFO ] Removed a total of 1600 redundant transitions.
[2022-05-18 03:24:37] [INFO ] Flatten gal took : 1588 ms
[2022-05-18 03:24:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 1620 labels/synchronizations in 128 ms.
[2022-05-18 03:24:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14059842979256280384.gal : 15 ms
[2022-05-18 03:24:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14886418578290554118.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15728323286417645945;'/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/ReachabilityCardinality14059842979256280384.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14886418578290554118.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...321
Loading property file /tmp/ReachabilityCardinality14886418578290554118.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 41
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :41 after 58
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :58 after 169
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :169 after 699
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :699 after 1618
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1618 after 4030
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :4030 after 25411
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :25411 after 43468
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :43468 after 744083
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :744083 after 1.69815e+06
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.69815e+06 after 1.75042e+07
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :1.75042e+07 after 3.01818e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14993584190197527644
[2022-05-18 03:24:52] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14993584190197527644
Running compilation step : cd /tmp/ltsmin14993584190197527644;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14993584190197527644;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14993584190197527644;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
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(p0) U X((G(p1)||X(p0)||G(p2)))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:24:55] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-18 03:24:56] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:24:56] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-18 03:24:56] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:24:56] [INFO ] Computed 39 place invariants in 32 ms
[2022-05-18 03:24:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:24:59] [INFO ] Implicit Places using invariants and state equation in 2284 ms returned []
Implicit Place search using SMT with State Equation took 2541 ms to find 0 implicit places.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:24:59] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-18 03:24:59] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 424 ms :[(OR p1 p0 p2), (OR p1 p2 p0), p0, p0, p1, p2, true, p0]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 7}], [{ cond=p0, acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 3}, { cond=(AND p0 p1), acceptance={} source=7 dest: 4}, { cond=(AND p0 p2), acceptance={} source=7 dest: 5}]], initial=0, aps=[p0:(LEQ (ADD s1 s5 s6 s7 s8 s9 s10 s14 s15 s17 s18 s20 s23 s25 s27 s28 s29 s32 s33 s34 s36 s37 s40 s44 s45 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s60 s61...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 3 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-00 finished in 4362 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 11 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:00] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-18 03:25:00] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:00] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-18 03:25:01] [INFO ] Implicit Places using invariants in 367 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:01] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-18 03:25:01] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:25:07] [INFO ] Implicit Places using invariants and state equation in 6797 ms returned []
Implicit Place search using SMT with State Equation took 7165 ms to find 0 implicit places.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:07] [INFO ] Computed 39 place invariants in 34 ms
[2022-05-18 03:25:08] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 (ADD s16 s81 s87 s106 s109 s125 s141 s144 s160 s161))], 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 50000 reset in 2552 ms.
Product exploration explored 100000 steps with 50000 reset in 2466 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-01 finished in 13649 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((G(p0)||p1)))))'
Support contains 120 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 189 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:13] [INFO ] Computed 39 place invariants in 34 ms
[2022-05-18 03:25:14] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:14] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-18 03:25:14] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:14] [INFO ] Computed 39 place invariants in 36 ms
[2022-05-18 03:25:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:25:16] [INFO ] Implicit Places using invariants and state equation in 2179 ms returned []
Implicit Place search using SMT with State Equation took 2284 ms to find 0 implicit places.
[2022-05-18 03:25:16] [INFO ] Redundant transitions in 113 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:16] [INFO ] Computed 39 place invariants in 36 ms
[2022-05-18 03:25:17] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-02 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:(GT (ADD s3 s13 s31 s35 s47 s97 s108 s127 s140 s146) (ADD s0 s19 s43 s63 s83 s107 s115 s152 s153 s155)), p1:(GT 2 (ADD s1 s5 s6 s7 s8 s9 s10 s14 s15 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 3 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-02 finished in 3933 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(((p0 U X(p1))||p2))))&&X(G(p3))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:17] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-18 03:25:18] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:18] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-18 03:25:18] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:18] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-18 03:25:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:25:19] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 1423 ms to find 0 implicit places.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:19] [INFO ] Computed 39 place invariants in 31 ms
[2022-05-18 03:25:20] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p3), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 5}], [{ cond=(AND p3 p2), acceptance={} source=1 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND p3 p2) (AND p3 p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 5}], [{ cond=p3, acceptance={} source=3 dest: 1}, { cond=(NOT p3), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p3:(LEQ (ADD s12 s24 s30 s65 s66 s71 s99 s124 s138 s159) (ADD s3 s13 s31 s35 s47 s97 s108 s127 s140 s146)), p2:(LEQ 2 (ADD s1 s5 s6 s7 s8 s9 s10 s14 s15 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-06 finished in 3039 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((p0&&(G(p1)||p1))))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 139 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:20] [INFO ] Computed 39 place invariants in 32 ms
[2022-05-18 03:25:21] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:21] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-18 03:25:21] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:21] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-18 03:25:21] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:25:23] [INFO ] Implicit Places using invariants and state equation in 1774 ms returned []
Implicit Place search using SMT with State Equation took 1868 ms to find 0 implicit places.
[2022-05-18 03:25:23] [INFO ] Redundant transitions in 52 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:23] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-18 03:25:24] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 39 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s3 s13 s31 s35 s47 s97 s108 s127 s140 s146) (ADD s0 s19 s43 s63 s83 s107 s115 s152 s153 s155)), p1:(LEQ (ADD s1 s5 s6 s7 s8 s9 s10 s14 s15 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-07 finished in 3410 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 12 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:24] [INFO ] Computed 39 place invariants in 34 ms
[2022-05-18 03:25:24] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:24] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-18 03:25:25] [INFO ] Implicit Places using invariants in 362 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:25] [INFO ] Computed 39 place invariants in 34 ms
[2022-05-18 03:25:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:25:32] [INFO ] Implicit Places using invariants and state equation in 7224 ms returned []
Implicit Place search using SMT with State Equation took 7587 ms to find 0 implicit places.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:32] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-18 03:25:32] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, 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=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GT s142 s166), p0:(GT 2 s13)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 11948 reset in 1053 ms.
Product exploration explored 100000 steps with 11897 reset in 1113 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 (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 8 factoid took 334 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1193 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:25:36] [INFO ] Computed 39 place invariants in 38 ms
[2022-05-18 03:25:36] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-18 03:25:36] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2022-05-18 03:25:36] [INFO ] After 511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 03:25:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-18 03:25:36] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2022-05-18 03:25:37] [INFO ] After 572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-18 03:25:37] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:25:39] [INFO ] After 1679ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-18 03:25:39] [INFO ] After 2302ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 436 ms.
[2022-05-18 03:25:40] [INFO ] After 3393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 170 transition count 1877
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 162 transition count 1877
Applied a total of 16 rules in 227 ms. Remains 162 /170 variables (removed 8) and now considering 1877/1885 (removed 8) transitions.
// Phase 1: matrix 1877 rows 162 cols
[2022-05-18 03:25:40] [INFO ] Computed 39 place invariants in 34 ms
[2022-05-18 03:25:41] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/170 places, 1877/1885 transitions.
Incomplete random walk after 10000 steps, including 1184 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 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 92 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 132625 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132625 steps, saw 33503 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1877 rows 162 cols
[2022-05-18 03:25:44] [INFO ] Computed 39 place invariants in 37 ms
[2022-05-18 03:25:44] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-18 03:25:44] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 8 ms returned sat
[2022-05-18 03:25:44] [INFO ] After 507ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 03:25:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-18 03:25:44] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 7 ms returned sat
[2022-05-18 03:25:45] [INFO ] After 546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-18 03:25:45] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:25:47] [INFO ] After 1954ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-18 03:25:47] [INFO ] Deduced a trap composed of 57 places in 228 ms of which 1 ms to minimize.
[2022-05-18 03:25:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2022-05-18 03:25:48] [INFO ] Deduced a trap composed of 57 places in 266 ms of which 2 ms to minimize.
[2022-05-18 03:25:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 496 ms
[2022-05-18 03:25:49] [INFO ] After 3522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 734 ms.
[2022-05-18 03:25:49] [INFO ] After 4878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 162/162 places, 1877/1877 transitions.
Applied a total of 0 rules in 132 ms. Remains 162 /162 variables (removed 0) and now considering 1877/1877 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 1877/1877 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 162/162 places, 1877/1877 transitions.
Applied a total of 0 rules in 104 ms. Remains 162 /162 variables (removed 0) and now considering 1877/1877 (removed 0) transitions.
// Phase 1: matrix 1877 rows 162 cols
[2022-05-18 03:25:50] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-18 03:25:50] [INFO ] Implicit Places using invariants in 379 ms returned [2, 38, 58, 74, 91, 97, 107, 139]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 386 ms to find 8 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 154/162 places, 1877/1877 transitions.
Free-agglomeration rule applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 154 transition count 1869
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 1869
Applied a total of 16 rules in 232 ms. Remains 146 /154 variables (removed 8) and now considering 1869/1877 (removed 8) transitions.
// Phase 1: matrix 1869 rows 146 cols
[2022-05-18 03:25:50] [INFO ] Computed 31 place invariants in 36 ms
[2022-05-18 03:25:51] [INFO ] Implicit Places using invariants in 389 ms returned []
// Phase 1: matrix 1869 rows 146 cols
[2022-05-18 03:25:51] [INFO ] Computed 31 place invariants in 31 ms
[2022-05-18 03:25:51] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:25:57] [INFO ] Implicit Places using invariants and state equation in 6538 ms returned []
Implicit Place search using SMT with State Equation took 6930 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 146/162 places, 1869/1877 transitions.
Finished structural reductions, in 2 iterations. Remains : 146/162 places, 1869/1877 transitions.
Incomplete random walk after 10000 steps, including 1630 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Probably explored full state space saw : 27319 states, properties seen :0
Probabilistic random walk after 95624 steps, saw 27319 distinct states, run finished after 2282 ms. (steps per millisecond=41 ) properties seen :0
Explored full state space saw : 27319 states, properties seen :0
Exhaustive walk after 95624 steps, saw 27319 distinct states, run finished after 2313 ms. (steps per millisecond=41 ) properties seen :0
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G p0), (G (NOT (AND p1 (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 11 factoid took 313 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-08 finished in 38735 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||p1)))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 110 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:26:03] [INFO ] Computed 39 place invariants in 33 ms
[2022-05-18 03:26:03] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:26:03] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-18 03:26:03] [INFO ] Implicit Places using invariants in 356 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:26:03] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-18 03:26:04] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:26:11] [INFO ] Implicit Places using invariants and state equation in 7210 ms returned []
Implicit Place search using SMT with State Equation took 7568 ms to find 0 implicit places.
[2022-05-18 03:26:11] [INFO ] Redundant transitions in 53 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:26:11] [INFO ] Computed 39 place invariants in 32 ms
[2022-05-18 03:26:11] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(LEQ s22 s152), p1:(GT 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 11934 reset in 1030 ms.
Product exploration explored 100000 steps with 11926 reset in 1033 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 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 351 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1188 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:26:14] [INFO ] Computed 39 place invariants in 32 ms
[2022-05-18 03:26:14] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2022-05-18 03:26:14] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2022-05-18 03:26:15] [INFO ] After 625ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 03:26:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2022-05-18 03:26:15] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2022-05-18 03:26:16] [INFO ] After 630ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-18 03:26:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:26:17] [INFO ] After 1781ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-18 03:26:18] [INFO ] After 2433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 670 ms.
[2022-05-18 03:26:19] [INFO ] After 3816ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 36 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 170 transition count 1876
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 161 transition count 1876
Applied a total of 18 rules in 213 ms. Remains 161 /170 variables (removed 9) and now considering 1876/1885 (removed 9) transitions.
// Phase 1: matrix 1876 rows 161 cols
[2022-05-18 03:26:19] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-18 03:26:20] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/170 places, 1876/1885 transitions.
Incomplete random walk after 10000 steps, including 1193 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 133647 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133647 steps, saw 33745 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1876 rows 161 cols
[2022-05-18 03:26:23] [INFO ] Computed 39 place invariants in 42 ms
[2022-05-18 03:26:23] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2022-05-18 03:26:23] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 13 ms returned sat
[2022-05-18 03:26:24] [INFO ] After 578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 03:26:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2022-05-18 03:26:24] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 10 ms returned sat
[2022-05-18 03:26:24] [INFO ] After 636ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-18 03:26:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:26:26] [INFO ] After 1597ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-18 03:26:27] [INFO ] Deduced a trap composed of 67 places in 236 ms of which 2 ms to minimize.
[2022-05-18 03:26:27] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 0 ms to minimize.
[2022-05-18 03:26:27] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 0 ms to minimize.
[2022-05-18 03:26:28] [INFO ] Deduced a trap composed of 48 places in 231 ms of which 0 ms to minimize.
[2022-05-18 03:26:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1309 ms
[2022-05-18 03:26:28] [INFO ] After 3526ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 580 ms.
[2022-05-18 03:26:28] [INFO ] After 4841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 28 ms.
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 1876/1876 transitions.
Applied a total of 0 rules in 102 ms. Remains 161 /161 variables (removed 0) and now considering 1876/1876 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 1876/1876 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 1876/1876 transitions.
Applied a total of 0 rules in 100 ms. Remains 161 /161 variables (removed 0) and now considering 1876/1876 (removed 0) transitions.
// Phase 1: matrix 1876 rows 161 cols
[2022-05-18 03:26:29] [INFO ] Computed 39 place invariants in 40 ms
[2022-05-18 03:26:29] [INFO ] Implicit Places using invariants in 392 ms returned [2, 37, 72, 89, 96, 106, 110, 138, 157]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 397 ms to find 9 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 152/161 places, 1876/1876 transitions.
Free-agglomeration rule applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 152 transition count 1868
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 144 transition count 1868
Applied a total of 16 rules in 207 ms. Remains 144 /152 variables (removed 8) and now considering 1868/1876 (removed 8) transitions.
// Phase 1: matrix 1868 rows 144 cols
[2022-05-18 03:26:29] [INFO ] Computed 30 place invariants in 30 ms
[2022-05-18 03:26:30] [INFO ] Implicit Places using invariants in 372 ms returned []
// Phase 1: matrix 1868 rows 144 cols
[2022-05-18 03:26:30] [INFO ] Computed 30 place invariants in 29 ms
[2022-05-18 03:26:30] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:26:36] [INFO ] Implicit Places using invariants and state equation in 6509 ms returned []
Implicit Place search using SMT with State Equation took 6885 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 144/161 places, 1868/1876 transitions.
Finished structural reductions, in 2 iterations. Remains : 144/161 places, 1868/1876 transitions.
Incomplete random walk after 10000 steps, including 1628 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Probably explored full state space saw : 25495 states, properties seen :0
Probabilistic random walk after 89969 steps, saw 25495 distinct states, run finished after 2283 ms. (steps per millisecond=39 ) properties seen :0
Explored full state space saw : 25495 states, properties seen :0
Exhaustive walk after 89969 steps, saw 25495 distinct states, run finished after 2259 ms. (steps per millisecond=39 ) properties seen :0
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (G p1), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Property proved to be true thanks to knowledge :(G p1)
Knowledge based reduction with 11 factoid took 463 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-10 finished in 39230 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((false U G(p0))))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 10 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:26:42] [INFO ] Computed 39 place invariants in 46 ms
[2022-05-18 03:26:42] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:26:42] [INFO ] Computed 39 place invariants in 32 ms
[2022-05-18 03:26:43] [INFO ] Implicit Places using invariants in 380 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:26:43] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-18 03:26:43] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:26:50] [INFO ] Implicit Places using invariants and state equation in 7232 ms returned []
Implicit Place search using SMT with State Equation took 7613 ms to find 0 implicit places.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:26:50] [INFO ] Computed 39 place invariants in 38 ms
[2022-05-18 03:26:50] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s12 s136)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 2 reset in 2 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-11 finished in 8993 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 13 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:26:51] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-18 03:26:51] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:26:51] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-18 03:26:52] [INFO ] Implicit Places using invariants in 344 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:26:52] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-18 03:26:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:26:59] [INFO ] Implicit Places using invariants and state equation in 7231 ms returned []
Implicit Place search using SMT with State Equation took 7576 ms to find 0 implicit places.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:26:59] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-18 03:26:59] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s125 s140)], 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][false, false, false]]
Stuttering criterion allowed to conclude after 354 steps with 116 reset in 9 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-12 finished in 8959 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 11 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:27:00] [INFO ] Computed 39 place invariants in 34 ms
[2022-05-18 03:27:00] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:27:00] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-18 03:27:01] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:27:01] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-18 03:27:01] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:27:08] [INFO ] Implicit Places using invariants and state equation in 7296 ms returned []
Implicit Place search using SMT with State Equation took 7680 ms to find 0 implicit places.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:27:08] [INFO ] Computed 39 place invariants in 33 ms
[2022-05-18 03:27:08] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s46)], 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 36804 reset in 1990 ms.
Stack based approach found an accepted trace after 6713 steps with 2458 reset with depth 5 and stack size 5 in 139 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-13 finished in 11123 ms.
All properties solved by simple procedures.
Total runtime 240192 ms.

BK_STOP 1652844431226

--------------------
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="PhilosophersDyn-PT-10"
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 PhilosophersDyn-PT-10, 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 r168-tall-165277016600419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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