fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r517-tall-167987243600259
Last Updated
May 14, 2023

About the Execution of ITS-Tools for EisenbergMcGuire-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1686.271 129972.00 170628.00 2932.50 TFFFTTFFTFFFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r517-tall-167987243600259.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is EisenbergMcGuire-PT-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243600259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 31 16:48 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 EisenbergMcGuire-PT-08-LTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680831179622

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2023-04-07 01:33:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-07 01:33:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 01:33:01] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2023-04-07 01:33:01] [INFO ] Transformed 712 places.
[2023-04-07 01:33:01] [INFO ] Transformed 2816 transitions.
[2023-04-07 01:33:01] [INFO ] Found NUPN structural information;
[2023-04-07 01:33:01] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 658 transition count 2384
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 658 transition count 2384
Applied a total of 108 rules in 128 ms. Remains 658 /712 variables (removed 54) and now considering 2384/2816 (removed 432) transitions.
[2023-04-07 01:33:01] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
// Phase 1: matrix 936 rows 658 cols
[2023-04-07 01:33:01] [INFO ] Computed 25 invariants in 26 ms
[2023-04-07 01:33:02] [INFO ] Implicit Places using invariants in 623 ms returned []
[2023-04-07 01:33:02] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2023-04-07 01:33:02] [INFO ] Invariant cache hit.
[2023-04-07 01:33:02] [INFO ] State equation strengthened by 298 read => feed constraints.
[2023-04-07 01:33:05] [INFO ] Implicit Places using invariants and state equation in 2950 ms returned []
Implicit Place search using SMT with State Equation took 3603 ms to find 0 implicit places.
[2023-04-07 01:33:05] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2023-04-07 01:33:05] [INFO ] Invariant cache hit.
[2023-04-07 01:33:05] [INFO ] Dead Transitions using invariants and state equation in 735 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 658/712 places, 2384/2816 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4468 ms. Remains : 658/712 places, 2384/2816 transitions.
Support contains 26 out of 658 places after structural reductions.
[2023-04-07 01:33:07] [INFO ] Flatten gal took : 154 ms
[2023-04-07 01:33:07] [INFO ] Flatten gal took : 107 ms
[2023-04-07 01:33:07] [INFO ] Input system was already deterministic with 2384 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 01:33:08] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2023-04-07 01:33:08] [INFO ] Invariant cache hit.
[2023-04-07 01:33:08] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 01:33:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 20 ms returned sat
[2023-04-07 01:33:08] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 01:33:09] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 01:33:09] [INFO ] State equation strengthened by 298 read => feed constraints.
[2023-04-07 01:33:09] [INFO ] After 137ms SMT Verify possible using 298 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 01:33:09] [INFO ] Deduced a trap composed of 3 places in 345 ms of which 4 ms to minimize.
[2023-04-07 01:33:10] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 1 ms to minimize.
[2023-04-07 01:33:10] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 1 ms to minimize.
[2023-04-07 01:33:10] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 1 ms to minimize.
[2023-04-07 01:33:11] [INFO ] Deduced a trap composed of 38 places in 304 ms of which 1 ms to minimize.
[2023-04-07 01:33:11] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 0 ms to minimize.
[2023-04-07 01:33:11] [INFO ] Deduced a trap composed of 3 places in 234 ms of which 1 ms to minimize.
[2023-04-07 01:33:11] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 1 ms to minimize.
[2023-04-07 01:33:11] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 0 ms to minimize.
[2023-04-07 01:33:12] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2023-04-07 01:33:12] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 1 ms to minimize.
[2023-04-07 01:33:12] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 1 ms to minimize.
[2023-04-07 01:33:12] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2023-04-07 01:33:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 3137 ms
[2023-04-07 01:33:12] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 0 ms to minimize.
[2023-04-07 01:33:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2023-04-07 01:33:12] [INFO ] After 3533ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-04-07 01:33:12] [INFO ] After 4311ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 658 transition count 2376
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 650 transition count 2376
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 16 place count 650 transition count 2178
Deduced a syphon composed of 198 places in 2 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 412 place count 452 transition count 2178
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 414 place count 450 transition count 2162
Iterating global reduction 2 with 2 rules applied. Total rules applied 416 place count 450 transition count 2162
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 5 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 394 transition count 2106
Applied a total of 528 rules in 235 ms. Remains 394 /658 variables (removed 264) and now considering 2106/2384 (removed 278) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 394/658 places, 2106/2384 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 496881 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :{}
Probabilistic random walk after 496881 steps, saw 261486 distinct states, run finished after 3002 ms. (steps per millisecond=165 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 01:33:16] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2023-04-07 01:33:16] [INFO ] Computed 25 invariants in 10 ms
[2023-04-07 01:33:16] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:33:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:33:16] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:33:16] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:33:16] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:33:16] [INFO ] After 78ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:33:16] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2023-04-07 01:33:16] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 0 ms to minimize.
[2023-04-07 01:33:16] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 0 ms to minimize.
[2023-04-07 01:33:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 331 ms
[2023-04-07 01:33:17] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-04-07 01:33:17] [INFO ] After 696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 87 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 394/394 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 116 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2023-04-07 01:33:17] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2023-04-07 01:33:17] [INFO ] Invariant cache hit.
[2023-04-07 01:33:17] [INFO ] Implicit Places using invariants in 637 ms returned []
[2023-04-07 01:33:17] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2023-04-07 01:33:17] [INFO ] Invariant cache hit.
[2023-04-07 01:33:18] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:33:19] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 2328 ms to find 0 implicit places.
[2023-04-07 01:33:19] [INFO ] Redundant transitions in 118 ms returned []
[2023-04-07 01:33:19] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2023-04-07 01:33:19] [INFO ] Invariant cache hit.
[2023-04-07 01:33:20] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3246 ms. Remains : 394/394 places, 2106/2106 transitions.
Graph (trivial) has 1952 edges and 394 vertex of which 63 / 394 are part of one of the 8 SCC in 4 ms
Free SCC test removed 55 places
Drop transitions removed 212 transitions
Ensure Unique test removed 1402 transitions
Reduce isomorphic transitions removed 1614 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 339 transition count 413
Reduce places removed 79 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 260 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 259 transition count 412
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 161 place count 259 transition count 397
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 37 rules applied. Total rules applied 198 place count 237 transition count 397
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 420 place count 126 transition count 286
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 3 with 56 rules applied. Total rules applied 476 place count 126 transition count 230
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 492 place count 118 transition count 231
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 499 place count 118 transition count 224
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 506 place count 118 transition count 217
Free-agglomeration rule applied 51 times.
Iterating global reduction 5 with 51 rules applied. Total rules applied 557 place count 118 transition count 166
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 5 with 51 rules applied. Total rules applied 608 place count 67 transition count 166
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 616 place count 67 transition count 166
Applied a total of 616 rules in 45 ms. Remains 67 /394 variables (removed 327) and now considering 166/2106 (removed 1940) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 166 rows 67 cols
[2023-04-07 01:33:20] [INFO ] Computed 18 invariants in 2 ms
[2023-04-07 01:33:20] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:33:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-07 01:33:20] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 01:33:20] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:33:20] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-07 01:33:20] [INFO ] After 11ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:33:20] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-07 01:33:20] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 656 transition count 2368
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 656 transition count 2368
Applied a total of 4 rules in 47 ms. Remains 656 /658 variables (removed 2) and now considering 2368/2384 (removed 16) transitions.
[2023-04-07 01:33:20] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2023-04-07 01:33:20] [INFO ] Computed 25 invariants in 10 ms
[2023-04-07 01:33:21] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-04-07 01:33:21] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:33:21] [INFO ] Invariant cache hit.
[2023-04-07 01:33:21] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:33:24] [INFO ] Implicit Places using invariants and state equation in 3350 ms returned []
Implicit Place search using SMT with State Equation took 3760 ms to find 0 implicit places.
[2023-04-07 01:33:24] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:33:24] [INFO ] Invariant cache hit.
[2023-04-07 01:33:25] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/658 places, 2368/2384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4581 ms. Remains : 656/658 places, 2368/2384 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s366 0) (EQ s400 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 879 ms.
Product exploration explored 100000 steps with 50000 reset in 762 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 (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-00 finished in 6488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p0)))))'
Support contains 2 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 656 transition count 2368
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 656 transition count 2368
Applied a total of 4 rules in 85 ms. Remains 656 /658 variables (removed 2) and now considering 2368/2384 (removed 16) transitions.
[2023-04-07 01:33:27] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:33:27] [INFO ] Invariant cache hit.
[2023-04-07 01:33:27] [INFO ] Implicit Places using invariants in 615 ms returned []
[2023-04-07 01:33:27] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:33:27] [INFO ] Invariant cache hit.
[2023-04-07 01:33:28] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:33:31] [INFO ] Implicit Places using invariants and state equation in 3359 ms returned []
Implicit Place search using SMT with State Equation took 3993 ms to find 0 implicit places.
[2023-04-07 01:33:31] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:33:31] [INFO ] Invariant cache hit.
[2023-04-07 01:33:31] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/658 places, 2368/2384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4855 ms. Remains : 656/658 places, 2368/2384 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(OR (EQ s97 0) (EQ s196 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33356 reset in 634 ms.
Product exploration explored 100000 steps with 33337 reset in 654 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 : []
Knowledge based reduction with 3 factoid took 591 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 436 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=218 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Applied a total of 0 rules in 18 ms. Remains 656 /656 variables (removed 0) and now considering 2368/2368 (removed 0) transitions.
[2023-04-07 01:33:34] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:33:34] [INFO ] Invariant cache hit.
[2023-04-07 01:33:34] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-04-07 01:33:34] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:33:34] [INFO ] Invariant cache hit.
[2023-04-07 01:33:35] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:33:38] [INFO ] Implicit Places using invariants and state equation in 3186 ms returned []
Implicit Place search using SMT with State Equation took 3593 ms to find 0 implicit places.
[2023-04-07 01:33:38] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:33:38] [INFO ] Invariant cache hit.
[2023-04-07 01:33:38] [INFO ] Dead Transitions using invariants and state equation in 891 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4518 ms. Remains : 656/656 places, 2368/2368 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 206 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=103 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33487 reset in 720 ms.
Product exploration explored 100000 steps with 33403 reset in 627 ms.
Built C files in :
/tmp/ltsmin15835613341231108159
[2023-04-07 01:33:41] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15835613341231108159
Running compilation step : cd /tmp/ltsmin15835613341231108159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15835613341231108159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15835613341231108159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Applied a total of 0 rules in 14 ms. Remains 656 /656 variables (removed 0) and now considering 2368/2368 (removed 0) transitions.
[2023-04-07 01:33:44] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:33:44] [INFO ] Invariant cache hit.
[2023-04-07 01:33:44] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-04-07 01:33:44] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:33:44] [INFO ] Invariant cache hit.
[2023-04-07 01:33:45] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:33:47] [INFO ] Implicit Places using invariants and state equation in 2847 ms returned []
Implicit Place search using SMT with State Equation took 3239 ms to find 0 implicit places.
[2023-04-07 01:33:47] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:33:47] [INFO ] Invariant cache hit.
[2023-04-07 01:33:48] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4009 ms. Remains : 656/656 places, 2368/2368 transitions.
Built C files in :
/tmp/ltsmin7416664481840415364
[2023-04-07 01:33:48] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7416664481840415364
Running compilation step : cd /tmp/ltsmin7416664481840415364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7416664481840415364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7416664481840415364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-04-07 01:33:51] [INFO ] Flatten gal took : 87 ms
[2023-04-07 01:33:51] [INFO ] Flatten gal took : 83 ms
[2023-04-07 01:33:51] [INFO ] Time to serialize gal into /tmp/LTL10867539300729908789.gal : 17 ms
[2023-04-07 01:33:51] [INFO ] Time to serialize properties into /tmp/LTL17863327503309372172.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10867539300729908789.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6478613042932592257.hoa' '-atoms' '/tmp/LTL17863327503309372172.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17863327503309372172.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6478613042932592257.hoa
Detected timeout of ITS tools.
[2023-04-07 01:34:07] [INFO ] Flatten gal took : 73 ms
[2023-04-07 01:34:07] [INFO ] Flatten gal took : 73 ms
[2023-04-07 01:34:07] [INFO ] Time to serialize gal into /tmp/LTL6659981430236685893.gal : 11 ms
[2023-04-07 01:34:07] [INFO ] Time to serialize properties into /tmp/LTL14480967861353605683.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6659981430236685893.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14480967861353605683.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((X("((p08_6_1==0)||(p12_4_0==1))"))&&("((p08_6_1==0)||(p12_4_0==1))")))))
Formula 0 simplified : FG(!"((p08_6_1==0)||(p12_4_0==1))" | X!"((p08_6_1==0)||(p12_4_0==1))")
Detected timeout of ITS tools.
[2023-04-07 01:34:22] [INFO ] Flatten gal took : 62 ms
[2023-04-07 01:34:22] [INFO ] Applying decomposition
[2023-04-07 01:34:22] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10513461496007390797.txt' '-o' '/tmp/graph10513461496007390797.bin' '-w' '/tmp/graph10513461496007390797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10513461496007390797.bin' '-l' '-1' '-v' '-w' '/tmp/graph10513461496007390797.weights' '-q' '0' '-e' '0.001'
[2023-04-07 01:34:22] [INFO ] Decomposing Gal with order
[2023-04-07 01:34:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 01:34:23] [INFO ] Removed a total of 4614 redundant transitions.
[2023-04-07 01:34:23] [INFO ] Flatten gal took : 481 ms
[2023-04-07 01:34:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 661 labels/synchronizations in 94 ms.
[2023-04-07 01:34:23] [INFO ] Time to serialize gal into /tmp/LTL1714944831616206591.gal : 21 ms
[2023-04-07 01:34:23] [INFO ] Time to serialize properties into /tmp/LTL7806105037821240148.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1714944831616206591.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7806105037821240148.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((X("((i3.u28.p08_6_1==0)||(i15.i0.u22.p12_4_0==1))"))&&("((i3.u28.p08_6_1==0)||(i15.i0.u22.p12_4_0==1))")))))
Formula 0 simplified : FG(!"((i3.u28.p08_6_1==0)||(i15.i0.u22.p12_4_0==1))" | X!"((i3.u28.p08_6_1==0)||(i15.i0.u22.p12_4_0==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin481308146740254703
[2023-04-07 01:34:38] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin481308146740254703
Running compilation step : cd /tmp/ltsmin481308146740254703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin481308146740254703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin481308146740254703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-01 finished in 74405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 4 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 656 transition count 2368
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 656 transition count 2368
Applied a total of 4 rules in 25 ms. Remains 656 /658 variables (removed 2) and now considering 2368/2384 (removed 16) transitions.
[2023-04-07 01:34:41] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:34:41] [INFO ] Invariant cache hit.
[2023-04-07 01:34:42] [INFO ] Implicit Places using invariants in 599 ms returned []
[2023-04-07 01:34:42] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:34:42] [INFO ] Invariant cache hit.
[2023-04-07 01:34:42] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:34:45] [INFO ] Implicit Places using invariants and state equation in 3386 ms returned []
Implicit Place search using SMT with State Equation took 3996 ms to find 0 implicit places.
[2023-04-07 01:34:45] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:34:45] [INFO ] Invariant cache hit.
[2023-04-07 01:34:46] [INFO ] Dead Transitions using invariants and state equation in 749 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/658 places, 2368/2384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4780 ms. Remains : 656/658 places, 2368/2384 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (EQ s648 0) (EQ s469 1)), p0:(AND (NEQ s196 0) (NEQ s343 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 16 reset in 228 ms.
Stack based approach found an accepted trace after 3100 steps with 0 reset with depth 3101 and stack size 3057 in 9 ms.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-02 finished in 5129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 658 transition count 2376
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 650 transition count 2376
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 650 transition count 2177
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 451 transition count 2177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 415 place count 450 transition count 2169
Iterating global reduction 2 with 1 rules applied. Total rules applied 416 place count 450 transition count 2169
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 524 place count 396 transition count 2115
Applied a total of 524 rules in 149 ms. Remains 396 /658 variables (removed 262) and now considering 2115/2384 (removed 269) transitions.
[2023-04-07 01:34:46] [INFO ] Flow matrix only has 667 transitions (discarded 1448 similar events)
// Phase 1: matrix 667 rows 396 cols
[2023-04-07 01:34:46] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 01:34:47] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-04-07 01:34:47] [INFO ] Flow matrix only has 667 transitions (discarded 1448 similar events)
[2023-04-07 01:34:47] [INFO ] Invariant cache hit.
[2023-04-07 01:34:47] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-07 01:34:48] [INFO ] Implicit Places using invariants and state equation in 1644 ms returned []
Implicit Place search using SMT with State Equation took 1999 ms to find 0 implicit places.
[2023-04-07 01:34:48] [INFO ] Redundant transitions in 89 ms returned []
[2023-04-07 01:34:48] [INFO ] Flow matrix only has 667 transitions (discarded 1448 similar events)
[2023-04-07 01:34:48] [INFO ] Invariant cache hit.
[2023-04-07 01:34:49] [INFO ] Dead Transitions using invariants and state equation in 647 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 396/658 places, 2115/2384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2894 ms. Remains : 396/658 places, 2115/2384 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s74 0) (EQ s115 1)), p0:(OR (EQ s113 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 294 reset in 254 ms.
Stack based approach found an accepted trace after 1679 steps with 5 reset with depth 260 and stack size 232 in 5 ms.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-03 finished in 3331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 4 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 656 transition count 2368
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 656 transition count 2368
Applied a total of 4 rules in 31 ms. Remains 656 /658 variables (removed 2) and now considering 2368/2384 (removed 16) transitions.
[2023-04-07 01:34:50] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2023-04-07 01:34:50] [INFO ] Computed 25 invariants in 12 ms
[2023-04-07 01:34:50] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-04-07 01:34:50] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:34:50] [INFO ] Invariant cache hit.
[2023-04-07 01:34:50] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:34:53] [INFO ] Implicit Places using invariants and state equation in 3159 ms returned []
Implicit Place search using SMT with State Equation took 3585 ms to find 0 implicit places.
[2023-04-07 01:34:53] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:34:53] [INFO ] Invariant cache hit.
[2023-04-07 01:34:54] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/658 places, 2368/2384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4412 ms. Remains : 656/658 places, 2368/2384 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s620 0) (EQ s650 1) (AND (NEQ s599 0) (NEQ s120 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 726 ms.
Product exploration explored 100000 steps with 50000 reset in 737 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), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-08 finished in 6018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 658 transition count 2376
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 650 transition count 2376
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 197 Pre rules applied. Total rules applied 16 place count 650 transition count 2179
Deduced a syphon composed of 197 places in 2 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 2 with 394 rules applied. Total rules applied 410 place count 453 transition count 2179
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 412 place count 451 transition count 2163
Iterating global reduction 2 with 2 rules applied. Total rules applied 414 place count 451 transition count 2163
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 526 place count 395 transition count 2107
Applied a total of 526 rules in 112 ms. Remains 395 /658 variables (removed 263) and now considering 2107/2384 (removed 277) transitions.
[2023-04-07 01:34:56] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
// Phase 1: matrix 659 rows 395 cols
[2023-04-07 01:34:56] [INFO ] Computed 25 invariants in 7 ms
[2023-04-07 01:34:56] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-04-07 01:34:56] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
[2023-04-07 01:34:56] [INFO ] Invariant cache hit.
[2023-04-07 01:34:56] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:34:58] [INFO ] Implicit Places using invariants and state equation in 1568 ms returned []
Implicit Place search using SMT with State Equation took 1942 ms to find 0 implicit places.
[2023-04-07 01:34:58] [INFO ] Redundant transitions in 45 ms returned []
[2023-04-07 01:34:58] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
[2023-04-07 01:34:58] [INFO ] Invariant cache hit.
[2023-04-07 01:34:58] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 395/658 places, 2107/2384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2694 ms. Remains : 395/658 places, 2107/2384 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s192 0) (EQ s112 1) (EQ s120 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 278 reset in 236 ms.
Stack based approach found an accepted trace after 4215 steps with 4 reset with depth 230 and stack size 197 in 11 ms.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-13 finished in 3033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p0)))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-08-LTLCardinality-01
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 658 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 658 transition count 2376
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 650 transition count 2376
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 650 transition count 2177
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 451 transition count 2177
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 416 place count 449 transition count 2161
Iterating global reduction 2 with 2 rules applied. Total rules applied 418 place count 449 transition count 2161
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 526 place count 395 transition count 2107
Applied a total of 526 rules in 80 ms. Remains 395 /658 variables (removed 263) and now considering 2107/2384 (removed 277) transitions.
[2023-04-07 01:34:59] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
// Phase 1: matrix 659 rows 395 cols
[2023-04-07 01:34:59] [INFO ] Computed 25 invariants in 6 ms
[2023-04-07 01:34:59] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-04-07 01:34:59] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
[2023-04-07 01:34:59] [INFO ] Invariant cache hit.
[2023-04-07 01:34:59] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:35:01] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned []
Implicit Place search using SMT with State Equation took 1928 ms to find 0 implicit places.
[2023-04-07 01:35:01] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
[2023-04-07 01:35:01] [INFO ] Invariant cache hit.
[2023-04-07 01:35:01] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 395/658 places, 2107/2384 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2649 ms. Remains : 395/658 places, 2107/2384 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(OR (EQ s97 0) (EQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33131 reset in 466 ms.
Stack based approach found an accepted trace after 21140 steps with 7053 reset with depth 17 and stack size 17 in 98 ms.
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-01 finished in 3425 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-04-07 01:35:02] [INFO ] Flatten gal took : 57 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16913330968944959977
[2023-04-07 01:35:02] [INFO ] Too many transitions (2384) to apply POR reductions. Disabling POR matrices.
[2023-04-07 01:35:02] [INFO ] Applying decomposition
[2023-04-07 01:35:02] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16913330968944959977
Running compilation step : cd /tmp/ltsmin16913330968944959977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-04-07 01:35:02] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16728736140528737588.txt' '-o' '/tmp/graph16728736140528737588.bin' '-w' '/tmp/graph16728736140528737588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16728736140528737588.bin' '-l' '-1' '-v' '-w' '/tmp/graph16728736140528737588.weights' '-q' '0' '-e' '0.001'
[2023-04-07 01:35:02] [INFO ] Decomposing Gal with order
[2023-04-07 01:35:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 01:35:02] [INFO ] Removed a total of 4604 redundant transitions.
[2023-04-07 01:35:03] [INFO ] Flatten gal took : 177 ms
[2023-04-07 01:35:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 533 labels/synchronizations in 79 ms.
[2023-04-07 01:35:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality12304709016126168034.gal : 12 ms
[2023-04-07 01:35:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality17734033280660359859.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12304709016126168034.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17734033280660359859.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i14.u29.p08_6_1==0)||(i5.u48.p12_4_0==1))")&&(X("((i14.u29.p08_6_1==0)||(i5.u48.p12_4_0==1))"))))))
Formula 0 simplified : FG(!"((i14.u29.p08_6_1==0)||(i5.u48.p12_4_0==1))" | X!"((i14.u29.p08_6_1==0)||(i5.u48.p12_4_0==1))")
Compilation finished in 5204 ms.
Running link step : cd /tmp/ltsmin16913330968944959977;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin16913330968944959977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)&&X((LTLAPp0==true)))))' '--buchi-type=spotba'
LTSmin run took 734 ms.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 127568 ms.

BK_STOP 1680831309594

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="EisenbergMcGuire-PT-08"
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-5348"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-08, 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 r517-tall-167987243600259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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